A constraint-based approach to solving games on infinite graphs

ACM SIGPLAN Notices

Volumn 49, Issue 1, 2014, Pages 221-233

  Beyene, Tewodros A ^a   Chaudhuri, Swarat ^b   Popeea, Corneliu ^a   Rybalchenko, Andrey ^c  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b RICE UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Games; Horn clauses; Program synthesis; Proof rules; Reactive synthesis; Static analysis

Indexed keywords

EID: 84894043056     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (47)

1. R. Alur, P. Cerný, P. Madhusudan, andW. Nam. Synthesis of interface specifications for java classes. In POPL, pages 98-109, 2005.
2. T. Ball and O. Kupferman. An abstraction-refinement framework for multi-agent systems. In LICS, pages 379-388. IEEE, 2006.
3. T. Beyene, C. Popeea, and A. Rybalchenko. Solving existentially quantified Horn clauses. In CAV, 2013.
4. M. Bodlaender, C. Hurkens, V. Kusters, F. Staals, G. Woeginger, and H. Zantema. Cinderella versus the Wicked Stepmother. In IFIP TCS, pages 57-71, 2012.
5. M. Bofill, R. Nieuwenhuis, A. Oliveras, E. Rodríguez-Carbonell, and A. Rubio. The Barcelogic SMT solver. In CAV, pages 294-298, 2008.
6. C. Borralleras, S. Lucas, A. Oliveras, E. Rodríguez-Carbonell, and A. Rubio. SAT modulo linear arithmetic for solving polynomial constraints. J. Autom. Reasoning, 48(1):107-131, 2012.
7. J. R. Büchi and L. Landweber. Solving sequential conditions by finitestate strategies. Trans. Amer. Math. Soc., 138:295-311, 1969.
8. T. Cachat. Symbolic strategy synthesis for games on pushdown graphs. In ICALP, pages 704-715. 2002.
9. T. Cachat. Uniform solution of parity games on prefix-recognizable graphs. Electronic Notes in Theoretical Computer Science, 68(6):71-84, 2003.
10. K. Chatterjee and L. Doyen. Energy parity games. TCS, 2012.
11. B. Cook and E. Koskinen. Reasoning about nondeterminism in programs. In PLDI, 2013.
12. L. De Alfaro, T. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In CONCUR, pages 536-550. Springer, 2001.
13. L. M. de Moura and N. Bjørner. Z3: An efficient SMT solver. In TACAS, 2008.
14. E. A. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. In FOCS, pages 368-377. IEEE, 1991.
15. H. Fecher and M. Huth. Ranked predicate abstraction for branching time: Complete, incremental, and precise. In ATVA, pages 322-336. Springer, 2006.
16. H. Fecher and S. Shoham. Local abstraction-refinement for the-calculus. STTT, 13(4):289-306, 2011.
17. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In CAV, pages 53-65, 2001.
18. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, 2002.
19. S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko. HSF(C): A software verifier based on Horn clauses-(competition contribution). In TACAS, 2012.
20. S. Grebenshchikov, N. P. Lopes, C. Popeea, and A. Rybalchenko. Synthesizing software verifiers from proof rules. In PLDI, 2012.
21. A. Griesmayer, R. Bloem, and B. Cook. Repair of boolean programs with an application to C. In CAV, pages 358-371. Springer, 2006.
22. O. Grumberg, M. Lange, M. Leucker, and S. Shoham. Dont know in the-calculus. In VMCAI, pages 233-249, 2005.
23. O. Grumberg, M. Lange, M. Leucker, and S. Shoham. When not losing is better than winning: Abstraction and refinement for the full-calculus. Information and Computation, 205(8):1130-1148, 2007.
24. A. Gurfinkel and M. Chechik. Why waste a perfectly good abstraction? In TACAS, pages 212-226. 2006.
25. A. Harding, M. Ryan, and P.-Y. Schobbens. A new algorithm for strategy synthesis in ltl games. In TACASs, pages 477-492. Springer, 2005.
26. T. A. Henzinger, R. Jhala, and R. Majumdar. Counterexample-guided control. In ICALP, pages 886-902, 2003.
27. K. Hoder, N. Bjørner, and L. M. de Moura. Z-an efficient engine for fixed points with constraints. In CAV, pages 457-462, 2011.
28. A. J. C. Hurkens, C. A. J. Hurkens, and G. J. Woeginger. How Cinderella won the bucket game (and lived happily ever after). Mathematics Magazine, 84(4):pp. 278-283, 2011.
29. B. Jobstmann, A. Griesmayer, and R. Bloem. Program repair as a game. In CAV, pages 226-238, 2005.
30. M. Jurdziński. Small progress measures for solving parity games. In STACS, pages 290-301, 2000.
31. V. Kuncak, M. Mayer, R. Piskac, and P. Suter. Complete functional synthesis. In PLDI, 2010.
32. O. Kupferman and M. Y. Vardi. Robust satisfaction. In CONCUR, pages 383-398, 1999.
33. Z. Manna and A. Pnueli. Completing the temporal picture. Theor. Comput. Sci., 83(1):91-130, 1991.
34. Z. Manna and R. Waldinger. A deductive approach to program synthesis. TOPLAS, 2(1):90-121, 1980.
35. D. Martin. Borel determinacy. The Annals of Mathematics, 102(2): 363-371, 1975.
36. E.-R. Olderog and K. R. Apt. Fairness in parallel programs: The transformational approach. TOPLAS, 10(3), 1988.
37. N. Piterman, A. Pnueli, and Y. Saar. Synthesis of reactive(1) designs. In VMCAI, pages 364-380, 2006.
38. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL, pages 179-190. ACM, 1989.
39. A. Podelski and A. Rybalchenko. Transition invariants. In LICS, 2004.
40. M. Slanina. Control rules for reactive system games. In AAAI Spring Symposium on Logic-Based Program Synthesis, 2002.
41. A. Solar-Lezama, L. Tancau, R. Bodík, S. A. Seshia, and V. A. Saraswat. Combinatorial sketching for finite programs. In ASPLOS, pages 404-415, 2006.
42. S. Srivastava, S. Gulwani, and J. S. Foster. From program verification to program synthesis. In POPL, pages 313-326, 2010.
43. W. Thomas. On the synthesis of strategies in infinite games. In STACS, pages 1-13, 1995.
44. M. Y. Vardi. Verification of concurrent programs: The automatatheoretic framework. Ann. Pure Appl. Logic, 51(1-2):79-98, 1991.
45. M. T. Vechev, E. Yahav, and G. Yorsh. Abstraction-guided synthesis of synchronization. In POPL, 2010.
46. I. Walukiewicz. Pushdown processes: Games and model-checking. Information and computation, 164(2):234-263, 2001.
47. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200 (1):135-183, 1998.