7 citations · 7 across the 4 of their papers we have counts for
4 papers
A Uniform Framework for Language Inclusion Problems
Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy
We present a uniform approach for solving language inclusion problems. Our approach relies on a least fixpoint characterization and a quasiorder to compare words of the "smaller" l…
FORQ-based Language Inclusion Formal Testing
Kyveli Doveri, Pierre Ganty, Nicolas Mazzocchi
We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSPACE-complete problem. Our approach, like others before, leverage a not…
Bounded-oscillation Pushdown Automata
Pierre Ganty, Damir Valput
We present an underapproximation for context-free languages by filtering out runs of the underlying pushdown automaton depending on how the stack height evolves over time. In parti…
Interprocedural Reachability for Flat Integer Programs
Pierre Ganty, Radu Iosif
We study programs with integer data, procedure calls and arbitrary call graphs. We show that, whenever the guards and updates are given by octagonal relations, the reachability pro…