Analysis of Recursive Game Graphs Using Data Flow Equations
暂无分享,去创建一个
[1] Thierry Cachat. Symbolic Strategy Synthesis for Games on Pushdown Graphs , 2002, ICALP.
[2] Rajeev Alur,et al. Modular strategies for recursive game graphs , 2003, Theor. Comput. Sci..
[3] Thomas W. Reps,et al. Program analysis via graph reachability , 1997, Inf. Softw. Technol..
[4] Flemming Nielson,et al. Principles of Program Analysis , 1999, Springer Berlin Heidelberg.
[5] Sriram K. Rajamani,et al. Bebop: A Symbolic Model Checker for Boolean Programs , 2000, SPIN.
[6] Rajeev Alur,et al. Modular Strategies for Infinite Games on Recursive Graphs , 2003, CAV.
[7] Pierre Wolper,et al. A direct symbolic approach to model checking pushdown systems , 1997, INFINITY.
[8] Andrew W. Appel,et al. Modern Compiler Implementation in Java , 1997 .
[9] Didier Caucal,et al. On the Regular Structure of Prefix Rewriting , 1990, Theor. Comput. Sci..
[10] Wolfgang Thomas,et al. Solving Pushdown Games with a Sigma3 Winning Condition , 2002, CSL.
[11] I. Walukiewicz. Pushdown Processes: Games and Model Checking , 1996 .
[12] Jim Alves-Foss,et al. Higher Order Logic Theorem Proving and its Applications 8th International Workshop, Aspen Grove, Ut, Usa, September 11-14, 1995 : Proceedings , 1995 .
[13] Javier Esparza,et al. Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.
[14] Olivier Serre. Note on winning positions on pushdown games with [omega]-regular conditions , 2003, Inf. Process. Lett..
[15] Javier Esparza,et al. Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.
[16] Rajeev Alur,et al. Analysis of Recursive State Machines , 2001, CAV.
[17] Wolfgang Thomas,et al. On the Synthesis of Strategies in Infinite Games , 1995, STACS.
[18] Thierry Cachat,et al. Uniform Solution of Parity Games on Prefix-Recognizable Graphs , 2003, INFINITY.
[19] Michael Benedikt,et al. Model Checking of Unrestricted Hierarchical State Machines , 2001, ICALP.