Is there a best symbolic cycle-detection algorithm?

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

Volumn 2031 LNCS, Issue , 2001, Pages 420-434

  Fisler, Kathi ^a,d   Fraer, Ranan ^b   Kamhi, Gila ^b   Vardi, Moshe Y ^a   Yang, Zijiang ^a,c  

^a Rice University   (United States)

^b INTEL CORPORATION   (Israel)

^c NEC LABORATORIES AMERICA   (United States)

^d WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL DETECTION; ALGORITHMS;

CORE PROBLEMS; CYCLE DETECTION; DESIGN MODELING; EXPLICIT STATE; LINEAR TIME; MODEL CHECKER; REAL EXAMPLE; SYMBOLIC MODEL CHECKING;

MODEL CHECKING;

EID: 84903186573     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_29     Document Type: Conference Paper

References (19)

1. Bloem, R., H. N. Gabow and F. Somenzi. An algorithm for strongly connected component analysis in n\ogn symbolic steps. In Intl. Conf. on Formal Methods in Computer-Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, 2000.
2. Bloem, R., K. Ravi and F. Somenzi. Efficient decision procedures for model checking of linear time logic properties. In Intl. Conf. on Computer-Aided Verification, Lecture Notes in Computer Science, pages 222-235. Springer-Verlag, 1999.
3. Clarke, E. M., E. A. Emerson and 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, January 1986.
4. Courcoubetis, C, M. Y. Vardi, P. Wolper and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
5. Emerson, E. A. and C. L. Lei. Efficient model checking in fragments of the propo-sitional model mu-calculus. Proceedings of IICS 1986, pages 267-278, 1986.
6. Fraer, R., G. Kamhi, L. Fix and M. Y. Vardi. Evaluating semi-exhausting verification techniques for bug hunting. In Proceedings of the 1st Intl. Workshop on Symbolic Model Checking. Electronic Notes in Theoretical Computer Science, 1999.
7. Hardin, R. H., Z. Har'El and R. P. Kurshan. COSPAN. In Intl. Conf. on Computer-Aided Verification, number 1102 in Lecture Notes in Computer Science, pages 423-427. Springer-Verlag, 1996.
8. Hardin, R. H., R. P. Kurshan, S. K. Shukla and M. Y. Vardi. A new heuristic for bad cycle detection using BDDs. In Proc. Conf. on Computer-Aided verification (CAV'97), pages 268-278. Springer-Verlag. LNCS 1254, 1997.
9. Henzinger, T., O. Kupferman and S. Qadeer. From prehistoric to postmodern symbolic model checking. In Hu, A. and M. Vardi, editors, Intl. Conf. on Computer-Aided Verification, volume 1427 of lecture Notes in Computer Science, pages 195-206. Springer-Verlag, 1998.
10. Hojati, R., H. Touati, R. Kurshan and R. Brayton. Efficient a;-regular language containment. In Intl. Conf. on Computer-Aided Verification, number 663 in Lecture Notes in Computer Science. Springer-Verlag, 1992.
11. Holzmann, G. and D. Peled. The state of SPIN. In Intl. Conf. on Computer-Aided Verification, number 1102 in Lecture Notes in Computer Science, pages 385-389. Springer-Verlag, 1996.
12. Kamhi, C, L. Fix and Z. Binyamini. Symbolic model checking visualization. In Intl. Conf. on Formal Methods in Computer-Aided Verification, number 1522 in Lecture Notes in Computer Science, pages 290-303. Springer-Verlag, 1998.
13. Karp, R. M. The transitive closure of a random digraph. Random Structures and Algorithms, 1(1), 1990.
14. Kesten, Y., A. Pnueli and L. on Raviv. Algorithmic verification of linear temporal logic specifications. In Intl. Colloquium on Automata, languages, and Programming, number 1443 in Lecture Notes in Computer Science. Springer-Verlag, 1998.
15. Kupferman, O. and M. Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In IEEE Symp on logic in Computer Science, 1998.
16. Ravi, K., R. Bloem and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In Intl. Conf. on Formal Methods in Computer-Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, 2000.
17. The VIS Group. VIS: A system for verification and synthesis. In Alur, R. and T. Henzinger, editors, Intl. Conf. on Computer-Aided Verification, volume 1102 of Lecture Notes in Computer Science. Springer-Verlag, July 1996.
18. Vardi, M. Y. and P. Wolper. An automat a-theoretic approach to automatic program verification. In IEEE Symposium on Logic in Computer Science, 1986.
19. Yang, Z. Performance analysis of symbolic reachability algorithms in model checking. Master's thesis, Rice University, Department of Computer Science, 1999. Available at http://www.cs.rice.edu/CS/Verification/.