Micro-macro stack systems: A new frontier of elementary decidability for sequential systems

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 381-390

  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

ALGORITHMS; COMPUTATIONAL METHODS; FINITE AUTOMATA; FORMAL LOGIC; MATHEMATICAL MODELS; TREES (MATHEMATICS); AEROSPACE INDUSTRY; AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; CONTRACTS; FORMAL SPECIFICATION; GRAPHIC METHODS; STATE SPACE METHODS;

BINARY TREES;

SEQUENTIAL MACHINES; MODEL CHECKING;

ALGORITHM DESIGN AND ANALYSIS; AUTOMATA; FETS; LOGIC; MICRO AND MACRO; MODEL CHECKING PROBLEM; PREFIX-RECOGNIZABLE GRAPHS; SEQUENTIAL SYSTEMS;

EID: 0042467758     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (48)

1. K. Barthelmann. On equational simple graphs. Tech. report, Universität Mainz, 1997.
2. P. Biesse, T. Leonard, and A. Mokkedem. Finding bugs in an alpha microprocessors using satisfiability solvers. In 13th CAV, LNCS 2102, 454-464. Springer-Verlag. 2001.
3. A. Blumensath. Prefix-recognisable graphs and monadic second-order logic. Tech. Report, RWTH Aachen, 2001.
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In 8th Concur, LNCS 1243, 135-150, Springer-Velag, 1997.
5. J. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, pages 1-12, Stanford, 1962.
6. J. R. Büchi. Weak second-order arithmetic and finite automata. Zeit. math. Logik Grundladen Math., 6:66-92, 1960.
7. O. Burkart. Automatic verification of sequential infinite-state processes. In LNCS 1354, Springer-Verlag. 1997.
8. O. Burkart. Model checking rationally restricted right closures of recognizable graphs. In Proc. 2nd Infinity, 1997.
9. O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. Unpublished manuscript, 2000.
10. O. Burkart and J. Esparza. More infinite results. In 1st Infinity, ENTCS, 6. Elsevier, 1996.
11. O. Burkart and Y.-M. Quemener. Model checking of infinite graphs defined by graph grammers. In 1st Infinity, 1996.
12. O. Burkart and B. Steffen. Composition, decomposition and model checking of pushdown processes. Nordic J. Comut., 2:89-125, 1995.
13. O. Burkart and B. Steffen. Model checking the full modal μ-calculus for infinite sequential processes. TCS, 221. 1999.
14. T. Cachat. Uniform solution of parity games on prefix-recognizable graphs. In 4th Infinity, 2002.
15. D. Caucal. On infinite transition graphs having a decidable monadic theory. In 23rd ICALP, LNCS 1099. 1996.
16. D. Caucal. On infinite terms having a decidable monadic theory. In 27th MFCS, LNCS 2420, 165-176. 2002.
17. D. Caucal and R. Monfort. On the transition graphs of automata and grammars. In 16th WG, LNCS 484. 1990.
18. E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, 1981.
19. E. Clarke, E. Emerson, and A. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2):244-263, January 1986.
20. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
21. F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Vardi. Benefits of bounded model checking at an industrial setting. In 13th CAV, LNCS 2102, 2001.
22. M. Dickhfer and T. Wilke. Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In ICALP, LNCS 1644, 281-290. 1999.
23. E. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In Proc. 32nd FOCS, 368-377, 1991.
24. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown automata. In 2nd Infinity, 1997.
25. S. Ginsburg, S. Greibach, and M. Harrison. One-way stack automata. JACM, 14(2):381-418, 1967.
26. S. Ginsburg, S. Greibach, and M. Harrison. Stack automata and compiling. JACM, 14(1):172-201, 1967.
27. D. Harel and D. Raz. Deciding emptiness for stack automata on infinite trees. IC, 113(2):278-299, 1994.
28. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
29. D. Janin and I. Walukiewicz. Automata for the modal μ-calculus and related results. In 20th MFCS, 1995.
30. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In 5th FOSSACS, LNCS 2303, 205-222, 2003. Springer-Verlag.
31. O. Kupferman, N. Piterman, and M. Vardi. Model checking linear properties of prefix-recognizable systems. In 14th CAV, LNCS 2404, 371-386. Springer-Verlag. 2002.
32. O. Kupferman, N. Piterman, and M. Vardi. Pushdown specifications. In 9th LPAR, LNCS 2514, 262-277. 2002.
33. O. Kupferman and M. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In 12th CAV, LNCS 1855, 36-52. Springer-Verlag. 2000.
34. O. Kupferman, M. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. JACM, 47(2):312-360, 2000.
35. R. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
36. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In 12th POPL, 97-107, 1985.
37. C. Morvan. On rational graphs. In 3rd FSSCS, LNCS 1784, 252-266, Springer-Verlag. 2000.
38. D. Muller and P. Schupp. The theory of ends, pushdown automata, and second-order logic. TCS, 37:51-75, 1985.
39. J. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In 5th ISP, LNCS 137, 1981.
40. C. Stirgling. Decidability of bisimulation equivalence for pushdown processes. Unpublished manuscript, 2000.
41. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191, 1990.
42. W. Thomas. A short introduction to infinite automata. In 5th. DLT, LNCS 2295, 130-144. Springer-Verlag, 2001.
43. M. Vardi. Reasoning about the past with two-way automata. In 25th ICALP, LNCS 1443, 628-641. 1998.
44. M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In 1st LICS, 332-344, 1986.
45. M. Vardi and P. Wolper. Reasoning about infinite computations. IC, 115(1):1-37, 1994.
46. I. Walukiewicz. Pushdown processes: games and model checking. In 8th CAV, LNCS 1102, 62-74. 1996.
47. I. Walukiewicz. Monadic second-order logic on tree-like structures. TCS, 275(1-2):311-346, 2002.
48. + is exponentially more succinct than CTL. In 19th FSTTCS, LNCS 1738, 110-121. 1999.