11th International Workshop on Reachability Problems

      7 - 9 September 2017, London, UK

Accepted Papers

The following papers have been accepted for publication at RP 2017.

An Abstract Machine for Asynchronous Programs with Closures and Priority Queues
Davide Ancona, Giorgio Delzanno, Luca Franceschini, Maurizio Leotta, Enrico Prampolini, Marina Ribaudo and Filippo Ricca
Adding Dense-timed Stack to Integer Reset Timed Automata
Devendra Bhave and Shibashis Guha
Space-Efficient Fragments of Higher-Order Fixpoint Logic
Florian Bruse, Martin Lange and Etienne Lozes
Refinement of Trace Abstraction for Real-Time Programs
Franck Cassez, Peter Gjøl Jensen and Kim Guldstrand Larsen
Copyful Streaming String Transducers
Emmanuel Filiot and Pierre-Alain Reynier
Model Checking CTL over Restricted Classes of Automatic Structures
Norbert Hundeshagen and Martin Lange
Topological Characterisation of Multi-Buffer Simulation
Milka Hutagalung
Distributed control synthesis using Euler’s method
Adrien Le Coent, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Laurent Fribourg, Florian De Vuyst and Ludovic Chamoin
Reachability problem for polynomial iteration is PSPACE-complete
Reino Niskanen
Probabilistic Timed Automata with Clock-Dependent Probabilities
Jeremy Sproston
Stubborn Sets with Frozen Actions
Antti Valmari
Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions
Tomoyuki Yamakami

Important dates (Provisional):


Highlights 2017
Queen Mary
University of London
12-15 September 2017


We acknowledge the kind support of the EATCS