Winning regions of pushdown parity games: A saturation method

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

Volumn 5710 LNCS, Issue , 2009, Pages 384-398

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATON TRANSFORMATIONS; BLOW-UP; CHARACTERISATION; FINITE WORDS; OPTIMISATIONS; PARITY GAMES; PROOF OF CORRECTNESS; PUSHDOWN SYSTEMS; SATURATION METHOD; UNDER-APPROXIMATION;

GAME THEORY; ROBOTS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 70349881812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_26     Document Type: Conference Paper

References (14)

1. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A.,Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.1243, pp. 135-150. Springer, Heidelberg (1997)
2. Finkel, A.,Willems, B.,Wolper, P.: A direct symbolic approach to model checking pushdown systems. In: INFINITY (1997)
3. Walukiewicz, I.: Pushdown processes: Games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.1102, pp. 62-74. Springer, Heidelberg (1996)
4. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: FOCS 1991, pp. 368-377 (1991)
5. Esparza, J., Kuicera, A., Schwoon, S.: Model-checking LTL with regular valuations for pushdown systems. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.2215, pp. 316-339. Springer, Heidelberg (2001)
6. Hague, M.: Saturation methods for global model-checking pushdown systems. PhD. Thesis, University of Oxford (2009)
7. Jones, N., Muchnick, S.: Even simple programs are hard to analyse. JACM 24, 338-350 (1977)
8. Piterman, N., Y. Vardi, M.: Global model-checking of infinite-state systems. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.3114, pp. 387-400. Springer, Heidelberg (2004)
9. Serre, O.: Note on winning positions on pushdown games with ù-regular conditions. Information Processing Letters 85, 285-291 (2003)
10. Schwoon, S.: Model-checking Pushdown Systems. PhD thesis, Tech. Univ., Munich (2002)
11. Ball, T., Rajamani, S.K.: Bebop: A Symbolic Model Checker for Boolean Programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol.1885, pp. 113-130. Springer, Heidelberg (2000)
12. Ball, T., Rajamani, S.K.: The SLAM project: Debugging system software via static analysis. In: POPL, pp. 1-3 (2002)
13. Cachat, T.: Games on Pushdown Graphs and Extensions. PhD thesis, RWTH Aachen (2003)
14. Reps, T., Schwoon, S., Jha, S., Melski, D.:Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program. (2005)