Machine learning meets formal verification
Luca Bortolussi

Relational decision procedures with their applications to nonclassical logics
Joanna Golinska-Pilarek and Michał Zawidzki

Fixpoints in VASS: Results and applications
Arnaud Sangnier

Partial solvers for parity games: effective polynomial-time composition
Patrick Ah-Fat and Michael Huth

Relation-Changing Logics as Fragments of Hybrid Logics
Carlos Areces, Raul Fervari, Guillaume Hoffmann and Mauricio Martel

A Delayed Promotion Policy for Parity Games
Massimo Benerecetti, Daniele Dell'Erba and Fabio Mogavero

Games for topological fixpoint logic
Nick Bezhanishvili and Clemens Kupke

Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron and Pietro Sala

On the Expressive Power of Sub-Propositional Fragments of Modal Logic
Davide Bresolin, Emilio Muñoz-Velasco and Guido Sciavicco

Alternation Is Strict For Higher-Order Modal Fixpoint Logic
Florian Bruse

A Canonical Model Construction for Iteration-Free PDL with Intersection
Florian Bruse, Daniel Kernberger and Martin Lange

Window parity games: an alternative approach toward parity games with time bounds
Véronique Bruyère, Quentin Hautem and Mickael Randour

Weighted linear dynamic logic
Manfred Droste and George Rahonis

Cycle Detection in Computation Tree Logic
Gaelle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli and Loredana Sorrentino

Bounded-oscillation pushdown automata
Pierre Ganty and Damir Valput

On quantified propositional logics and the exponential time hierarchy
Miika Hannula, Juha Kontinen, Martin Lück and Jonni Virtema

Multi-Buffer Simulations for Trace Language Inclusion
Milka Hutagalung, Martin Lange, Norbert Hundeshagen, Dietrich Kuske and Etienne Lozes

Distributed PROMPT-LTL Synthesis
Swen Jacobs, Leander Tentrup and Martin Zimmermann

A semi-potential for finite and infinite sequential games
Stephane Le Roux and Arno Pauly

Certification of prefixed tableau proofs for modal logic
Tomer Libal and Marco Volpe

The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities
Yoshiki Nakamura

A new rule for LTL tableaux
Mark Reynolds

Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-Exponential Time
Leander Tentrup, Alexander Weinert and Martin Zimmermann