Advertisement

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

  • Mikołaj Bojańczyk
  • Alex Simpson
Open Access
Conference proceedings FoSSaCS 2019

Part of the Lecture Notes in Computer Science book series (LNCS, volume 11425)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 11425)

Table of contents

  1. Front Matter
    Pages i-xv
    PDF
  2. Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games
    Thomas Colcombet, Nathanaël Fijalkow
    Pages 1-26 Open Access
    PDF
  3. Resource-Tracking Concurrent Games
    Aurore Alcolei, Pierre Clairambault, Olivier Laurent
    Pages 27-44 Open Access
    PDF
  4. Change Actions: Models of Generalised Differentiation
    Mario Alvarez-Picallo, C.-H. Luke Ong
    Pages 45-61 Open Access
    PDF
  5. Coalgebra Learning via Duality
    Simone Barlocco, Clemens Kupke, Jurriaan Rot
    Pages 62-79 Open Access
    PDF
  6. Tight Worst-Case Bounds for Polynomial Loop Programs
    Amir M. Ben-Amram, Geoff W. Hamilton
    Pages 80-97 Open Access
    PDF
  7. A Complete Normal-Form Bisimilarity for State
    Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
    Pages 98-114 Open Access
    PDF
  8. Identifiers in Registers
    Benedikt Bollig, Patricia Bouyer, Fabian Reiter
    Pages 115-132 Open Access
    PDF
  9. The Impatient May Use Limited Optimism to Minimize Regret
    Michaël Cadilhac, Guillermo A. Pérez, Marie van den Bogaard
    Pages 133-149 Open Access
    PDF
  10. Causality in Linear Logic
    Simon Castellan, Nobuko Yoshida
    Pages 150-168 Open Access
    PDF
  11. Rewriting Abstract Structures: Materialization Explained Categorically
    Andrea Corradini, Tobias Heindel, Barbara König, Dennis Nolte, Arend Rensink
    Pages 169-188 Open Access
    PDF
  12. Two-Way Parikh Automata with a Visibly Pushdown Stack
    Luc Dartois, Emmanuel Filiot, Jean-Marc Talbot
    Pages 189-206 Open Access
    PDF
  13. Kleene Algebra with Hypotheses
    Amina Doumane, Denis Kuperberg, Damien Pous, Pierre Pradic
    Pages 207-223 Open Access
    PDF
  14. Trees in Partial Higher Dimensional Automata
    Jérémy Dubut
    Pages 224-241 Open Access
    PDF
  15. The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains
    Mnacho Echenim, Radu Iosif, Nicolas Peltier
    Pages 242-259 Open Access
    PDF
  16. Continuous Reachability for Unordered Data Petri Nets is in PTime
    Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
    Pages 260-276 Open Access
    PDF
  17. Optimal Satisfiability Checking for Arithmetic \(\mu \)-Calculi
    Daniel Hausmann, Lutz Schröder
    Pages 277-294 Open Access
    PDF
  18. Constructing Inductive-Inductive Types in Cubical Type Theory
    Jasper Hugunin
    Pages 295-312 Open Access
    PDF
  19. Causal Inference by String Diagram Surgery
    Bart Jacobs, Aleks Kissinger, Fabio Zanasi
    Pages 313-329 Open Access
    PDF
  20. Higher-Order Distributions for Differential Linear Logic
    Marie Kerjean, Jean-Simon Pacaud Lemay
    Pages 330-347 Open Access
    PDF
  21. Languages Ordered by the Subword Order
    Dietrich Kuske, Georg Zetzsche
    Pages 348-364 Open Access
    PDF
  22. Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces
    Thomas Leventis, Michele Pagani
    Pages 365-381 Open Access
    PDF
  23. A Sound and Complete Logic for Algebraic Effects
    Cristina Matache, Sam Staton
    Pages 382-399 Open Access
    PDF
  24. Equational Axiomatization of Algebras with Structure
    Stefan Milius, Henning Urbat
    Pages 400-417 Open Access
    PDF
  25. Towards a Structural Proof Theory of Probabilistic \(\mu \)-Calculi
    Christophe Lucas, Matteo Mio
    Pages 418-435 Open Access
    PDF
  26. Partial and Conditional Expectations in Markov Decision Processes with Integer Weights
    Jakob Piribauer, Christel Baier
    Pages 436-452 Open Access
    PDF
  27. Equational Theories and Monads from Polynomial Cayley Representations
    Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski
    Pages 453-469 Open Access
    PDF
  28. A Dialectica-Like Interpretation of a Linear MSO on Infinite Words
    Pierre Pradic, Colin Riba
    Pages 470-487 Open Access
    PDF
  29. Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time
    Helmut Seidl, Raphaela Palenta, Sebastian Maneth
    Pages 488-504 Open Access
    PDF
  30. Justness
    Rob van Glabbeek
    Pages 505-522 Open Access
    PDF
  31. Path Category for Free
    Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo
    Pages 523-540 Open Access
    PDF
  32. Back Matter
    Pages 541-542
    PDF

About these proceedings

Introduction

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

Editors and affiliations

  • Mikołaj Bojańczyk
    • 1
  • Alex Simpson
    • 2
  1. 1.University of WarsawWarsawPoland
  2. 2.University of LjubljanaLjubljanaSlovenia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-030-17127-8
  • Copyright Information The Editor(s) (if applicable) and The Author(s) 2019
  • License CC BY
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-030-17126-1
  • Online ISBN 978-3-030-17127-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site