A new heuristic for bad cycle detection using BDDs

Formal Methods in System Design

Volumn 18, Issue 2, 2001, Pages 131-140

  Hardin, R H ^a   Kurshan, R P ^a   Shukla, S K ^b   Vardi, M Y ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b State University of New York   (United States)

^c Rice University   (United States)

Author keywords

Cycle detection; Emerson Lei; Model checking

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; GRAPH THEORY; RANDOM PROCESSES; THEOREM PROVING;

CYCLE DETECTION; EMERSON-LEI ALGORITHM; MODEL CHECKING;

FORMAL LOGIC;

EID: 0035279145     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008727508722     Document Type: Article

References (14)

1. 20 states and beyond
2. Automatic verifications of finite-state concurrent systems using temporal logic specifications
3. A linear-time model-checking algorithm for the alternation-free modal μ-calculus
4. Memory efficient algorithms for the verification of temporal properties
5. Efficient model checking in fragments of the propositional modal mu-calculus
6. COSPAN
7. Efficient regression verification
8. Efficient ω-regular language containment
9. Checking that finite state concurrent programs satisfy their linear specifications
10. Testing language containment for omega-automata using BDD'S
11. Testing language containment for ω-automata using BDD's
12. An automata-theoretic approach to automatic program verification