Accepted Papers
Regular Papers
Ashutosh Gupta.
Improved Single Pass Algorithms for Resolution Proof Reduction
Mohamed Amin Ben Sassi, Romain Testylier, Thao Dang and Antoine Girard.
Reachability Analysis of Polynomial Systems using Linear Programming Relaxations.
Matthias Guedemann, Gwen Salaün and Meriem Ouederni.
Counterexample Guided Synthesis of Monitors for Realizability Enforcement
Sadegh Esmaeil Zadeh Soudjani and Alessandro Abate.
Higher-Order Approximations for Verification of Stochastic Hybrid Systems
Shulamit Halamish and Orna Kupferman.
Approximating Deterministic Lattice Automata
Daniel Neider.
Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers
John Fearnley, Doron Peled and Sven Schewe.
Synthesis of Succinct Systems
Sofia Cassel, Bengt Jonsson, Falk Howar and Bernhard Steffen.
A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations
Bernd Becker, Rüdiger Ehlers, Matthew Lewis and Paolo Marin.
ALLQBF Solving by Computational Learning
Sergio Giro and Markus N. Rabe.
Verification of partial-information probabilistic systems using counterexample-guided refinements
Tool Papers
Ondrej Sery, Grigory Fedyukovich and Natasha Sharygina.
FunFrog: Bounded Model Checking with Interpolation-based Function Summarization
Andreas Gaiser, Jan Kretinsky and Javier Esparza.
Rabinizer: Small Deterministic Automata for LTL(F,G)