Symbolic backwards-reachability analysis for higher-order pushdown systems

Logical Methods in Computer Science

Volumn 4, Issue 4, 2008, Pages

  Hague, Matthew ^a   Ong, Luke ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Automata; Games; Higher order; Model checking; Pushdown systems; Reachability; Symbolic techniques

Indexed keywords

AUTOMATA; GAMES; HIGHER-ORDER; PUSHDOWN SYSTEMS; REACHABILITY; SYMBOLIC TECHNIQUES;

AUTOMATA THEORY; CALCULATIONS;

MODEL CHECKING;

EID: 77951473469     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(4:14)2008     Document Type: Article

References (31)

1. A. Bouajjani and A. Meyer. Symbolic Reachability Analysis of Higher-Order Context-Free Processes. In Proc. 24rd Conf. on Found. of Software Technology and Theoretical Computer Science (FSTTCS'04), volume 3328 of Lecture Notes in Computer Science, Madras, India, December 2004. Springer Pub.
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In International Conference on Concurrency Theory, pages 135-150, 1997.
3. A. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with the unboundedness and regular conditions. In FSTTCS'03, volume 2914 of lncs, pages 88-99. Springer-Verlag, 2003.
4. A. Carayol. Regular sets of higher-order pushdown stacks. In 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 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. C. Löding, P. Madhusudan, and O. Serre. Visibly pushdown games. In Proceedings of FSTTCS'04, volume 3328 of LNCS, pages 408-420. Springer-Verlag, 2004.
8. D. Caucal. On infinite terms having a decidable monadic theory. In Proc. MFCS'02, pages 165-176, 2002. LNCS 2420.
9. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theor. Comput. Sci., 37: 51-75, 1985.
10. J. Engelfriet. Iterated pushdown automata and complexity classes. In STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pages 365-373, New York, NY, USA, 1983. ACM Press.
11. H. Gimbert. Parity and exploration games on infinite graphs. In Proceedings of CSL'04, volume 3210 of LNCS, pages 56-70. Springer-Verlag, 2004.
12. I. Walukiewicz. Pushdown processes: Games and model checking. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of the Eighth International Conference on Computer Aided Verification CAV, volume 1102, pages 62-74, New Brunswick, NJ, USA,/1996. Springer Verlag.
13. J. A. Brzozowski and E. L. Leiss. On equations for regular languages, finite automata, and sequential networks. Theor. Comput. Sci., 10: 19-35, 1980.
14. J. Bradfield and C. Stirling. Modal logics and mu-calculi: an introduction, 2001.
15. K. Aehlig, J. G. de Miranda, and C.-H. L. Ong. Safety is not a restriction at level 2 for string languages. In FoSSaCS, pages 490-504, 2005.
16. M. Hague. Saturation Methods for Global Model Checking Pushdown Systems. PhD thesis, Oxford University Computing Laboratory. To appear.
17. M. Hague, A. S. Murawski, O. Serre, and C.-H. L. Ong. Collapsible pushdown automata and recursion schemes, 2006. Preprint, 13 pages.
18. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Banff Higher Order Workshop, pages 238-266, 1995.
19. A. N. Maslov. Multilevel stack automata. Problems of Information Transmission, 15: 1170-1174, 1976.
20. O. Serre. Note on winning positions on pushdown games with ω-regular conditions. Information Processing Letters, 85: 285-291, 2003.
21. O. Serre. Games with winning conditions of high Borel complexity. In Proceedings of ICALP'04, volume 3142 of LNCS, pages 1150-1162. Springer-Verlag, 2004.
22. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In LICS '06: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, pages 81-90, Washington, DC, USA, 2006. IEEE Computer Society.
23. R. S. Streett and E. A. Emerson. An automata theoretic decision procedure for the propositional mucalculus. Inf. Comput., 81(3): 249-264, 1989.
24. C. Stirling. Bisimulation, modal logic and model checking games. Logic Journal of the IGPL, 7(1): 103-124, 1999.
25. T. Cachat. Games on Pushdown Graphs and Extensions. PhD thesis, RWTH Aachen, 2003.
26. T. Cachat and I. Walukiewicz. The complexity of games on higher order pushdown automata, 2007.
27. T. Cachat, J. Duparc, and W. Thomas. Solving pushdown games with a Σ3 winning condition. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic (CSL'02), volume 2471 of LNCS, pages 322-336. Springer-Verlag, 2002.
28. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS '02: Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures, pages 205-222, London, UK, 2002. Springer-Verlag.
29. T. Knapik, D. Niwinski, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In ICALP, pages 1450-1461, 2005.
30. M. Y. Vardi. A temporal fixpoint calculus. In POPL '88: Proceedings of the 15th ACM SIGPLANSIGACT symposium on Principles of programming languages, pages 250-259, New York, NY, USA, 1988. ACM Press.
31. W. Thomas. Automata on infinite objects. Handbook of theoretical computer science (vol. B): formal models and semantics, pages 133-191, 1990.