Accepted Papers
- Alexander Weinert. Quantitative Reductions and Vertex-Ranked Infinite Games
- Balasubramanian A.R.. Parameterized Verification of Coverability in Well-Structured Broadcast Networks
- Michele Chiari, Dino Mandrioli, and Matteo Pradella. Temporal Logic and Model Checking for Operator Precedence Languages
- Luca Geatti, Nicola Gigante, Angelo Montanari, and Mark Reynolds. One-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past
- Laura Bozzelli, Alberto Molinari, Angelo Montanari, and Adriano Peron. Complexity of Timeline-based Planning over Dense Temporal Domains: Exploring the Middle Ground
- Federico Aschieri, Agata Ciabattoni, and Francesco Antonio Genco. Classical Proofs as Parallel Programs
- Arno Pauly. Parameterized Games and Parameterized Automata
- Tobias Rosenkrantz Gundersen, Florian Lorber, Ulrik Nyman, and Christian Ovesen. Effortless Fault Localisation: Conformance Testing of Real-Time Systems in Ecdar
- Thomas Brihaye, Véronique Bruyère, Aline Goeminne, and Jean-Francois Raskin. Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives
- Pietro Galliani. Safe Dependency Atoms and Possibility Operators in Team Semantics
- Marcin Przybyłko. On Computing the Measures of First-Order Definable Sets of Trees
- Dana Angluin and Dana Fisman. Regular ω-Languages with an Informative Right Congruence
- Patricia Bouyer, Mauricio González, Nicolas Markey, and Mickael Randour. Multi-weighted Markov Decision Processes with Reachability Objectives
- Thiago Rocha, Ana Teresa Martins, and Francicleber Ferreira. On Finding a First-Order Sentence Consistent with a Sample of Strings
- Lisette Sanchez, Wieger Wesselink, and Tim Willemse. A Comparison of BDD-Based Parity Game Solvers
- Petra van den Bos and Marielle Stoelinga. Tester versus Bug: A Generic Framework for Model-Based Testing via Games
- Jesko Hecking-Harbusch and Leander Tentrup. Solving QBF by Abstraction
- Laura Bozzelli, Aniello Murano and Adriano Peron. Timed Context-Free Temporal Logics
- Éric Goubault, Jérémy Ledent, and Sergio Rajsbaum. A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability
