Global model-checking of infinite-state systems

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

Volumn 3114, Issue , 2004, Pages 387-400

  Piterman, Nir ^a   Vardi, Moshe Y ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; FORESTRY;

ALTERNATING AUTOMATA; AMOUNT OF INFORMATION; INFINITE STATE SYSTEMS; LINEAR-TIME PROPERTIES; LOCAL MODEL CHECKING; MODEL CHECKING PROBLEM; SEQUENTIAL SYSTEMS; TEMPORAL PROPERTY;

MODEL CHECKING;

EID: 35048836255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_30     Document Type: Article

References (39)

1. R. Alur, S. La Torre, and P. Madhusudan. Modular strategies for infinite games on recursive game graphs. In 15th CAV, LNCS 2725, 67-79, Springer-Verlag, 2003.
2. 20 states and beyond. IC, 98(2):142-170, 1992.
3. O. Burkart and Y.-M. Quemener. Model checking of infinite graphs defined by graph grammars. In 1st Infinity, ENTCS 6, 1996.
4. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In 7th SPIN Workshop, LNCS 1885, 113-130, 2000. Springer.
5. O. Burkart and B. Steffen. Model checking for context-free processes. In 3rd Concur, LNCS 630, 123-137. Springer, 1992.
6. O. Burkart and B. Steffen. Composition, decomposition and model checking of pushdown processes. Nordic J. Comput., 2:89-125, 1995.
7. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method, and Philos. Sci. 1960, pages 1-12, 1962.
8. O. Burkart. Model checking rationally restricted right closures of recognizable graphs. In 2nd Infinity, 1997.
9. T. Cachat. Uniform solution of parity games on prefix-recognizable graphs. In 4th Infinity, ENTCS 68(6), 2002.
10. T. Cachat. Higher order pushdown automata, the Caucal hierarchy of graphs and parity games. In 30th ICALP, LNCS 2719, 556-569, 2003. Springer.
11. D. Caucal. On infinite transition graphs having a decidable monadic theory. In 23rd ICALP, volume 1099 of LNCS, 194-205. Springer, 1996.
12. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. TOPLAS, 8(2), 1986.
13. H. Chockler, O. Kupferman, R.P. Kurshan, and M.Y. Vardi. A practical approach to coverage in model checking. In 13th CAV, LNCS 2102, 66-78. Springer, 2001.
14. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. FMSD, 1:275-288, 1992.
15. H. Chen and D. Wagner. Mops: an infrastructure for examining security properties of software. In 9th CCS, 235-244, 2002. ACM.
16. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In 12th CAV, LNCS 1855, 232-247, 2000. Springer.
17. E.A. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In 32nd FOCS, 368-377, 1991.
18. E.A. Emerson, C. Jutla, and A.P. Sistla. On model-checking for fragments of μ-calculus. In 5th CAV, LNCS 697, 385-396, 1993. Springer.
19. J. Esparza, A. Kucera, and S. Schwoon. Model-checking LTL with regular valuations for pushdown systems. In 4th STACS, LNCS 2215, 316-339, 2001. Springer.
20. E.A. Emerson. Model checking and the μ-calculus. In Descriptive Complexity and Finite Models, 185-214. AMS, 1997.
21. J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In 13th CAV, LNCS 2102, 324-336, 2001. Springer.
22. D. Janin and I. Walukiewicz. Automata for the modal μ-calculus and related results. In 20th MFCS, em LNCS, 552-562. Springer, 1995.
23. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In 5th FOSSACS, LNCS 2303, 205-222, 2003. Springer.
24. D. Kozen. Results on the prepositional μ-calculus. TCS, 27:333-354, 1983.
25. O. Kupferman, N. Piterman, and M.Y. Vardi. Model checking linear properties of prefix-recognizable systems. In 14th CAV, LNCS 2404, 371-385. Springer, 2002.
26. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. 1994.
27. O. Kupferman and M.Y. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In 12th CAV, LNCS 1855, 36-52. Springer, 2000.
28. Y. Lakhnech, S. Bensalem, S. Berezin, and S. Owre. Incremental verification by abstraction. In 7th TACAS, LNCS 2031, 98-112, 2001. Springer.
29. D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and second-order logic. TCS, 37:51-75, 1985.
30. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. TCS, 54, 1987.
31. A. Pnueli. The temporal logic of programs. In 18th FOCS, 46-57, 1977.
32. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In 7th TACAS, LNCS 2031, 82-97, 2001. Springer.
33. N. Piterman and M.Y. Vardi. Micro-macro stack systems: A new frontier of decidability for sequential systems. In 18th LICS, 381-390, 2003. IEEE.
34. M.O. Rabin. Automata on infinite objects and Church's problem. AMS, 1972.
35. C. Stirling and D. Walker. Local model checking in the modal μ-calculus. TCS, 89(1):161-177, 1991.
36. M.Y. Vardi. Reasoning about the past with two-way automata. In 25th ICALP, 1998.
37. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. IC, 115(1), 1994.
38. I. Walukiewicz. Pushdown processes: games and model checking. In 8th CAV, 1996.
39. + is exponentially more succinct than CTL. In 19th FSTTCS, 1999.