From October 1 to 3, the IMDEA Software Institute was the venue chosen this year to host the 19th International Conference on Reachability Problems (RP’25). The conference brought together researchers and international experts to discuss the latest advances and open challenges in the study of reachability problems across different computational models and systems.
Throughout the three-day event, participants presented ideas on topics such as automata theory, system verification, logic and model checking, algebraic structures, computational game theory, and hybrid systems.
The conference also featured a series of invited talks offering diverse perspectives on emerging trends and new frontiers in the field. Among the invited speakers were:
• Albert Atserias (Universitat Politècnica de Catalunya, España): Local-vs-Global Consistency of Annotated Relations
• Alastair F. Donaldson (Imperial College London, Reino Unido): When You Have a Fuzzer, Everything Looks Like a Reachability Problem
• Zak Kincaid (Princeton University, EE. UU.): Reachability Problems and Program Analysis
• Anthony W. Lin (University of Kaiserslautern, Alemania): The Role of Logic and Automata in Understanding Transformers
• Mickael Randour (Université de Mons, Bélgica): Simplicity Lies in the Eye of the Beholder: A Strategic Perspective on Controllers in Reactive Synthesis
To conclude the final day, IMDEA Software researcher Niki Vazou delivered a hands-on tutorial on Liquid Haskell and the use of refinement types for program verification.
During the closing dinner, the Best Paper Award was presented to *Joel D. Day and Matthew Konefal for their work “World Equations with Length Constraints via Weak Arithmetics and Matrix Reachability Problems”.
IMDEA Software would like to thank all participants and organizers who contributed to making this event a success. We look forward to seeing you again at the next edition.
