Accepted papers

3 minute read

  1. Ross Horne: Session Subtyping and Multiparty Compatibility using Circular Sequents
  2. Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi and Patrick Totzke: Strategy Complexity of Parity Objectives in Countable MDPs
  3. Emanuele D’Osualdo and Felix Stutz: Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions
  4. A. R. Balasubramanian and Igor Walukiewicz: Characterizing consensus in the Heard-Of model
  5. Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi and Dominik Wojtczak: Reduction from Stochastic Parity Games to Stochastic Reachability Games for Model-Free Reinforcement Learning
  6. Shaull Almagor, Nathann Cohen, Guillermo Perez, Mahsa Shirmohammadi and James Worrell: Coverability in 1-VASS with Disequality Tests
  7. Wojciech Czerwiński, Sławomir Lasota, Ranko Lazic, Jérôme Leroux and Filip Mazowiecki: Reachability in fixed dimension vector addition systems with states
  8. Clément Aubert and Ioana Cristescu: How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
  9. Javier Esparza and Fabian Reiter: A Classification of Weak Asynchronous Models of Distributed Computing
  10. Krishnendu Chatterjee, Thomas Henzinger and Jan Otop: Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States
  11. Ankush Das and Frank Pfenning: Session Types with Arithmetic Refinements
  12. Eike Neumann, Joel Ouaknine and James Worrell: On Ranking Function Synthesis and Termination for Polynomial Programs
  13. Patricia Bouyer, Stephane Le Roux, Youssouf Oualhadj, Mickael Randour and Pierre Vandenhove: Games Where You Can Play Optimally with Arena-Independent Finite Memory
  14. Mikhail Raskin, Chana Weil-Kennedy and Javier Esparza: Flatness and Complexity of Immediate Observation Petri Nets
  15. Paul Bell and Pavel Semukhin: Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs
  16. Doriana Medić and Ivan Lanese: A general approach to derive uncontrolled reversible semantics
  17. Jérôme Leroux and Grégoire Sutre: Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free
  18. Dmitry Chistikov, Stefan Kiefer, Andrzej Murawski and David Purser: The Big-O Problem for Labelled Markov Chains and Weighted Automata
  19. David N. Jansen, Jan Friso Groote, Ferry Timmers and Pengfei Yang: A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
  20. Matteo Mio and Valeria Vignudelli: Monads and Quantitative Equational Theories for Nondeterminism and Probability
  21. Rob van Glabbeek: Reactive Bisimulation Semantics for a Process Algebra with Time-outs
  22. Florian Horn and Arnaud Sangnier: Deciding the existence of cut-off in parameterized rendez-vous networks
  23. Jana Wagemaker, Paul Brunet, Simon Docherty, Tobias Kappé, Jurriaan Rot and Alexandra Silva: Partially Observable Concurrent Kleene Algebra
  24. Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan and Ashutosh Trivedi: Weighted Transducers for Robustness Verification
  25. Damien Busatto-Gaston, Debraj Chakraborty, Gilles Geeraerts and Jean-Francois Raskin: Monte Carlo Tree Search guided by Symbolic Advice for MDPs
  26. Daniel Hirschkoff, Enguerrand Prebet and Davide Sangiorgi: On the Representation of References in the Pi-calculus
  27. Rupak Majumdar, Joel Ouaknine, Amaury Pouly and James Worrell: Algebraic Invariants for Linear Hybrid Automata
  28. Paolo Baldan, Barbara König and Tommaso Padoan: Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
  29. Shaull Almagor, Udi Boker, Piotr Hofman and Patrick Totzke: Parametrized Universality Problems for One-Counter Nets
  30. Jens Oliver Gutsfeld, Markus Müller-Olm and Christoph Ohrem: Propositional Dynamic Logic for Hyperproperties
  31. Omar Inverso, Hernán Melgratti, Luca Padovani, Catia Trubiani and Emilio Tuosto: Probabilistic Analysis of Binary Sessions
  32. Benedikt Bollig, Alain Finkel and Amrita Suresh: Bounded Reachability Problems are Decidable in FIFO Machines
  33. Lorenzo Clemente, Sławomir Lasota and Radosław Piórkowski: Determinizability of one-clock timed automata
  34. Parosh Abdulla, Mohamed Faouzi Atig, Vrunda Dave and Krishna S: On the Separability Problem of String Constraints
  35. Luca Aceto, Valentina Castiglioni, Anna Ingolfsdottir, Bas Luttik and Mathias Ruggaard Pedersen: On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
  36. Paul Wild and Lutz Schröder: Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
  37. Wojciech Czerwiński, Diego Figueira and Piotr Hofman: Universality Problem for Unambiguous VASS
  38. Xinxin Liu and Tingting Yu: Canonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations
  39. Dan Plyukhin and Gul Agha: Scalable Termination Detection for Distributed Actor Systems
  40. Vrunda Dave, Emmanuel Filiot, Krishna S and Nathan Lhote: Synthesis of Computable Regular Functions of Infinite Words
  41. Saptarshi Sarkar, Bharat Adsul, Paul Gastin and Pascal Weil: Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
  42. Joshua Moerman and Matteo Sammartino: Residual Nominal Automata
  43. Francesco Ranzato: Decidability and Synthesis of Abstract Inductive Invariants
  44. Amina Doumane and Damien Pous: Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
  45. Benjamin Monmege, Julie Parreaux and Pierre-Alain Reynier: Reaching Your Goal Optimally by Playing at Random