List of Accepted Papers

  • Monotonic Abstraction for Programs with Multiply Pointed Structures
    Jonathan Cederberg, Parosh Abdulla and Tomas Vojnar
  • A new weakly universal cellular automaton in the 3D hyperbolic space with two states
    Maurice Margenstern
  • Reachability for Finite-State Process Algebras Using Static Analysis
    Nataliya Skrypnyuk and Flemming Nielson
  • A fully symbolic bisimulation algorithm
    Malcolm Mumme and Gianfranco Ciardo
  • Lower bounds for the length of reset words in eulerian automata
    Vladimir Gusev
  • Automated Termination in Model Checking Modulo Theories
    Alessandro Carioni, Silvio Ghilardi and Silvio Ranise
  • Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method
    Fribourg Laurent and Ulrich Kuehne
  • Characterizing Conclusive Approximations by Logical Formulae
    Yohan Boichut, Thi-Bich-Hanh Dao and Valerie Murat.
  • Synthesis of Timing Parameters Satisfying Safety Properties
    Étienne Andre' and Romain Soulat
  • Decidability of LTL Model Checking for Vector Addition Systems with one zero-test
    Remi Bonnet
  • Completeness of the Bounded Satisfiability Problem for Constraint LTL
    Marcello M. Bersani, Achille Frigeri, Matteo Rossi and Pierluigi San Pietro
  • Reachability and deadlocking problems in multi-stage scheduling
    Christian Eggermont and Gerhard J. Woeginger
  • Improving Reachability Analysis of Infinite State Systems by Specialization
    Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti and Valerio Senni
  • Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics
    Roland Axelsson and Martin Lange
  • Complexity Analysis of the Backward Coverability Algorithm for VASS
    Laura Bozzelli and Pierre Ganty
  • Efficient Bounded Reachability Computation for Rectangular Automata
    Xin Chen, Erika Abraham and Goran Frehse