42 citations · 127 across the 17 of their papers we have counts for
3 papers · 1 filter
Program Analysis via Multiple Context Free Language Reachability
Giovanna Kobus Conrado, Adam Husted Kjelstrøm, Andreas Pavlogiannis +1
Context-free language (CFL) reachability is a standard approach in static analyses, where the analysis question is phrased as a language reachability problem on a graph wrt a C…
Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
Steffan Christ Sølvsten, Jaco van de Pol
Previous research on the Adiar BDD package has been successful at designing algorithms capable of handling large Binary Decision Diagrams (BDDs) stored in external memory. To do so…
On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
Mikael Bisgaard Dahlsen-Jensen, Baptiste Fievet, Laure Petrucci +1
Parametric Timed Games (PTG) are an extension of the model of Timed Automata. They allow for the verification and synthesis of real-time systems, reactive to their environmeand dep…