An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
Abstract elided by the publisher.
Related papers
- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis CAV 2013
- Automata-Theoretic Model Checking Revisited VMCAI 2007
- An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) CAV 1994
- Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach CAV 1995
- Model Checking via Reachability Testing for Timed Automata TACAS 1998
- An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols ESOP 2025
- Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking TACAS 2019
- Clock Bound Repair for Timed Systems CAV 2019