Automata-theoretic model checking revisited

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

Volumn 4349 LNCS, Issue , 2007, Pages 137-150

  Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CODES (SYMBOLS); GRAPH THEORY; MATHEMATICAL MODELS;

GRAPH ALGORITHMS; SYMBOLIC IMPLEMENTATIONS;

MODEL CHECKING;

EID: 36349024585     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69738-1_10     Document Type: Conference Paper

References (83)

1. K. Albin et al. Property specification language reference manual. Technical Report Version 1.1, Accellera, 2004.
2. R. Armoni, S. Egorov, R. Fraer, D. Korchemny, and M.Y. Vardi. Efficient LTL compilation for SAT-based model checking. In Proc. Int'l Conf. on Computer-Aided Design, pages 877-884, 2005.
3. R. Armoni, L. Fix, A. Flaisher, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, E. Singerman, A. Tiemeyer, M.Y. Vardi, and Y. Zbar. The ForSpec temporal logic: A new temporal property-specification logic. In Proc. 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of Lecture Notes in Computer Science, pages 296-211, Grenoble, France, April 2002. Springer-Verlag.
4. R. Armoni, D. Korchemny, A. Tiemeyer, and M.Y. Vardi Y. Zbar. Deterministic dynamic monitors for linear-time assertions. In Proc. Workshop on Formal Approaches to Testing and Runtime Verification, volume 4262 of Lecture Notes in Computer Science. Springer, 2006.
5. J. L. Balcázar and A. Lozano. The complexity of graph problems for succinctly represented graphs. In Proc. Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 411, pages 277-285. Springer, 1989.
6. J. Barnat, L. Brim, and I. Cerna. Cluster-based LTL model checking of large systems. In Proc. 4th Int'l Symp. on Formal Methods for Components and Objects, volume 4111 of Lecture Notes in Computer Science, pages 259-279. Springer, 2006.
7. A. Biere, C. Artho, and V. Schuppan. Liveness checking as safety checking. In Proc. 7th Int'l Workshop on Formal Methods for Industrial Critical Systems, volume 66:2 of Electr. Notes Theor. Comput. Sci., 2002.
8. A. Biere, A. Cimatti, E.M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Analysis and Construction of Systems, volume 1579 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
9. R. Bloem, H.N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in n log n symbolic steps. In Formal Methods in Computer Aided Design, volume 1954 of Lecture Notes in Computer Science, pages 37-54. Springer-Verlag, 2000.
10. R. Bloem, K. Ravi, and F. Somenzi. Efficient decision procedures for model checking of linear time logic properties. In Computer Aided Verification, Proc. 11th International Conference, volume 1633 of Lecture Notes in Computer Science, pages 222-235. Springer-Verlag, 1999.
11. R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.
12. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method, and Philosophy of Science. 1960, pages 1-12, Stanford, 1962. Stanford University Press.
13. 20 states and beyond. Information and Computation, 98(2): 142-170, June 1992.
14. D. Bustan, D. Fisman, and John Havlicek. Automata construction for psl. Technical report, The Weizmann Institute of Science, May 2005. Technical Report MCS05-04.
15. Y. Choueka. Theories of automata on ω-tapes: A simplified approach. Journal of Computer and System Sciences, 8:117-141, 1974.
16. A. Cimatti, E.M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. Nusmv 2: An opensource tool for symbolic model checking. In Proc. 14th Int'l Conf. on Computer Aided Verification, Lecture Notes in Computer Science 2404, pages 359-364. Springer-Verlag, 2002.
17. A. Cimatti, M. Roveri, S. Semprini, and S. Tonetta. From psl to nba: A modular symbolic encoding. In Proc. 6th Int'l Conf. on Formal Methods in Computer-Aided design, 2006.
18. A. Cimatti, M. Roveri, and D. Sheridan. Bounded verification of past ltl. In Proc. 5th Int'l Conf. on Formal Methods in Computer-Aided Design, volume 3312 of Lecture Notes in Computer Science, pages 245-259. Springer, 2004.
19. E. M. Clarke, O. Grumberg, and K. Hamaguchi. Another look at ltl model checking. Formal Methods in System Design, 10(1):47-71, 1997.
20. E.M. Clarke, 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.
21. E.M. Clarke, O. Grumberg, and K. Hamaguchi. Another look at LTL model checking. In Computer Aided Verification, Proc. 6th International Conference, pages 415-427, Stanford, California, June 1994. Lecture Notes in Computer Science, Springer-Verlag.
22. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
23. E.M. Clarke and R.P. Kurshan. Computer aided verification. IEEE Spectrum, 33:61-67, 1986.
24. E.M. Clarke and J.M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28:626-643, 1996.
25. F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M.Y. Vardi. Benefits of bounded model checking at an industrial setting. In Computer Aided Verification, Proc. 13th International Conference, volume 2102 of Lecture Notes in Computer Science, pages 436-453. Springer-Verlag, 2001.
26. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill, 1990.
27. C. Courcoubetis, 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.
28. J-M. Couvreur. On-the-fly verification of linear temporal logic. In Proc. World Congress on Formal Methods, pages 253-271, 1999.
29. J.M. Couvreur, A. Duret-Lutz, and D. Poitrenaud. On-the-fly emptiness checks for generalized Büchi automata. In Proc. 12th Int'l SPIN Workshop on Model Checking of Software, volume 3639 of Lecture Notes in Computer Science, pages 143-158. Springer, 2005.
30. N. Daniele, F. Guinchiglia, and M.Y. Vardi. Improved automata generation for linear temporal logic. In Computer Aided Verification, Proc. 11th International Conference, volume 1633 of Lecture Notes in Computer Science, pages 249-260. Springer-Verlag, 1999.
31. A. Duret-Lutz and Denis Poitrenaud. Spot: An extensible model checking library using transition-based generalized büchi automata. In Proc. 12th Int'l Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pages 76-83. IEEE Computer Society, 2004.
32. E. A. Emerson and E.M. Clarke. Characterizing correctness properties of parallel programs using fixpoints. In Proc. 7th InternationalColloq. on Automata, Languages and Programming, pages 169-181, 1980.
33. E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional μ-calculus. In Proc. 1st Symp. on Logic in Computer Science, pages 267-278, Cambridge, June 1986.
34. K. Etessami and G.J. Holzmann. Optimizing Büchi automata. In Proc. 11th Int'l Conf. on Concurrency Theory, Lecture Notes in Computer Science 1877, pages 153-167. Springer-Verlag, 2000.
35. K. Fisler, R. Fraer, G. Kamhi, M.Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In 7th International Conference on Tools and algorithms for the construction and analysis of systems, number 2031 in Lecture Notes in Computer Science, pages 420-434. Springer-Verlag, 2001.
36. E. Friedgut, O. Kupferman, and M.Y. Vardi. Büchi complementation made tighter. Int'l J. of Foundations of Computer Science, 17(4):851-867, 2006.
37. C. Fritz. Constructing Büchi automata from linear temporal logic using simulation relations for alternating bchi automata. In Proc. 8th Intl. Conference on Implementation and Application of Automata, number 2759 in Lecture Notes in Computer Science, pages 35-48. Springer-Verlag, 2003.
38. C. Fritz. Concepts of automata construction from LTL. In Proc. 12th Int'l Conf. on Logic for Programming, Artificial Intelligence, and Reasoning, Lecture Notes in Computer Science 3835, pages 728-742. Springer-Verlag, 2005.
39. P. Gastin and D. Oddoux. Fast LTL to büchi automata translation. In Computer Aided Verification, Proc. 13th International Conference, volume 2102 of Lecture Notes in Computer Science, pages 53-65. Springer-Verlag, 2001.
40. J. Geldenhuys and A. Valmari. Tarjan's algorithm makes on-the-fly LTL verification more efficient. In Proc. 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 2988, pages 205-219. Springer-Verlag, 2004.
41. R. Gentilini, C. Piazza, and A. Policriti. Computing strongly connected components in a linear number of symbolic steps. In 14th ACM-SIAM Symposium on Discrete Algorithms, pages 573-582, Baltimore, Maryland, 2003.
42. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In P. Dembiski and M. Sredniawa, editors, Protocol Specification, Testing, and Verification, pages 3-18. Chapman & Hall, August 1995.
43. D. Giannakopoulou and F. Lerda. From states to transitions: Improving translation of LTL formulae to büchi automata. In Proc. 22nd IFIP Int'l Conf. on Formal Techniques for Networked and Distributed Systems, pages 308-326, 2002.
44. P. Godefroid and G.J. Holzmann. On the verification of temporal properties. In Proc. 13th Int. Conf on Protocol Specification Testing and Verification, pages 109-124, 1993.
45. S. Gurumurthy, R. Bloem, and F. Somenzi. Fair simulation minimization. In Computer Aided Verification, Proc. 14th International Conference, volume 2404 of Lecture Notes in Computer Science, pages 610-623. Springer-Verlag, 2002.
46. S. Gurumurthy, O. Kupferman, F. Somenzi, and M.Y. Vardi. On complementing nondeterministic Büchi automata. In 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods, volume 2860 of Lecture Notes in Computer Science, pages 96-110. Springer-Verlag, 2003.
47. R.H. Hardin, Z. Har'el, and R.P. Kurshan. COSPAN. In Computer Aided Verification, Proc. 8th International Conference, volume 1102 of Lecture Notes in Computer Science, pages 423-427. Springer-Verlag, 1996.
48. R.H. Hardin, R.P. Kurshan, S.K. Shukla, and M.Y. Vardi. A new heuristic for bad cycle detection using BDDs. Formal Methods in System Design, 18:131-140, 2001.
49. G.J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5):279-295, May 1997. Special issue on Formal Methods in Software Practice.
50. G.J. Holzmann, D. Peled, and M. Yannakakis. On nested depth-first search. In Proc. 2nd Spin Workshop on The Spin Verification System, pages 23-32. American Math. Soc., 1996.
51. O. Kupferman and M.Y. Vardi. Model checking of safety properties. Formal methods in System Design, 19(3):291-314, November 2001.
52. O. Kupferman and M. Y. Vardi. Weak alternating automata are not that weak. ACM Trans. on Computational Logic, 2(2):408-429, July 2001.
53. O. Kupferman and M.Y. Vardi. From complementation to certification. Theoretical Computer Science, 305:591-606, 2005.
54. O. Kupferman and M. Y. Vardi. From linear time to branching time. ACM Trans. on Computational Logic, 6(2):273-294, April 2005.
55. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
56. R.P. Kurshan. Formal verification in a commercial setting. In Proc. Conf. on Design Automation (DAC'97), volume 34, pages 258-262, 1997.
57. T. Latvala, A. Biere, K. Heljanko, and T. A. Junttila. Simple is better: Efficient bounded model checking for past ltl. In Proc. 6th Int'l Conf. on Verification, Model Checking, and Abstract Interpretation, volume 3385 of Lecture Notes in Computer Science, pages 380-395. Springer, 2005.
58. C. Löding. Optimal bounds for the transformation of omega-automata. In Proc. 19th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lecture Notes in Computer Science, pages 97-109, December 1999.
59. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
60. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
61. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. on Foundation of Computer Science, pages 46-57, 1977.
62. A. Pnueli and A. Zaks. Psl model checking and run-time verification via testers. In Proc. 14th Int'l Symp. on Formal Methods, volume 4085 of Lecture Notes in Computer Science, pages 573-586. Springer, 2006.
63. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, volume 137 of Lecture Notes in Computer Science, pages 337-351. Springer-Verlag, 1981.
64. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
65. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319-327, White Plains, October 1988.
66. S. Schwoon and J. Esparza. A note on on-the-fly verification algorithms. In Proc. 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 3440, pages 174-190. Springer-Verlag, 2005.
67. R. Sebastiani and S. Tonetta. "more deterministic" vs. "smaller" büchi automata for efficient ltl model checking. In 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods, volume 2860 of Lecture Notes in Computer Science, pages 126-140. Springer-Verlag, 2003.
68. R. Sebastiani, S. Tonetta, and M.Y. Vardi. Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking. In Proc. 17th Int'l Conf. on Computer Aided Verification, Lecture Notes in Computer Science 3576, pages 350-373. Springer-Verlag, 2005.
69. A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217-237, 1987.
70. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Computer Aided Verification, Proc. 12th International Conference, volume 1855 of Lecture Notes in Computer Science, pages 248-263. Springer-Verlag, 2000.
71. F. Somenzi, K. Ravi, and R. Bloem. Analysis of symbolic scc hull algorithms. In Proc. 4th Int'l Conf. on Formal Methods in Computer-Aided Design, volume 2517 of Lecture Notes in Computer Science, pages 88-105. Springer, 2002.
72. Heikki Tauriainen. Nested emptiness search for generalized Büchi automata. Fundamenta lnformaticae, 70(1-2): 127-154, 2006.
73. X. Thirioux. Simple and efficient translation from LTL formulas to Büchi automata. Electr. Notes Theor. Comput. Sci., 66(2), 2002.
74. M. Y. Vardi. Nontraditional applications of automata theory. In Proc. International Symp. on Theoretical Aspects of Computer Software, volume 789 of Lecture Notes in Computer Science, pages 575-597. Springer-Verlag, 1994.
75. M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. Birtwistle, editors, Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science, pages 238-266. Springer-Verlag, Berlin, 1996.
76. M.Y. Vardi. Branching vs. linear time: Final showdown. In Proc. 7th International Conference on Tools and algorithms for the construction and analysis of systems, volume 2031 of Lecture Notes in Computer Science, pages 1-22. Springer-Verlag, 2001.
77. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Computer Science, pages 332-344, Cambridge, June 1986.
78. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1): 1-37, November 1994.
79. P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1-2):72-99, 1983.
80. P. Wolper. The tableau method for temporal logic: An overview. Logique et Analyse, 110-111:119-136, 1985.
81. P. Wolper, M.Y. Vardi, and A.P. Sistla. Reasoning about infinite computation paths. In Proc. 24th IEEE Symp. on Foundations of Computer Science, pages 185-194, Tucson, 1983.
82. Q. Yan. Lower bounds for complementation of ω-automata via the full automata technique. In Proc. 33rd Intl. Colloq. on Automata, Languages and Pr ogramming, volume 4052 of Lecture Notes in Computer Science, pages 589-600. Springer-Verlag, 2006.
83. L. Zhang and S. Malik. The quest for efficient Boolean satisfiability solvers. In A. Voronkov, editor, Proc. 18th Int'l Conf. on Automated Deduction (CADE'02), Lecture Notes in Computer Science 2392, pages 295-313. Springer-Verlag, 2002.