85 citations · 354 across the 71 of their papers we have counts for
18 papers · 1 filter
Making Practical: Efficient Interactive Protocols for BDD Algorithms
Eszter Couillard, Philipp Czerner, Javier Esparza +1
We show that interactive protocols between a prover and a verifier, a well-known tool of complexity theory, can be used in practice to certify the correctness of automated reasonin…
From Verification to Causality-based Explications
Christel Baier, Clemens Dubslaff, Florian Funke +4
In view of the growing complexity of modern software architectures, formal models are increasingly used to understand why a system works the way it does, opposed to simply verifyin…
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility
Anthony W. Lin, Rupak Majumdar
Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its so…
Supervisory Controller Synthesis for Non-terminating Processes is an Obliging Game
Rupak Majumdar, Anne-Kathrin Schmuck
We present a new algorithm to solve the supervisory control problem over non-terminating processes modeled as -regular automata. A solution to this problem was obtained by Thist…
Algebraic Invariants for Linear Hybrid Automata
Rupak Majumdar, Joël Ouaknine, Amaury Pouly +1
We exhibit an algorithm to compute the strongest algebraic (or polynomial) invariants that hold at each location of a given unguarded linear hybrid automaton (i.e., a hybrid automa…
Environmentally-friendly GR(1) Synthesis
Rupak Majumdar, Nir Piterman, Anne-Kathrin Schmuck
Many problems in reactive synthesis are stated using two formulas ---an environment assumption and a system guarantee--- and ask for an implementation that satisfies the guarantee…