Visibly pushdown games

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

Volumn 3328, Issue , 2004, Pages 408-420

  Löding, Christof ^a   Madhusudan, P ^b   Serre, Olivier ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE LANGUAGES; SOFTWARE ENGINEERING; SPECIFICATIONS;

BOOLEAN COMBINATIONS; CLOSURE PROPERTY; CONTEXT-FREE LANGUAGES; DECISION PROBLEMS; PUSHDOWN; PUSHDOWN GAMES; PUSHDOWN SYSTEMS; TOPOLOGICAL COMPLEXITY; VISIBLY PUSHDOWN LANGUAGES; WINNING CONDITIONS; VISIBLY PUSHDOWN AUTOMATON;

SPECIFICATIONS; CONTEXT FREE LANGUAGES;

EID: 35048815645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_34     Document Type: Article

References (17)

1. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In TACAS'04, volume 2988 of LNCS, pages 467-481. Springer, 2004.
2. R. Alur and P. Madhusudan. Visibly pushdown languages. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC '04, 2004.
3. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN 2000, volume 1885 of LNCS, pages 113-130. Springer, 2000.
4. A. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with the unboundedness and regular conditions. In Proceedings of FSTTCS'03, volume 2914 of LNCS, pages 88-99. Springer, 2003.
5. 3 winning condition. In CSL'02, volume 2471 of LNCS, pages 322-336. Springer, 2002.
6. E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model-checking for fragments of μ-calculus. In CAV '93, volume 697 of LNCS, pages 385-396. Springer, 1993.
7. A.S. Kechris. Classical Descriptive Set Theory, volume 156 of Graduate texts in mathematics. Springer Verlag, 1994.
8. D. A. Martin. Borel Determinacy. Annals of Mathematics, 102:363-371, 1975.
9. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symposium on Principles of Programming Languages, Austin, January 1989.
10. T. Reps, S. Horwitz, and S. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. of ACM Symp. POPL, pages 49-61, 1995.
11. O. Serre. Games with winning conditions of high borel complexity. In Proceedings of ICALP'04, volume 3142 of LNCS, pages 1150-1162. Springer, 2004.
12. L. Staiger. Handbook of Formal Language Theory, volume III, chapter ω-Languages, pages 339-387. Springer, 1997.
13. W. Thomas. Handbook of Formal Language Theory, volume III, chapter Languages, Automata, and Logic, pages 389-455. Springer, 1997.
14. W. Thomas. A short introduction to infinite automata. In Proceedings of DLT '01, volume 2295 of LNCS, pages 130-144. Springer, 2002.
15. I. Walukiewicz. Pushdown processes: Games and model checking. Information and Computation, 164(2), January 2001.
16. I. Walukiewicz. A landscape with games in the background. In Proceedings of LICS'04, Invited talk, 2004. To appear.
17. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. TCS, 200(1-2):135-183, 1998.