Symbolic backwards-reachability analysis for higher-order pushdown systems

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

Volumn 4423 LNCS, Issue , 2007, Pages 213-227

  Hague, Matthew ^a   Ong, C H Luke ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GAME THEORY; MODEL CHECKING; PROBLEM SOLVING; SET THEORY;

N-EXPTIME; PUSHDOWN SYSTEMS; REACHABILITY ANALYSIS;

SYSTEMS ANALYSIS;

EID: 37149014224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71389-0_16     Document Type: Conference Paper

References (27)

1. A. Bouajjani and A. Meyer. Symbolic Reachability Analysis of Higher-Order Context-Free Processes. In Proc. FSTTCS'04, 2004. LNCS 3328.
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. CONCUR '97, pp. 135-150, 1997.
3. A. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with the unboundedness and regular conditions. In Proc. FSTTCS'03, pages 88-99, 2003.
4. A. Carayol. Regular sets of higher-order pushdown stacks. In Proc. MFCS, pages 168-179, 2005.
5. A. Carayol and S. Wöhrle. The caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In Proc. FSTTCS, pages 112-123, 2003.
6. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. ACM, 28(1):114-133, 1981.
7. J. Engelfriet. Iterated push-down automata and complexity classes. In Proc. STOC, pages 365-373, 1983.
8. M. Hague, A. S. Murawski, O. Serre and C.-H. L. Ong. Collapsible pushdown automata and recursion schemes, 2006. Preprint, 13 pages.
9. C. Löding, P. Madhusudan, and O. Serre. Visibly pushdown games. In Proc. FSTTCS'04, pages 408-420. 2004. LNCS 3328.
10. D. Caucal. On infinite terms having a decidable monadic theory. In Proc. MFCS'02, pages 165-176, 2002. LNCS 2420.
11. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theor. Comput. Sei., 37:51-75, 1985.
12. H. Gimbert. Parity and exploration games on infinite graphs. In Proc. CSL'04, pages 56-70, 2004. LNCS 3210.
13. M. Hague and C.-H. L. Ong. Symbolic backwards-reachability analysis for higherorder pushdown systems. Preprint, 54 pages, www.comlab.ox.ac.uk/oucl/work/ matthew.hague/FoSSaCS07-long.pdf, 2006.
14. I. Walukiewicz. Pushdown processes: Games and model checking. In Proc. CAV '96, pages 62-74. 1996.
15. J. A. Brzozowski and E. L. Leiss. On equations for regular languages, finite automata, and sequential networks. Theor. Comput. Sci., 10:19-35, 1980.
16. K. Aehlig, J. G. de Miranda, and C.-H. L. Ong. Safety is not a restriction at level 2 for string languages. In Proc. FoSSaCS, pages 490-504, 2005.
17. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Banff Higher Order Workshop, pages 238-266, 1995.
18. A. N. Maslov. Multilevel stack automata. Problems of Information Transmission, 15:1170-1174, 1976.
19. O. Serre. Note on winning positions on pushdown games with w-regular conditions. Information Processing Letters, 85:285-291, 2003.
20. O. Serre. Games with winning conditions of high Borel complexity. In Proc. ICALP'04, pages 1150-1162. Springer-Verlag, 2004. LNCS 3142.
21. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In Proc. LICS '06, pages 81-90. IEEE Computer Society, 2006.
22. T. Cachat. Games on Pushdown Graphs and Extensions. PhD thesis, RWTH Aachen, 2003.
23. 3 winning condition. In Proc. CSL'02, pages 322-336. Springer-Verlag, 2002. LNCS 2471.
24. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In Proc. FoSSaCS '02, pages 205-222, London, UK, 2002. Springer-Verlag.
25. T. Knapik, D. Niwinski, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In Proc. ICALP '05, pages 1450-1461, 2005.
26. M. Y. Vardi. A temporal fixpoint calculus. In Proc. POPL '88, pages 250-259, New York, NY, USA, 1988. ACM Press.
27. W. Thomas. Automata on infinite objects. Handbook of theoretical computer science (vol. B): formal models and semantics, pages 133-191, 1990.