Abstract
Many problems in formal methods can be formalized as two-player games. For several applications—program synthesis, for example—in addition to determining which player wins the game, we are interested in computing a winning strategy for that player. This paper studies the strategy synthesis problem for games defined within the theory of linear rational arithmetic. Two types of games are considered. A satisfiability game, described by a quantified formula, is played by two players that take turns instantiating quantifiers. The objective of each player is to prove (or disprove) satisfiability of the formula. A reachability game, described by a pair of formulas defining the legal moves of each player, is played by two players that take turns choosing positions—rational vectors of some fixed dimension. The objective of each player is to reach a position where the opposing player has no legal moves (or to play the game forever). We give a complete algorithm for synthesizing winning strategies for satisfiability games and a sound (but necessarily incomplete) algorithm for synthesizing winning strategies for reachability games.
Supplemental Material
Available for Download
This archive contains a virtual machine that can be used to reproduce the experimental result of the paper, as well as an extended version of the paper with proofs.
- Aws Albarghouthi, Isil Dillig, and Arie Gurfinkel. 2016. Maximal specification synthesis. In POPL. 789–801. Google Scholar
Digital Library
- Rajeev Alur, Rastislav Bodik, Garvit Juniwal, Milo MK Martin, Mukund Raghothaman, Sanjit A Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak, and Abhishek Udupa. 2013. Syntax-guided synthesis. In Formal Methods in Computer-Aided Design (FMCAD), 2013. IEEE, 1–8.Google Scholar
- Rajeev Alur, Salar Moarref, and Ufuk Topcu. 2016. Compositional Synthesis of Reactive Controllers for Multi-agent Systems. In CAV. 251–269. Google Scholar
Cross Ref
- Thomas Ball and Orna Kupferman. 2006. An abstraction-refinement framework for multi-agent systems. In LICS. IEEE, 379–388. Google Scholar
Digital Library
- Tewodros Beyene, Swarat Chaudhuri, Corneliu Popeea, and Andrey Rybalchenko. 2014. A Constraint-based Approach to Solving Games on Infinite Graphs. In POPL. 221–233. Google Scholar
Digital Library
- Tewodros A. Beyene, Corneliu Popeea, and Andrey Rybalchenko. 2013. Solving Existentially Quantified Horn Clauses. In CAV. 869–882. Google Scholar
Digital Library
- Nikolaj Bjørner and Mikolás Janota. 2015. Playing with Quantified Satisfaction. In LPAR - short presentations. 15–27.Google Scholar
- Régis Blanc, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. 2013. Tree Interpolation in Vampire. In LPAR-19. 173–181. Google Scholar
Cross Ref
- Marijke Bodlaender, Cor Hurkens, Vincent Kusters, Frank Staals, Gerhard Woeginger, and Hans Zantema. 2012. Cinderella versus the Wicked Stepmother. In IFIP TCS. 57–71. Google Scholar
Digital Library
- Thierry Cachat. 2002. Symbolic strategy synthesis for games on pushdown graphs. In ICALP. 704–715. Google Scholar
Cross Ref
- Thierry Cachat. 2003. Uniform solution of parity games on prefix-recognizable graphs. Electronic Notes in Theoretical Computer Science 68, 6 (2003), 71–84. Google Scholar
Cross Ref
- Byron Cook and Eric Koskinen. 2013. Reasoning about Nondeterminism in Programs. In PLDI. 219–230. Google Scholar
Digital Library
- Neil T. Dantam, Zachary K. Kingston, Swarat Chaudhuri, and Lydia E. Kavraki. 2016. Incremental Task and Motion Planning: A Constraint-Based Approach. In Robotics: Science and Systems XII, University of Michigan, Ann Arbor, Michigan, USA, June 18 - June 22, 2016. Google Scholar
Cross Ref
- Luca De Alfaro, Thomas Henzinger, and Rupak Majumdar. 2001. Symbolic algorithms for infinite-state games. In CONCUR. Springer, 536–550. Google Scholar
Cross Ref
- E. Allen Emerson and Charanjit Jutla. 1991. Tree automata, mu-calculus and determinacy. In FOCS. IEEE, 368–377. Google Scholar
Digital Library
- Azadeh Farzan and Zachary Kincaid. 2016. Linear Arithmetic Satisfiability via Strategy Improvement. In IJCAI. 735–743.Google Scholar
- Harald Fecher and Michael Huth. 2006. Ranked predicate abstraction for branching time: Complete, incremental, and precise. In ATVA. Springer, 322–336. Google Scholar
Digital Library
- Harald Fecher and Sharon Shoham. 2011. Local abstraction–refinement for the µ-calculus. STTT 13, 4 (2011), 289–306. Google Scholar
Digital Library
- Jeanne Ferrante and Charles Rackoff. 1975. A decision procedure for the first order theory of real addition with order. SIAM J. Comput. 4, 1 (1975), 69–76. Google Scholar
Cross Ref
- Michael J Fischer and Michael O Rabin. 1974. Super-Exponential Complexity of Presburger Arithmetic. Technical Report. Project MAC Mass. Inst. Of Tech.Google Scholar
- David Gale and Frank M Stewart. 1953. Infinite games with perfect information. Contributions to the Theory of Games 2 (1953), 245–266.Google Scholar
- Orna Grumberg, Martin Lange, Martin Leucker, and Sharon Shoham. 2005. Don’t know in the µ-calculus. In VMCAI. 233–249.Google Scholar
- Orna Grumberg, Martin Lange, Martin Leucker, and Sharon Shoham. 2007. When not losing is better than winning: Abstraction and refinement for the full µ-calculus. Information and Computation 205, 8 (2007), 1130–1148. Google Scholar
Digital Library
- Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko, and Ru-Gang Xu. 2008. Proving nontermination. In POPL. 147–158.Google Scholar
- Arie Gurfinkel and Marsha Chechik. 2006. Why waste a perfectly good abstraction? In TACAS. 212–226. Google Scholar
Digital Library
- Aidan Harding, Mark Ryan, and Pierre-Yves Schobbens. 2005. A new algorithm for strategy synthesis in LTL games. In TACASs. Springer, 477–492. Google Scholar
Digital Library
- Jaakko Hintikka. 1982. Game-theoretical semantics: insights and prospects. Notre Dame Journal of Formal Logic Notre-Dame, Ind. 23, 2 (1982), 219–241. Google Scholar
Cross Ref
- Antonius J. C. Hurkens, Cor A. J. Hurkens, and Gerhard J. Woeginger. 2011. How Cinderella Won the Bucket Game (and Lived Happily Ever After). Mathematics Magazine 84, 4 (2011), pp. 278–283. Google Scholar
Cross Ref
- Barbara Jobstmann, Andreas Griesmayer, and Roderick Bloem. 2005. Program Repair as a Game. In CAV. 226–238. Google Scholar
Digital Library
- Viktor Kuncak, Mikaël Mayer, Ruzica Piskac, and Philippe Suter. 2010. Complete functional synthesis. In PLDI. 316–329. Google Scholar
Digital Library
- Orna Kupferman and Moshe Y. Vardi. 1999. Robust satisfaction. In CONCUR. 383–398. Google Scholar
Cross Ref
- Zohar Manna and Richard Waldinger. 1980. A Deductive Approach to Program Synthesis. ACM Trans. Program. Lang. Syst. 2, 1 (Jan. 1980), 90–121. Google Scholar
Digital Library
- David Marker. 2000. Introduction to model theory. Model theory, algebra, and geometry 39 (2000), 15–35.Google Scholar
- Donald A. Martin. 1975. Borel Determinacy. Annals of Mathematics 102, 2 (1975), 363–371. Google Scholar
Cross Ref
- Kenneth McMillan. 2006. Lazy abstraction with interpolants. In CAV. 123–136. Google Scholar
Digital Library
- Kenneth McMillan and Andrey Rybalchenko. 2013. Solving Constrained Horn Clauses using Interpolation. Technical Report. MSR.Google Scholar
- Nir Piterman, Amir Pnueli, and Yaniv SaâĂŹar. 2006. Synthesis of reactive(1) designs. In VMCAI. 364–380.Google Scholar
- Amir Pnueli and Yonit Kesten. 2002. A Deductive Proof System for CTL*. In CONCUR. 24–40.Google Scholar
- Amir Pnueli and Roni Rosner. 1989. On the synthesis of a reactive module. In POPL. ACM, 179–190. Google Scholar
Digital Library
- Andrew Reynolds, Morgan Deters, Viktor Kuncak, Cesare Tinelli, and Clark W. Barrett. 2015. Counterexample-Guided Quantifier Instantiation for Synthesis in SMT. In CAV. 198–216. Google Scholar
Cross Ref
- Armando Solar-Lezama, Liviu Tancau, Rastislav Bodík, Sanjit A. Seshia, and Vijay A. Saraswat. 2006. Combinatorial sketching for finite programs. In ASPLOS. 404–415. Google Scholar
Digital Library
- Saurabh Srivastava, Sumit Gulwani, and Jeffrey S. Foster. 2010. From program verification to program synthesis. In POPL. 313–326. Google Scholar
Digital Library
- Saurabh Srivastava, Sumit Gulwani, and Jeffrey S. Foster. 2013. Template-based program verification and program synthesis. International Journal on Software Tools for Technology Transfer 15, 5 (01 Oct 2013), 497–518. Google Scholar
Digital Library
- Wolfgang Thomas. 1995. On the synthesis of strategies in infinite games. In STACS. 1–13. Google Scholar
Cross Ref
- Martin T. Vechev, Eran Yahav, and Greta Yorsh. 2010. Abstraction-guided synthesis of synchronization. In POPL. 327–338. Google Scholar
Digital Library
- Igor Walukiewicz. 2001. Pushdown processes: Games and model-checking. Information and computation 164, 2 (2001), 234–263. Google Scholar
Digital Library
Index Terms
Strategy synthesis for linear arithmetic games
Recommendations
A constraint-based approach to solving games on infinite graphs
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesWe present a constraint-based approach to computing winning strategies in two-player graph games over the state space of infinite-state programs. Such games have numerous applications in program verification and synthesis, including the synthesis of ...
A Scouting Strategy for Real-Time Strategy Games
IE2014: Proceedings of the 2014 Conference on Interactive EntertainmentReal-time strategy (RTS) is a sub-genre of strategy video games. RTS games are more realistic with dynamic and time-constraint game playing, by abandoning the turn-based rule of its ancestors. Playing with and against computer-controlled players is a ...
A constraint-based approach to solving games on infinite graphs
POPL '14We present a constraint-based approach to computing winning strategies in two-player graph games over the state space of infinite-state programs. Such games have numerous applications in program verification and synthesis, including the synthesis of ...






Comments