FoSSaCS 2022 accepted papers

Udi Boker and Karoliina Lehtinen. Token Games and History-Deterministic Quantitative-Automata
Anne Broadbent and Martti Karvonen. Categorical composable cryptography
Simon Gay, Diogo Poças and Vasco Vasconcelos. The Different Shades of Infinite Session Types
Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion and Romain Péchoux. Complete and tractable machine-independent characterizations of second-order polytime
Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari and Stefano Tonetta. A first-order logic characterisation of safety and co-safety languages
Michael Blondin and Javier Esparza. Separators in Continuous Petri Nets
Christel Baier, Florian Funke, Jakob Piribauer and Robin Ziemek. On probability-raising causality in Markov decision processes
Reijo Jaakkola. Uniform guarded fragments
Dana Angluin, Timos Antonopoulos, Dana Fisman and Nevin George. Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata
A. R. Balasubramanian, Lucie Guillou and Chana Weil-Kennedy. Parameterized Analysis of Reconfigurable Broadcast Networks
Bernd Finkbeiner, Philippe Heim and Noemi Passing. Temporal Stream Logic modulo Theories
Tobias Winkler, Christina Gehnen and Joost-Pieter Katoen. Model Checking Temporal Properties of Recursive Probabilistic Programs
Flavio Ascari, Roberto Bruni and Roberta Gori. Limits and difficulties in the design of under-approximation abstract domains
José Espírito Santo, Delia Kesner and Loïc Peyrot. A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications
Raul Fervari and Alessio Mansutti. Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy
Guillaume Boisseau and Robin Piedeleu. Graphical Piecewise-Linear Algebra
Georgiana Caltais, Hossein Hojjat, Mohammadreza Mousavi and Hünkar Can Tunç. DyNetKAT: An Algebra of Dynamic Networks
Thomas Colcombet, Sam van Gool and Rémi Morvan. First-order separation over countable ordinals
André Hirschowitz, Tom Hirschowitz, Ambroise Lafont and Marco Maggesi. Variable binding and substitution for (nameless) dummies
Davide Castelnovo, Fabio Gadducci and Marino Miculan. A new criterion for M,N-adhesivity, with an application to hierarchical graphs
Dmitry Chistikov, Christoph Haase and Alessio Mansutti. Quantifier elimination for counting extensions of Presburger arithmetic
Udi Boker, Karoliina Lehtinen and Salomon Sickert. On the Translation of Automata to Linear Temporal Logic
Dylan McDermott, Exequiel Rivas and Tarmo Uustalu. Sweedler Theory of Monads

Who's online

We have 133 guests and no members online

Site Hosted by