A new heuristic for bad cycle detection using BDDs

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

Volumn 1254, Issue , 1997, Pages 268-278

  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

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; MODEL CHECKING;

CYCLE DETECTION; EMERSON; FUNDAMENTAL OPERATIONS; MODEL CHECKING ALGORITHM; MODEL STATE; SPEED UP;

HEURISTIC ALGORITHMS;

EID: 84947435279     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63166-6_27     Document Type: Conference Paper

References (14)

1. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142-170, June 1992.
2. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verifications of finite-state concurrent systems using temporal logic specifications. A CM Transactions on Programming Languages and Systems, 8(2):244-263, April 1986.
3. R. Cleaveland. A linear-time model-checking algorithm for the alternationfree modal #-calculus. Formal Methods in System Design, 2:121-147, 1993.
4. C. Courcoubetis, M. Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Lecture Notes in Computer Science, 531:233-245, 1991.
5. E. A. Emerson and C. L. Lei. Efficient model checking in fragments of the propositional modal mu-calculus. In Proceedings of LICS 1986, pages 267-278, 1986.
6. R. H. Hardin, Z. Har'E1, and R. P. Kurshan. COSPAN. Lecture Notes in Computer Science, 1102:423-427, 1996.
7. R. H. Hardin, R. P. Kurshan, K. L. McMillan, J. A. Reeds, and N. J. A. Sloane. Efficient regression verification. IEE Proc. WODES'96, pages 147-150, 1996.
8. R. Hojati, H. J. Touati, R. K. Brayton, and R. P. Kurshan. Efficient wregular language containment. In Proceedings of CA V 93, LNCS 663, pages 396-409, 1993.
9. R. P. Kurshan. Computer Aided Verification of Coordinating processes: An Automata Theoretic Approach. Princeton University Press, 1994.
10. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specifications. In Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 97-107. ACM, ACM, January 1985.
11. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
12. H. J. Touati, R. K. Brayton, and R. P. Kurshan. Testing language containment for omega-automata using BDD'S. In Proceedings of The 1991 International Workshop on Formal Methods in VLSI Design, January 1991.
13. H. J. Touati, R. K. Brayton, and R. P. Kurshan. Testing language containment for w-automata using BDD's. Information and Computation, 118(1):101-109, April 1995.
14. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.