Pushdown specifications

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

Volumn 2514, Issue , 2002, Pages 262-277

  Kupferman, Orna ^a   Piterman, Nir ^b   Vardi, Moshe Y ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; COMPUTER CIRCUITS; FORESTRY; ROBOTS; SPECIFICATIONS; TREES (MATHEMATICS);

CONTEXT-FREE; FINITE STATE SYSTEMS; INFINITE STATE SYSTEMS; MODEL CHECKING ALGORITHM; MODEL CHECKING PROBLEM; PARITY TREE AUTOMATA; REGULAR PROPERTIES; TREE AUTOMATA;

MODEL CHECKING;

EID: 84954427251     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36078-6_18     Document Type: Conference Paper

References (35)

1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2–34, May 1993.
2. A. Bouajjani, R. Echahed, and P. Habermehl. On the verification problem of nonregular properties for nonregular processes. In 10th LICS, pp. 123–133, 1995. IEEE.
3. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In 8th Concur, LNCS 1243, pp. 135–150, 1997.
4. A. Bouajjani, R. Echahed, and R. Robbana. Verification of nonregular temporal properties for context-free processes. In 5th Concur, LNCS 836, pp. 81–97, 1994.
5. P. Biesse, T. Leonard, and A. Mokkedem. Finding bugs in an alpha microprocessors using satisfiability solvers. In 13th CAV, LNCS 2102, pp. 454–464. 2001.
6. J.R. B¨uchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, pages 1–12, Stanford, 1962.
7. O. Burkart. Model checking rationally restricted right closures of recognizable graphs. In 2nd INFINITY, 1997.
8. 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.
9. 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 13th CAV, LNCS 2102, pp. 436–453. Springer-Verlag, 2001.
10. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
11. E.A. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In 32nd FOCS, pp. 368–377, 1991.
12. E.A. Emerson, C. Jutla, and A.P. Sistla. On model-checking for fragments of μ-calculus. In 5th CAV, LNCS 697, pp. 385–396, 1993. Springer-Verlag.
13. E.A. Emerson. Uniform inevitability is tree automaton ineffable. Information Processing Letters, 24(2):77–79, January 1987.
14. J.E. Hopcroft, R. Motwani, and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation (2nd Edition). Addison-Wesley, 2000.
15. D. Harel and D. Raz. Deciding emptiness for stack automata on infinite trees. Information and Computation, 113(2):278–299, September 1994.
16. D. Janin and I. Walukiewicz. Automata for the modal μ-calculus and related results. In Proc. 20th MFCS, LNCS 969, pp. 552–562. Springer-Verlag, 1995.
17. O. Kupferman, N. Piterman, and M.Y. Vardi. Model checking linear properties of prefix-recognizable systems. In Proc. 14th CAV, LNCS 2404, pp. 371–385. 2002.
18. O. Kupferman and M.Y. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In 12th CAV, LNCS 1855, pp. 36–52. Springer-Verlag, 2000.
19. O. Kupferman and M.Y. Vardi. On clopen specifications. In Proc. 8th LPAR, LNAI 2250, pp. 24–38. Springer-Verlag, 2001.
20. O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312–360, March 2000.
21. L. Lamport. Sometimes is sometimes “not never” - on the temporal logic of programs. In 7th POPL, pp. 174–185, 1980.
22. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In 12th POPL, pp. 97–107, 1985.
23. M.L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, 1967.
24. D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and secondorder logic. Theoretical Computer Science, 37:51–75, 1985.
25. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267–276, 1987.
26. W. Peng and S. P. Iyer. A new typee of pushdown automata on infinite tree. IJFCS, 6(2):169–186, 1995.
27. A. Pnueli. The temporal logic of programs. In 18th FOCS, pp. 46–57, 1977.
28. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In 12th ICALP, pp. 15–32. Springer-Verlag, 1985.
29. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th Int. Symp. on Programming, LNCS 137, pp. 337–351, 1981.
30. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1–35, 1969.
31. A. Sistla, E.M. Clarke, N. Francez, and Y. Gurevich. Can message buffers be axiomatized in linear temporal logic. Information and Control, 63(1/2):88–112, 1984.
32. W. Thomas. A short introduction to infinite automata. In 5th. DLT, LNCS 2295, pp. 130–144. Springer-Verlag, July 2001.
33. M Y. Vardi. Reasoning about the past with two-way automata. In 25th ICALP, LNCS 1443, pp. 628–641. Springer-Verlag, 1998.
34. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In 1st LICS, pp. 332–344, 1986.
35. I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234–263, 2001.