default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th RP 2025, Madrid, Spain
- Pierre Ganty
, Alessio Mansutti:
Reachability Problems - 19th International Conference, RP 2025, Madrid, Spain, October 1-3, 2025, Proceedings. Lecture Notes in Computer Science 16230, Springer 2026, ISBN 978-3-032-09523-7
Invited Papers
- Alastair F. Donaldson, Cristian Cadar, Manuel Carrasco, Dan Iorga, Daniel Liew, John Wickerson:
When You Have a Fuzzer, Everything Looks Like a Reachability Problem. 3-16 - Anthony W. Lin, Pablo Barceló:
The Role of Logic and Automata in Understanding Transformers. 17-30 - Mickael Randour:
Simplicity Lies in the Eye of the Beholder: A Strategic Perspective on Controllers in Reactive Synthesis. 31-48
Regular Papers
- Joel D. Day, Matthew Konefal:
Word Equations with Length Constraints via Weak Arithmetics and Matrix Reachability Problems. 51-67 - Duncan Adamson, Moritz Dudey, Pamela Fleischmann, Annika Huch:
Word Chain Generators for Prefix Normal Words. 68-82 - Olga Tveretina:
Reachability and Mortality for Two-Dimensional RHPCD Systems Are co-NP-hard. 83-96 - Asger Horn Brorholt, Andreas Holck Høeg-Petersen, Peter Gjøl Jensen, Kim Guldstrand Larsen, Marius Mikucionis, Christian Schilling, Andrzej Wasowski:
Uppaal Coshy: Automatic Synthesis of Compact Shields for Hybrid Systems. 97-111 - Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán:
Weighing Obese Timed Languages. 112-125 - Shaull Almagor, Itay Hasson, Michal Pilipczuk, Michael Zaslavski:
Box-Reachability in Vector Addition Systems. 126-139 - Stéphane Demri, Laurent Doyen, Raul Fervari:
Knowing-How Reasoning with Budgets Recasted: Universal Reachability Problem on VASS. 140-155 - Francesco Di Cosmo, Soumodev Mal, Tephilla Prince:
Nets-Within-Nets Through the Lens of Data Nets. 156-170 - Marck van der Vegt, Kazuki Watanabe, Ichiro Hasuo, Sebastian Junges:
Compositional Verification of Almost-Sure Büchi Objectives in MDPs. 171-185 - Arnd Hartmanns, Robert Modderman:
DTMC Model Checking by Path Abstraction Revisited. 186-201 - László Antal, Franz Link, Erika Ábrahám:
Counterexample-Guided Abstraction Refinement for Star-Based Neural Network Verification. 202-216 - A. Subramani, K. Subramani, Jacob Restanio:
Maximum Path Sets in Trees. 217-230
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 2026-08-07 21:49 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
