default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th FoSSaCS 2022: Munich, Germany
- Patricia Bouyer
, Lutz Schröder:
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. Lecture Notes in Computer Science 13242, Springer 2022, ISBN 978-3-030-99252-1 - Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George:
Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. 1-20 - Flavio Ascari, Roberto Bruni, Roberta Gori:
Limits and difficulties in the design of under-approximation abstract domains. 21-39 - Christel Baier, Florian Funke, Jakob Piribauer, Robin Ziemek:
On probability-raising causality in Markov decision processes. 40-60 - A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy:
Parameterized Analysis of Reconfigurable Broadcast Networks. 61-80 - Michael Blondin, Javier Esparza:
Separators in Continuous Petri Nets. 81-100 - Guillaume Boisseau, Robin Piedeleu:
Graphical Piecewise-Linear Algebra. 101-119 - Udi Boker, Karoliina Lehtinen:
Token Games and History-Deterministic Quantitative Automata. 120-139 - Udi Boker, Karoliina Lehtinen, Salomon Sickert:
On the Translation of Automata to Linear Temporal Logic. 140-160 - Anne Broadbent, Martti Karvonen:
Categorical composable cryptography. 161-183 - Georgiana Caltais, Hossein Hojjat, Mohammad Reza Mousavi, Hünkar Can Tunç:
DyNetKAT: An Algebra of Dynamic Networks. 184-204 - Davide Castelnovo, Fabio Gadducci, Marino Miculan:
A new criterion for M, N-adhesivity, with an application to hierarchical graphs. 205-224 - Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Quantifier elimination for counting extensions of Presburger arithmetic. 225-243 - Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
A first-order logic characterisation of safety and co-safety languages. 244-263 - Thomas Colcombet, Sam van Gool, Rémi Morvan:
First-order separation over countable ordinals. 264-284 - José Espírito Santo, Delia Kesner, Loïc Peyrot:
A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications. 285-304 - Raul Fervari, Alessio Mansutti:
Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy. 305-324 - Bernd Finkbeiner, Philippe Heim, Noemi Passing:
Temporal Stream Logic modulo Theories. 325-346 - Simon J. Gay, Diogo Poças, Vasco T. Vasconcelos:
The Different Shades of Infinite Session Types. 347-367 - Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. 368-388 - André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi:
Variable binding and substitution for (nameless) dummies. 389-408 - Reijo Jaakkola:
Uniform Guarded Fragments. 409-427 - Dylan McDermott, Exequiel Rivas, Tarmo Uustalu:
Sweedler Theory of Monads. 428-448 - Tobias Winkler, Christina Gehnen, Joost-Pieter Katoen:
Model Checking Temporal Properties of Recursive Probabilistic Programs. 449-469
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-23 22:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
