Analysis of recursive game graphs using data flow equations

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

Volumn 2937, Issue , 2004, Pages 282-296

  Etessami, K ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; DATA TRANSFER; DIGITAL STORAGE; FLOW GRAPHS; MODEL CHECKING;

ALTERNATIVE ALGORITHMS; CONTROL FLOW GRAPHS; FINITE-STATE ABSTRACTION; RECURSIVE PROCEDURE; RECURSIVE PROGRAMS; RECURSIVE STATE MACHINES; SEQUENTIAL PROGRAMS; SPACE EFFICIENCIES;

DATA FLOW ANALYSIS;

EID: 79952439100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. of CAV’01, pp. 304–313, 2001.
2. A. Appel. Modern compiler implementation. Cambridge U. Press, 1998.
3. R. Alur, S. La Torre, and P. Madhusudan. Modular strategies for infinite games on recursive graphs. In CAV’03, LNCS vol. 2725, pages 67–79, 2003.
4. R. Alur, S. La Torre, and P. Madhusudan. Modular strategies for recursive game graphs. In TACAS’03, LNCS vol. 2619, pp. 363–378, 2003.
5. A. Boujjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: App’s to model checking. In CONCUR’97, pages 135–150, 1997.
6. M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. In ICALP’01, LNCS 2076, pp. 652–666, 2001.
7. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN’2000, volume 1885 of LNCS, pages 113–130, 2000.
8. O. Burkart and B. Steffen. Model checking of context-free processes. In Proc. of CONCUR, volume 836 of LNCS, pages 123–137, 1992.
9. T. Cachat. Symbolic strategy synthesis for games on pushdown graphs. In Proc. of ICALP, volume 2380 of LNCS, 2002.
10. T. Cachat. Uniform solution of parity games on prefix recognizable graphs. In Infinity 2002, 4th. Int. Workshop, 2002.
11. D. Caucal. On the regular structure of prefix rewriting. In 5th Coll. on Trees in Algebra and Programming, LNCS vol. 431, pp. 87–102, 1990.
12. T. Cachat, J. Duparc, and W. Thomas. Solving pushdown games with a sigma3 winning condition. In CSL’02, pp. 322–336, 2002.
13. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In 12th Computer-Aided Verification, volume 1855 of LNCS, pages 232–247. Springer, 2000.
14. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. In Infinity’97 Workshop, volume 9 of Electronic Notes in Theoretical Computer Science, 1997.
15. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer, 1999.
16. T. Reps. Program analysis via graph reachability. Information and Software Technology, 40(11-12):701–726, 1998.
17. O. Serre. Note on winning strategies on pushdown games with omegaregular winning conditions. Information Processing Letters, 85(6):285–291, 2003.
18. W. Thomas. On the synthesis of strategies in infinite games. In STACS, volume 900 of LNCS, pages 1–13, 1995.
19. I. Walukiewicz. Pushdown processes: games and model checking. In Computer-Aided Verification, pages 62–75, 1996.