An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
Abstract elided by the publisher.
Related papers
- Software model checking using languages of nested trees TOPLAS 2011
- An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) SAS 1995
- Model Checking Algorithms for Hyperproperties (Invited Paper) VMCAI 2021
- ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States TOPLAS 2019
- Automata-Theoretic Model Checking Revisited VMCAI 2007
- Modalities for Model Checking: Branching Time Strikes Back POPL 1985
- An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking VMCAI 2009
- Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach CAV 1995