default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th RP 2017: London, UK
- Matthew Hague
, Igor Potapov:
Reachability Problems - 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings. Lecture Notes in Computer Science 10506, Springer 2017, ISBN 978-3-319-67088-1 - Laurent Doyen:
The Multiple Dimensions of Mean-Payoff Games - (Extended Abstract). 1-8 - Devendra Bhave, Shibashis Guha:
Adding Dense-Timed Stack to Integer Reset Timed Automata. 9-25 - Florian Bruse, Martin Lange, Étienne Lozes:
Space-Efficient Fragments of Higher-Order Fixpoint Logic. 26-41 - Franck Cassez, Peter Gjøl Jensen, Kim Guldstrand Larsen:
Refinement of Trace Abstraction for Real-Time Programs. 42-58 - Davide Ancona, Giorgio Delzanno, Luca Franceschini, Maurizio Leotta, Enrico Prampolini, Marina Ribaudo, Filippo Ricca:
An Abstract Machine for Asynchronous Programs with Closures and Priority Queues. 59-74 - Emmanuel Filiot, Pierre-Alain Reynier:
Copyful Streaming String Transducers. 75-86 - Norbert Hundeshagen, Martin Lange:
Model Checking CTL over Restricted Classes of Automatic Structures. 87-100 - Milka Hutagalung:
Topological Characterisation of Multi-buffer Simulation. 101-117 - Adrien Le Coënt, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Laurent Fribourg, Florian De Vuyst, Ludovic Chamoin:
Distributed Control Synthesis Using Euler's Method. 118-131 - Reino Niskanen:
Reachability Problem for Polynomial Iteration Is PSPACE-complete. 132-143 - Jeremy Sproston:
Probabilistic Timed Automata with Clock-Dependent Probabilities. 144-159 - Antti Valmari:
Stubborn Sets with Frozen Actions. 160-175 - Tomoyuki Yamakami:
Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions - (Preliminary Report). 176-191
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
