Shortest counterexamples for symbolic model checking of LTL with past

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 493-509

  Schuppan, Viktor ^a   Biere, Armin ^b  

^a ETH ZURICH   (Switzerland)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; ENCODING (SYMBOLS); MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION;

COUNTEREXAMPLES; LTL FORMULAE; MODEL CHECKERS; STATE SPACE;

COMPUTATION THEORY;

EID: 24644433987     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_32     Document Type: Conference Paper

References (27)

1. M. Awedh and F. Somenzi. Proving more properties with bounded model checking. In CAV'04, volume 3114 of LNCS, pages 96-108. Springer, 2004.
2. M. Benedetti and A. Cimatti. Bounded model checking for past LTL. In TACAS'03, volume 2619 of LNCS, pages 18-33. Springer, 2003.
3. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS'99, volume 1579 of LNCS, pages 193-207. Springer, 1999.
4. A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. NuSMV 2: An opensource tool for symbolic model checking. In CAV'02, volume 2404 of LNCS, pages 359-364. Springer, 2002.
5. A. Cimatti, M. Roveri, and D. Sheridan. Bounded verification of past LTL. In FMCAD'04, volume 3312 of LNCS. Springer, 2004.
6. E. Clarke, O. Grumberg, and K. Hamaguchi. Another look at LTL model checking. FMSD, 10(1):47-71, 1997.
7. E. Clarke, O. Grumberg, K. McMillan, and X. Zhao. Efficient generation of counterexamples and witnesses in symbolic model checking. In DAC'95, pages 427-432. ACM, 1995.
8. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory-efficient algorithms for the verification of temporal properties. FMSD, 1(2/3):275-288, 1992.
9. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Volume B, Formal Methods and Semantics, pages 995-1072. North-Holland Pub. Co., 1990.
10. D. Gabbay. The declarative past and imperative future. In Temporal Logic in Specification, volume 398 of LNCS, pages 409-448. Springer, 1989.
11. P. Gastin, P. Moro, and M. Zeitoun. Minimization of counterexamples in SPIN. In SPIN'04, volume 2989 of LNCS, pages 92-108. Springer, 2004.
12. R. Gerth, D. Peled, M. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In PSTV'95, volume 38 of IFIP Conference Proceedings, pages 3-18. Chapman & Hall, 1996.
13. A. Groce and D. Kröning. Making the most of BMC counterexamples. In A. Biere and O. Strichman, editors, BMC'04, pages 71-84, 2004.
14. The VIS Group. VIS: A system for verification and synthesis. In CAV'96, volume-1102 of LNCS, pages 428-432. Springer, 1996.
15. J. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California at Los Angeles, 1968.
16. Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. In ICALP'98, volume 1443 of LNCS, pages 1-16. Springer, 1998.
17. O. Kupferman and M. Vardi. Model checking of safety properties. In CAV'99, volume 1633 of LNCS, pages 172-183. Springer, 1999.
18. F. Laroussinie, N. Markey, and P. Schnoebelen. Temporal logic with forgettable past. In LICS'02, pages 383-392. IEEE Computer Society, 2002.
19. T. Latvala, A. Biere, K. Heljanko, and T. Junttila. Simple is better: Efficient bounded model checking for past LTL. In VMCAI'05, volume 3385 of LNCS. Springer, 2005.
20. K. Ravi, R. Bloem, and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In FMCAD'00, volume 1954 of LNCS, pages 143-160. Springer, 2000.
21. K. Schneider. Improving automata generation for linear temporal logic by considering the automaton hierarchy. In LPAR'01, volume 2250 of LNCS, pages 39-54. Springer, 2001.
22. V. Schuppan and A. Biere. Efficient reduction of finite state model checking to reachability analysis. International Journal on Software Tools for Technology Transfer (STTT), 5(2-3): 185-204, 2004.
23. V. Schuppan and A. Biere. Shortest counterexamples for symbolic model checking of LTL with past. Technical Reports 470, ETH Zürich, Computer Systems Institute, 01 2005.
24. R. Sebastiani and S. Tonetta. "More deterministic" vs. "smaller" Büchi automata for efficient LTL model checking. In CHARME'03, volume 2860 of LNCS, pages 126-140. Springer, 2003.
25. O. Shtrichman. Pruning techniques for the SAT-based bounded model checking problem. In CHARME'01, volume 2144 of LNCS, pages 58-70. Springer, 2001.
26. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In CAV'00, volume 1855 of LNCS, pages 248-263. Springer, 2000.
27. M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS'86, pages 332-344. IEEE Computer Society, 1986.