LTL satisfiability checking

International Journal on Software Tools for Technology Transfer

Volumn 12, Issue 2, 2010, Pages 123-137

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

^a NASA AMES RESEARCH CENTER   (United States)

^b RICE UNIVERSITY   (United States)

Author keywords

Benchmark; Linear temporal logic; LTL satisfiability; LTL translation; LTL to automata; Model checking; Sanity check

Indexed keywords

AUTOMATA MODELS; EXPERIMENTAL INVESTIGATIONS; EXPLICIT MODEL CHECKING; INDUSTRIAL QUALITY; LINEAR TEMPORAL LOGIC; RESEARCH PROTOTYPE; SANITY CHECK; SATISFIABILITY; SATISFIABILITY CHECKING; SYMBOLIC MODEL CHECKERS; SYMBOLIC MODEL CHECKING; TRANSLATION TOOLS;

SEARCH ENGINES; TEMPORAL LOGIC; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 77952320774     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s10009-010-0140-3     Document Type: Article

References (48)

1. Ammons, G., Mandelin, D., Bodik, R., Larus, J. R.: Debugging temporal specifications with concept analysis. In: Proceedings of the ACM Conference on PLDI, 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: Proceedings of the 15th International Conference on CAV. Springer, Berlin (2003).
3. Beer I., Ben-David S., Eisner C., Rodeh Y.: Efficient detection of vacuity in ACTL formulas. Formal Methods Syst. Des. 18(2), 141-162 (2001).
4. Bensalem S., Ganesh V., Lakhnech Y., Muñoz C., Owre S., Rueß H., Rushby J., Rusu V., Saïdi H., Shankar N., Singerman E., Tiwari A.: An overview of SAL. In: Michael Holloway, C. (eds) LFM 2000: Fifth NASA Langley Formal Methods Workshop, pp. 187-196. NASA Langley Research Center, Hampton, VA (2000).
5. Bloem, R., Ravi, K., Somenzi, F. (1999) Efficient decision procedures for model checking of linear time logic properties. In: Proceedings of the 11th International Conference on CAV. Lecture Notes in Computer Science, vol. 1633, pp. 222-235. Springer, Berlin (1999).
6. 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: Proceedings of the 8th International Conference on CAV. Lecture Notes in Computer Science, vol. 1102, pp. 428-432. Springer, Berlin (1996).
7. Bryant R. E.: Graph-based algorithms for boolean-function manipulation. IEEE Trans. Comput. C-35(8), 677-691 (1986).
8. 20 states and beyond. Inf. Comput. 98(2), 142-170 (1992).
9. Bustan, D., Flaisher, A., Grumberg, O., Kupferman, O., Vardi, M. Y.: Regular vacuity. In: CHARME. LNCS, vol. 3725, pp. 191-206. Springer, Berlin (2005).
10. Cimatti A., Clarke E. M., Giunchiglia F., Roveri M.: NuSMV: a new symbolic model checker. Int. J. Softw. Tools Technol. Transf. 2(4), 410-425 (2000).
11. Clarke E. M., Grumberg O., Hamaguchi K.: Another look at LTL model checking. Formal Methods Syst. Des. 10(1), 47-71 (1997).
12. Clarke E. M, Grumberg O., Peled D.: Model Checking. MIT Press, Cambridge (1999).
13. Courcoubetis C., Vardi M. Y., Wolper P., Yannakakis M.: Memory efficient algorithms for the verification of temporal properties. Formal Methods Syst. Des. 1, 275-288 (1992).
14. Couvreur, J.-M.: On-the-fly verification of linear temporal logic. In: Proceedings of FM, pp. 253-271 (1999).
15. Daniele, N., Guinchiglia, F., Vardi, M. Y.: Improved automata generation for linear temporal logic. In: Proceedigs of the 11th International Conference on CAV. LNCS, vol. 1633, pp. 249-260. Springer, Berlin (1999).
16. de Moura, L., Owre, S., Rueß, H., Rushby, J., Shankar, N., Sorea, M., Tiwari, A.: SAL 2. In: Alur, R., Peled, D. (eds.) Computer-Aided Verification, CAV 2004. Lecture Notes in Computer Science, vol. 3114, pp. 496-500. Springer, Boston (2004).
17. Duret-Lutz, A., Poitrenaud, D.: SPOT: An extensible model checking library using transition-based generalized büchi automata. In: Proceedings of the 12th International Workshop on MASCOTS, pp. 76-83. IEEE Computer Society, USA (2004).
18. Emerson E. A.: Temporal and modal logic. In: van Leeuwen, J. (eds) Handbook of Theoretical Computer Science, vol. B, ch. 16, pp. 997-1072. Elsevier MIT Press, Amsterdam (1990).
19. Emerson, E. A., Lei, C. L.: Efficient model checking in fragments of the propositional μ-calculus. In: LICS, 1st Symp. pp. 267-278, Cambridge (1986).
20. Etessami, K., Holzmann, G. J.: Optimizing Büchi automata. In: Proceedings of the 11th International Conference on CONCUR. Lecture Notes in CS 1877, pp. 153-167. Springer, Berlin (2000).
21. Fritz, C.: Constructing Büchi automata from linear temporal logic using simulation relations for alternating büchi automata. In: Proceedings of the 8th International conference on CIAA. Lecture Notes in Computer Science, vol. 2759, pp. 35-48. Springer, Berlin (2003).
22. Fritz, C.: Concepts of automata construction from LTL. In: Proceedings of the 12th International Conference on LPAR. Lecture Notes in Computer Science, vol. 3835, pp. 728-742. Springer, Berlin (2005).
23. Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Proceedings of the 13th International Conference on CAV. LNCS, vol. 2102, pp. 53-65. Springer, Berlin (2001).
24. Geldenhuys, J., Hansen, H.: Larger automata and less work for LTL model checking. In: Model Checking Software, 13th Int'l SPIN Workshop. LNCS, vol. 3925, pp. 53-70. Springer, Berlin (2006).
25. Geldenhuys, J., Valmari, A.: Tarjan's algorithm makes on-the-fly LTL verification more efficient. In: Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 2988, pp. 205-219. Springer, Berlin (2004).
26. 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, pp. 3-18. Chapman & Hall, London (1995).
27. Giannakopoulou, D., Lerda, F.: From states to transitions: Improving translation of LTL formulae to Büchi automata. In: Proceedings of 22 IFIP International Conference on FORTE (2002).
28. Gurfinkel, A., Chechik, M.: Extending extended vacuity. In: 5th International Conferene on FMCAD. Lecture Notes in Computer Science, vol. 3312, pp 306-321. Springer, Berlin (2004).
29. Gurfinkel, A., Chechik, M.: How vacuous is vacuous. In: 10th International Conference on TACAS. Lecture Notes in Computer Science, vol. 2988, pp. 451-466. Springer, Berlin (2004).
30. Holzmann G. J.: The model checker SPIN. IEEE Trans. Softw. Eng. 23(5), 279-295 (1997) Special issue on Formal Methods in Software Practice.
31. Kupferman, O.: Sanity checks in formal verification. In: Proceedings of the 17th International Conference on CONCUR. Lecture Notes in Computer Science, vol. 4137, pp. 37-51. Springer, Berlin (2006).
32. Kupferman O., Vardi M. Y.: Vacuity detection in temporal model checking. J. Softw. Tools Technol. Transf. 4(2), 224-233 (2003).
33. Kurshan R. P.: FormalCheck User's Manual. Cadence Design, Inc., San Jose (1998).
34. McMillan, K.: The SMV language. Technical report, Cadence Berkeley Lab (1999).
35. McMillan K. L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993).
36. Namjoshi, K. S.: An efficiently checkable, proof-based formulation of vacuity in model checking. In: 16th CAV. LNCS, vol. 3114, pp. 57-69. Springer, Berlin (2004).
37. Pan, G., Sattler, U., Vardi, M. Y.: BDD-based decision procedures for K. In: Proceedings of the 18th International conference on CADE. LNCS, vol. 2392, pp. 16-30. Springer, Berlin (2002).
38. Piterman N., Vardi M. Y.: From bidirectionality to alternation. Theor. Comput. Sci. 295(1-3), 295-321 (2003).
39. Purandare, M., Somenzi, F.: Vacuum cleaning CTL formulae. In: Proceeding of the 14th Conference on CAV. Lecture Notes in Computer Science, pp. 485-499. Springer, Berlin (2002).
40. Sebastiani, R., Tonetta, S.: "more deterministic" vs. "smaller" büchi automata for efficient LTL model checking. In: CHARME, pp. 126-140. Springer, Berlin (2003).
41. Sebastiani, R., Tonetta, S., Vardi, M. Y.: Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking. In: Proceedings of the 17th International Conference on CAV. Lecture Notes in Computer Science, vol. 3576, pp. 350-373. Springer, Berlin (2005).
42. Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Proceedings of the 12th International Conference on CAV. LNCS, vol. 1855, pp. 248-263. Springer, Berlin (2000).
43. Tauriainen H., Heljanko K.: Testing LTL formula translation into Büchi automata. STTT Int. J. Softw. Tools Technol. Transf. 4(1), 57-70 (2002).
44. Thirioux X.: Simple and efficient translation from LTL formulas to Büchi automata. Electr. Notes Theor. Comput. Sci. 66(2), 145-159 (2002).
45. Vardi M. Y.: Nontraditional applications of automata theory. In: Proceedings of the International conference on STACS. LNCS, vol. 789, pp. 575-597. Springer, Berlin (1994).
46. Vardi M. Y.: Automata-theoretic model checking revisited. In: Proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation. LNCS, vol. 4349, pp. 137-150. Springer, Berlin (2007).
47. Vardi M. Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceeding of the 1st LICS, pp. 332-344, Cambridge (1986).
48. Vardi M. Y., Wolper P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1-37 (1994).