Skip to main content
  • Conference proceedings
  • Open Access
  • © 2019

Foundations of Software Science and Computation Structures

22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings

Editors:

(view affiliations)

Conference proceedings info: FoSSaCS 2019.

Buying options

Softcover Book
USD 59.99
Price excludes VAT (USA)

Table of contents (30 papers)

  1. Front Matter

    Pages i-xv
  2. Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games

    • Thomas Colcombet, Nathanaël Fijalkow
    Pages 1-26Open Access
  3. Resource-Tracking Concurrent Games

    • Aurore Alcolei, Pierre Clairambault, Olivier Laurent
    Pages 27-44Open Access
  4. Change Actions: Models of Generalised Differentiation

    • Mario Alvarez-Picallo, C.-H. Luke Ong
    Pages 45-61Open Access
  5. Coalgebra Learning via Duality

    • Simone Barlocco, Clemens Kupke, Jurriaan Rot
    Pages 62-79Open Access
  6. Tight Worst-Case Bounds for Polynomial Loop Programs

    • Amir M. Ben-Amram, Geoff W. Hamilton
    Pages 80-97Open Access
  7. A Complete Normal-Form Bisimilarity for State

    • Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
    Pages 98-114Open Access
  8. Identifiers in Registers

    • Benedikt Bollig, Patricia Bouyer, Fabian Reiter
    Pages 115-132Open Access
  9. The Impatient May Use Limited Optimism to Minimize Regret

    • Michaël Cadilhac, Guillermo A. Pérez, Marie van den Bogaard
    Pages 133-149Open Access
  10. Causality in Linear Logic

    • Simon Castellan, Nobuko Yoshida
    Pages 150-168Open Access
  11. Rewriting Abstract Structures: Materialization Explained Categorically

    • Andrea Corradini, Tobias Heindel, Barbara König, Dennis Nolte, Arend Rensink
    Pages 169-188Open Access
  12. Two-Way Parikh Automata with a Visibly Pushdown Stack

    • Luc Dartois, Emmanuel Filiot, Jean-Marc Talbot
    Pages 189-206Open Access
  13. Kleene Algebra with Hypotheses

    • Amina Doumane, Denis Kuperberg, Damien Pous, Pierre Pradic
    Pages 207-223Open Access
  14. Trees in Partial Higher Dimensional Automata

    • Jérémy Dubut
    Pages 224-241Open Access
  15. The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains

    • Mnacho Echenim, Radu Iosif, Nicolas Peltier
    Pages 242-259Open Access
  16. Continuous Reachability for Unordered Data Petri Nets is in PTime

    • Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
    Pages 260-276Open Access
  17. Optimal Satisfiability Checking for Arithmetic \(\mu \)-Calculi

    • Daniel Hausmann, Lutz Schröder
    Pages 277-294Open Access
  18. Constructing Inductive-Inductive Types in Cubical Type Theory

    • Jasper Hugunin
    Pages 295-312Open Access
  19. Causal Inference by String Diagram Surgery

    • Bart Jacobs, Aleks Kissinger, Fabio Zanasi
    Pages 313-329Open Access
  20. Higher-Order Distributions for Differential Linear Logic

    • Marie Kerjean, Jean-Simon Pacaud Lemay
    Pages 330-347Open Access

Other Volumes

  1. Foundations of Software Science and Computation Structures

    22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings

About this book

This book is Open Access under a CC BY licence.

Keywords

  • artificial intelligence
  • first order logic
  • formal languages
  • formal logic
  • graph theory
  • programming languages
  • semantics
  • data structures

Editors and Affiliations

  • University of Warsaw, Warsaw, Poland

    Mikołaj Bojańczyk

  • University of Ljubljana, Ljubljana, Slovenia

    Alex Simpson

Bibliographic Information

Buying options

Softcover Book
USD 59.99
Price excludes VAT (USA)