BDD-based debugging of designs using language containment and fair CTL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 697 LNCS, Issue , 1993, Pages 41-58

  Hojati, Ramin ^a   Brayton, Robert K ^a   Kurshan, Robert P ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b AT T   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTER AIDED ANALYSIS; MODEL CHECKING;

COMPUTATION TREE LOGIC; COUNTER EXAMPLES; DEBUGGERS; DESIGN CYCLE; EARLY FAILURE DETECTION; FORMAL DESIGN; MINIMALITY CRITERIA; NORMAL FORM;

PROGRAM DEBUGGING;

EID: 85029447723     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56922-7_5     Document Type: Conference Paper

References (13)

1. S. Aggarwal, R. P. Kurshan, K. Sabnani, “A Calculus for Protocol Specification and Validation”, in Protocol Specification, Testing and Verification III (193) North-Holland, pp. 19-34.
2. R. Alur, A. Itai, R. P. Kurshan, “Timing Verification by Successive Approximation”, Computer-Aided Verification, 1992.
3. Felice Balarin, A. S. Vincentelli, “A Verification Strategy for Timing-Constrained Systems”, Fourth Workshop On Computer-Aided Verification, 1992.
4. E. M. Clarke, E. A. Emerson, A. P. Sistla. “Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications”, ACM Transactions on Programming Languages and Systems. 8(2):244-263, 1986.
5. E. A. Emerson, C. L. Lei, “Modalities for Model Checking: Branching Time Logic Strikes Back”, Science of Computer Programming 8, 275-306, Elsevier Science Publishers, 1987.
6. Ramin Hojati, Herve Touati, Robert P. Kurshan, Robert K. Brayton, “Efficient ω-Regular Language Containment”, Computer-Aided Verification, 1992.
7. Ramin Hojati, Thomas Shiple, Robert Brayton, Robert Kurshan, “A Unified Environment for Language Containment and Fair CTL Model Checking”, submitted to Design Automation Conference, 1993.
8. R. Garey, D. S. Johnson, “Computers and Intractability, A Guide to the Theory of NP-Completeness”, W. H. Freeman and Company, 1979.
9. R. Kurshan. “Analysis of Discrete Event Coordination”, Lecture Notes in Computer Science, 1990.
10. D. Long, private communication.
11. Paul Stephan, Huey Wang, private communication.
12. H. Touati, H. Savoj, B. Lin, R. K. Brayton, A. S. Vincentelli, “Implicit State Enumeration of Finite State Machines Using BDD’s”, International Conference on Computer-Aided Design, 1990.
13. H. Touati, R. Kurshan, R. Brayton. “Testing Language Containment of ω-Automata Using BDDs”, International Workshop on Formal Methods in VLSI Design, 1991.