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

Foundations of Software Science and Computation Structures

25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings

  • This book is open access, which means that you have free and unlimited access

Conference proceedings info: FoSSaCS 2022.

Buying options

Softcover Book USD 49.99
Price excludes VAT (USA)

Table of contents (23 papers)

  1. Front Matter

    Pages i-xvi
  2. Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata

    • Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George
    Pages 1-20Open Access
  3. Limits and difficulties in the design of under-approximation abstract domains

    • Flavio Ascari, Roberto Bruni, Roberta Gori
    Pages 21-39Open Access
  4. On probability-raising causality in Markov decision processes

    • Christel Baier, Florian Funke, Jakob Piribauer, Robin Ziemek
    Pages 40-60Open Access
  5. Parameterized Analysis of Reconfigurable Broadcast Networks

    • A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy
    Pages 61-80Open Access
  6. Separators in Continuous Petri Nets

    • Michael Blondin, Javier Esparza
    Pages 81-100Open Access
  7. Graphical Piecewise-Linear Algebra

    • Guillaume Boisseau, Robin Piedeleu
    Pages 101-119Open Access
  8. Token Games and History-Deterministic Quantitative Automata

    • Udi Boker, Karoliina Lehtinen
    Pages 120-139Open Access
  9. On the Translation of Automata to Linear Temporal Logic

    • Udi Boker, Karoliina Lehtinen, Salomon Sickert
    Pages 140-160Open Access
  10. Categorical composable cryptography

    • Anne Broadbent, Martti Karvonen
    Pages 161-183Open Access
  11. DyNetKAT: An Algebra of Dynamic Networks

    • Georgiana Caltais, Hossein Hojjat, Mohammad Reza Mousavi, Hünkar Can Tunç
    Pages 184-204Open Access
  12. A new criterion for \(\mathcal {M}, \mathcal {N}\) -adhesivity, with an application to hierarchical graphs

    • Davide Castelnovo, Fabio Gadducci, Marino Miculan
    Pages 205-224Open Access
  13. Quantifier elimination for counting extensions of Presburger arithmetic

    • Dmitry Chistikov, Christoph Haase, Alessio Mansutti
    Pages 225-243Open Access
  14. A first-order logic characterisation of safety and co-safety languages

    • Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta
    Pages 244-263Open Access
  15. First-order separation over countable ordinals

    • Thomas Colcombet, Sam van Gool, Rémi Morvan
    Pages 264-284Open Access
  16. A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications

    • José Espírito Santo, Delia Kesner, Loïc Peyrot
    Pages 285-304Open Access
  17. Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy

    • Raul Fervari, Alessio Mansutti
    Pages 305-324Open Access
  18. Temporal Stream Logic modulo Theories

    • Bernd Finkbeiner, Philippe Heim, Noemi Passing
    Pages 325-346Open Access
  19. The Different Shades of Infinite Session Types

    • Simon J. Gay, Diogo Poças, Vasco T. Vasconcelos
    Pages 347-367Open Access
  20. Complete and tractable machine-independent characterizations of second-order polytime

    • Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
    Pages 368-388Open Access

Other Volumes

  1. Foundations of Software Science and Computation Structures

About this book

This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022.

The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.



  • Categorical models and logics
  • language theory, automata, and games
  • modal, spatial, and temporal logics
  • type theory and proof theory
  • concurrency theory and process calculi; rewriting theory
  • Open Access
  • semantics of programming languages
  • program analysis
  • logics of programming
  • software specification and refinement
  • models of concurrent systems
  • emerging models of computation
  • logical aspects of computational complexity
  • correctness, transformation, and verification
  • models of software security

Editors and Affiliations

  • Université Paris-Saclay, CNRS, ENS Paris-Saclay, Gif-sur-Yvette, France

    Patricia Bouyer

  • Friedrich-Alexander-Universität Erlangen, Erlangen, Germany

    Lutz Schröder

Bibliographic Information

Buying options

Softcover Book USD 49.99
Price excludes VAT (USA)