• ​Jakub Michaliszyn, Jan Otop and Piotr Wieczorek. Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix
  • Flip Van Spaendonck and Tim Willemse. The Best of Both Worlds: Model-Driven Engineering meets Model-Based Testing
  • Myrthe Spronck and Bas Luttik. Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers
  • Roland Guttenberg, Mikhail Raskin and Javier Esparza. Geometry of Reachability Sets of Vector Addition Systems
  • Lucie Guillou, Arnaud Sangnier and Nathalie Sznajder. Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous
  • Eren Keskin and Roland Meyer. Separability and Non-Determinizability of WSTS
  • Åsmund Aqissiaq Arild Kløvstad, Eduard Kamburjan and Einar Broch Johnsen. Compositional Correctness and Completeness for Symbolic Partial Order Reduction
  • Pascal Baumann, Khushraj Madnani, Filip Mazowiecki and Georg Zetzsche. Monus semantics in vector addition systems with states
  • Gil Silva, Andreia Mordido and Vasco Vasconcelos. Subtyping Context-Free Session Types
  • Michal Ajdarow and Antonin Kucera. Asymptotic Complexity Estimates for Probabilistic Programs and their VASS Abstractions
  • Christoph Haase and Radosław Piórkowski. Universal quantification makes automatic structures hard to decide
  • Alain Finkel, Serge Haddad and Lina Ye. About Decisiveness of Dynamic Probabilistic Models
  • Anna Schmitt and Kirstin Peters. Probabilistic Operational Correspondence
  • Guy Avni, Pranav Ghorpade and Shibashis Guha. A Game of Pawns
  • Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi and N. Ege Saraç. Safety and Liveness of Quantitative Automata
  • Sougata Bose, David Purser and Patrick Totzke. History-deterministic Vector Addition Systems
  • Noam Shenwald and Orna Kupferman. Games with Trading of Control
  • Radu Iosif and Florian Zuleger. Expressiveness Results for an Inductive Logic of Separated Relations
  • Ezio Bartocci, Thomas Henzinger, Dejan Nickovic and Ana Oliveira Da Costa. Hypernode Automata
  • Alessandro Abate, Alec Edwards, Mirco Giacobbe, Hashan Punchihewa and Diptarko Roy. Quantitative Verification With Neural Networks
  • Krishna S, Khushraj Madnani, Rupak Majumdar and Paritosh Pandya. Satisfiability Checking For Multi-clock Unilateral TPTL is PSPACE Complete.
  • Anca Muscholl, Corto Mascle and Igor Walukiewicz. Model-checking parametric lock-sharing systems against regular constraints
  • Azalea Raad, Julien Vanegue, Josh Berdine and Peter O'Hearn. A General Approach to Under-approximate Reasoning about Concurrent Programs
  • Omri Isac, Yoni Zohar, Clark Barrett and Guy Katz. DNN Verification, Reachability, and the Exponential Function Problem
  • Hagit Attiya, Constantin Enea and Shafik Nassar. Faithful Simulation of Randomized BFT Protocols on Block DAGs
  • Jan Friso Groote and Tim A.C. Willemse. Real Equation Systems with Alternating Fixed-points
  • Stephane Demri and Karin Quaas. Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
  • Jesús Héctor Domínguez Sánchez and Aleksandar Nanevski. Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack
  • Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen and Martin Zimmermann. History-deterministic Parikh Automata
  • Jan Martens and Jan Friso Groote. Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
  • Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel and Damien Regnault. Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata
  • Tiange Liu, Alwen Tiu and Jim de Groot. Modal logics for mobile processes revisited
  • Sven Schewe, Qiyi Tang and Tansholpan Zhanabekova. Deciding What is Good-for-MDPs
  • Petr Jancar and Jérôme Leroux. Semilinear Home-Space Problem is Ackermann-Complete for Petri Nets
  • Yong Li, Sven Schewe and Moshe Vardi. Singly Exponential Translation of Alternating Weak Buchi Automata to Unambiguous Buchi Automata
  • Ugo Dal Lago and Maurizio Murgia. Contextual Behavioural Metrics
  • Ashwani Anand and Georg Zetzsche. Priority downward closures