A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
Automata Tutor v3
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
Framework using abstract grammar transformations, theory-based algorithms, and graph-inspired canonization to detect and explain (in-)equivalence of context-free grammars, evaluated on educational datasets.
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
citing papers explorer
-
Infinite State Model Checking by Learning Transitive Relations
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
-
Detecting and Explaining (In-)equivalence of Context-Free Grammars
Framework using abstract grammar transformations, theory-based algorithms, and graph-inspired canonization to detect and explain (in-)equivalence of context-free grammars, evaluated on educational datasets.
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
- Verification of Configurable SRA Systems