LTL satisfiability checking

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

Volumn 4595 LNCS, Issue , 2007, Pages 149-167

  Rozier, Kristin Y ^a   Vardi, Moshe Y ^b  

^a NASA LANGLEY RESEARCH CENTER   (United States)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS);

LTL TRANSLATION; SATISFIABILITY CHECKING;

MODEL CHECKING;

EID: 38149015332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73370-6_11     Document Type: Conference Paper

References (46)

1. Ammons, G., Mandelin, D., Bodik, R., Laras, J.R.: Debugging temporal specifications with concept analysis. In: PLDI, Proc. ACM Conf., pp. 182-195 (2003)
2. Armoni, R., Fix, L., Flaisher, A., Grumberg, O., Piterman, N., Tiemeyer, A., Vardi, M.Y.: Enhanced vacuity detection for linear temporal logic. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, Springer, Heidelberg (2003)
3. Beer, I., Ben-David, S., Eisner, C., Rodeh, Y.: Efficient detection of vacuity in ACTL formulas. Formal Methods in System Design 18(2), 141-162 (2001)
4. Bloem, R., Ravi, K., Somenzi, F.: Efficient decision procedures for model checking of linear time logic properties. In: Halbwachs, N., Peled, D.A. (eds.) Computer Aided Verification. LNCS, vol. 1633, pp. 222-235. Springer, Heidelberg (1999)
5. Brayton, R.K., Hachtel, G.D., Sangiovanni-Vincentelli, A., Somenzi, F., Aziz, A., Cheng, S.-T., Edwards, S., Khatri, S., Kukimoto, T., Pardo, A., Qadeer, S., Ranjan, R.K., Sarwary, S., Shiple, T.R., Swamy, G., Villa, T.: VIS: a system for verification and synthesis. In: Alur, R., Henzinger, T.A. (eds.) Computer Aided Verification. LNCS, vol. 1102, pp. 428-432. Springer, Heidelberg (1996)
6. Bryant, R.E.: Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, vol. C-35(8) (1986)
7. 20 states and beyond. Information and Computation 98(2), 142-170 (1992)
8. Bustan, D., Flaisher, A., Grumberg, O., Kupferman, O., Vardi, M.Y: Regular vacuity. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 191-206. Springer, Heidelberg (2005)
9. Cimatti, A., Clarke, E.M., Giunchiglia, F., Roveri, M.: NuSMV: a new symbolic model checker. It'l J. on Software Tools for Tech. Transfer 2(4), 410-425 (2000)
10. Clarke, E.M., Grumberg, O., Hamaguchi, K.: Another look at LTL model checking. Formal Methods in System Design 10(1), 47-71 (1997)
11. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
12. Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design 1, 275-288 (1992)
13. Couvreur, J-M.: On-the-fly verification of linear temporal logic. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM'99 - Formal Methods. LNCS, vol. 1708, pp. 253-271. Springer, Heidelberg (1999)
14. Daniele, N., Guinchiglia, F., Vardi, M.Y.: Improved automata generation for linear temporal logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV'99. LNCS, vol. 1633, pp. 249-260. Springer, Heidelberg (1999)
15. Duret-Lutz, A., Poitrenaud, D.: SPOT: An extensible model checking library using transition-based generalized büchi automata. In: MASCOTS, Proc. 12th Int'l Workshop, pp. 76-83. IEEE Computer Society, Los Alamitos (2004)
16. Emerson, E.A.: Temporal and modal logic (chapter 16). In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 997-1072. Elsevier, MIT Press, Cambridge (1990)
17. Emerson, E.A., Lei, C.L.: Efficient model checking in fragments of the propositional ̈-calculus. In: LICS, 1st Symp., Cambridge, pp. 267-278 (1986)
18. Etessami, K., Holzmann, G.J.: Optimizing Büchi automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 153-167. Springer, Heidelberg (2000)
19. Fritz, C.: Constructing Büchi automata from linear temporal logic using simulation relations for alternating büchi automata. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 35-48. Springer, Heidelberg (2003)
20. Fritz, C.: Concepts of automata construction from LTL. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 728-742. Springer, Heidelberg (2005)
21. Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53-65. Springer, Heidelberg (2001)
22. Geldenhuys, J., Hansen, H.: Larger automata and less work for LTL model checking. In: Valmari, A. (ed.) Model Checking Software. LNCS, vol. 3925, pp. 53-70. Springer, Heidelberg (2006)
23. Geldenhuys, J., Valmari, A.: Tarjan's algorithm makes on-the-fly LTL verification more efficient. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 205-219. Springer, Heidelberg (2004)
24. Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Dembiski, P., Sredniawa, M. (eds.) Protocol Specification, Testing, and Verification, August 1995, pp. 3-18. Chapman & Hall, Sydney, Australia (1995)
25. Giannakopoulou, D., Lerda, F.: From states to transitions: Improving translation of LTL formulae to Büchi automata. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, Springer, Heidelberg (2002)
26. Gurfinkel, A., Chechik, M.: Extending extended vacuity. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 306-321. Springer, Heidelberg (2004)
27. Gurfinkel, A., Chechik, M.: How vacuous is vacuous. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 451-466. Springer, Heidelberg (2004)
28. Holzmann, G.J.: The model checker SPIN (Special issue on Formal Methods in Software Practice). IEEE Trans. on Software Engineering 23(5), 279-295 (1997)
29. Kupferman, O.: Sanity checks in formal verification. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 37-51. Springer, Heidelberg (2006)
30. Kupferman, O., Vardi, M.Y.: Vacuity detection in temporal model checking. J. on Software Tools For Technology Transfer 4(2), 224-233 (2003)
31. Kurshan, R.P.: FormalCheck User's Manual. Cadence Design, Inc. (1998)
32. McMillan, K.: The SMV language. Technical report, Cadence Berkeley Lab (1999)
33. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Boston (1993)
34. Namjoshi, K.S.: An efficiently checkable, proof-based formulation of vacuity in model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 57-69. Springer, Heidelberg (2004)
35. Pan, G., Sattler, U., Vardi, M.Y.: BDD-based decision procedures for K. In: Voronkov, A. (ed.) Automated Deduction - CADE-18. LNCS (LNAI), vol. 2392, pp. 16-30. Springer, Heidelberg (2002)
36. Piterman, N., Vardi, M.Y.: From bidirectionality to alternation. Theoretical Computer Science 295(1-3), 295-321 (2003)
37. Purandare, M., Somenzi, F.: Vacuum cleaning CTL formulae. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 485-499. Springer, Heidelberg (2002)
38. Sebastiani, R., Tonetta, S.: more deterministic vs. smaller büchi automata for efficient LTL model checking. In: Geist, D., Tronei, E. (eds.) CHARME 2003. LNCS, vol. 2860, pp. 126-140. Springer, Heidelberg (2003)
39. Sebastiani, R., Tonetta, S., Vardi, M.Y.: Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 350-373. Springer, Heidelberg (2005)
40. Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 248-263. Springer, Heidelberg (2000)
41. Tauriainen, H., Heljanko, K.: Testing LTL formula translation into Büchi automata. STTT - Int'l J. on Software Tools for Tech. Transfer 4(1), 57-70 (2002)
42. Thirioux, X.: Simple and efficient translation from LTL formulas to Büchi automata. Electr. Notes Theor. Comput. Sci, vol. 66(2) (2002)
43. Vardi, M.Y.: Nontraditional applications of automata theory. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 575-597. Springer, Heidelberg (1994)
44. Vardi, M.Y.: Automata-theoretic model checking revisited. In: Cook, B., Podelski, A. (eds.) VMCAI2007. LNCS, vol. 4349, pp. 137-150. Springer, Heidelberg (2007)
45. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. 1st LICS, pp. 332-344 (1986)
46. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation 115(1), 1-37 (1994)