Liveness checking as safety checking for infinite state spaces

Electronic Notes in Theoretical Computer Science

Volumn 149, Issue 1, 2006, Pages 79-96

  Schuppan, Viktor ^a   Biere, Armin ^b  

^a ETH ZURICH   (Switzerland)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Infinite state space; Linear temporal logic; Liveness; Model checking; Safety

Indexed keywords

ACCIDENT PREVENTION; AUTOMATA THEORY; MATHEMATICAL MODELS;

INFINITE STATE SPACE; LINEAR TEMPORAL LOGIC; LIVENESS; MODEL CHECKING;

COMPUTER SCIENCE;

EID: 31144474315     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.11.018     Document Type: Conference Paper

References (34)

1. P. Abdulla, B. Jonsson, M. Nilsson, and J. d'Orso Algorithmic improvements in regular model checking W. Hunt F. Somenzi CAV'03 LNCS 2725 2003 236 248
2. Abdulla, P., B. Jonsson, M. Nilsson, J. d'Orso and M. Saksena, Regular model checking for LTL (MSO), in: Alur and Peled [5], pp. 348-360
3. L. Aceto, P. Bouyer, A. Burgueño, and K. Larsen The power of reachability testing for timed automata Theor. Comput. Sci. 300 2003 411 475
4. R. Alur, and D. Dill A theory of timed automata Theor. Comput. Sci. 126 1994 183 235
5. R. Alur D. Peled Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings LNCS 3114 2004 Springer
6. G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson, and J. Romijn Efficient guiding towards cost-optimality in UPPAAL T. Margaria W. Yi TACAS'01 LNCS 2031 2001 174 188
7. A. Biere, C. Artho, and V. Schuppan Liveness checking as safety checking R. Cleaveland H. Garavel Formal Methods for Industrial Critical Systems, Proceedings of the 7th International ERCIM Workshop, FMICS'02, Málaga, Spain, July 12-13, 2002 Electronic Notes in Theoretical Computer Science 66 2 2002
8. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu Symbolic model checking without BDDs R. Cleaveland TACAS'99 LNCS 1579 1999 193 207
9. B. Boigelot, A. Legay, and P. Wolper Omega-regular model checking K. Jensen A. Podelski TACAS'04 LNCS 2988 2004 561 575
10. A. Bouajjani, J. Esparza, and O. Maler Reachability analysis of pushdown automata: Application to model-checking A.W. Mazurkiewicz J. Winkowski CONCUR'97 LNCS 1243 1997 135 150
11. Bouajjani, A., P. Habermehl and T. Vojnar, Abstract regular model checking, in: Alur and Peled [5], pp. 372-386
12. Bouajjani, A., B. Jonsson, M. Nilsson and T. Touili, Regular model checking, in: Emerson and Sistla [15], pp. 403-418
13. Bouajjani, A., A. Legay and P. Wolper, Handling liveness properties in (ω-)regular model checking, in: INFINITY'04, 2004
14. E. Clarke, O. Grumberg, and D. Peled Model Checking 1999 MIT Press
15. E. Emerson A. Sistla Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings LNCS 1855 2000 Springer
16. Esparza, J., D. Hansel, P. Rossmanith and S. Schwoon, Efficient algorithms for model checking pushdown systems, in: Emerson and Sistla [15], pp. 232-247
17. J. Esparza, and S. Schwoon A BDD-based model checker for recursive programs G. Berry H. Comon A. Finkel CAV'01 LNCS 2102 2001 324 336
18. A. Finkel, B. Willems, and P. Wolper A direct symbolic approach to model checking pushdown systems (extended abstract) F. Moller INFINITY'97 ENTCS 9 1997
19. B. Jonsson, and M. Nilsson Transitive closures of regular relations for verifying infinite-state systems S. Graf M. Schwartzbach TACAS'00 LNCS 1785 2000 220 234
20. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar Symbolic model checking with rich assertional languages Theor. Comput. Sci. 256 2001 93 112
21. D. Kozen Results on the propositional μ-calculus Theor. Comput. Sci. 27 1983 333 354
22. O. Kupferman, and M. Vardi Model checking of safety properties Formal Methods in System Design 19 2001 291 314
23. K. Larsen, P. Pettersson, and W. Yi Uppaal in a Nutshell International Journal on Software Tools for Technology Transfer (STTT) 1 1997 134 152
24. Pnueli, A. and E. Shahar, Liveness and acceleration in parameterized verification, in: Emerson and Sistla [15], pp. 328-343
25. Schuppan, V., "Liveness Checking as Safety Checking to Find Shortest Counterexamples to Linear Time Properties," Ph.D. thesis, ETH Zürich (2005)
26. 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 2004 185 204
27. V. Schuppan, and A. Biere Shortest counterexamples for symbolic model checking of LTL with past N. Halbwachs L. Zuck TACAS'05 LNCS 3440 2005 493 509
28. Schwoon, S., "Model-Checking Pushdown Systems," Ph.D. thesis, Technische Universität München (2002)
29. R. Sebastiani, S. Tonetta, and M. Vardi Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking K. Etessami S. Rajamani CAV'05 LNCS 3576 2005 350 363
30. N. Shilov, and K. Yi On expressive and model checking power of propositional program logics D. Bjørner M. Broy A. Zamulin PSI'01 LNCS 2244 2001 39 46
31. Shilov, N., K. Yi, H. Eo, S. O and K.-M. Choe, Proofs about folklore: why model checking = reachability? (2005), submitted
32. C. Stirling Games and modal mu-calculus T. Margaria B. Steffen TACAS'96 LNCS 1055 1996 298 312
33. Vardi, M. and P. Wolper, An automata-theoretic approach to automatic program verification, in: LICS'86 (1986), pp. 332-344
34. P. Wolper, and B. Boigelot Verifying systems with infinite but regular state spaces A. Hu M. Vardi CAV'98 LNCS 1427 1998 88 97