Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Watch a 25-minute conference presentation from POPL 2018 exploring the strategy synthesis problem for games defined within linear rational arithmetic theory. Discover how researchers from the University of Toronto and Princeton University tackle two key game types: satisfiability games involving quantified formula manipulation, and reachability games where players alternate choosing rational vector positions. Learn about a complete algorithm for synthesizing winning strategies in satisfiability games and a sound algorithm for reachability games. Delve into applications in formal methods, particularly program synthesis, where determining winning players and their strategies proves crucial. Understand how these games involve players taking turns to either instantiate quantifiers or choose positions, with objectives centered around proving formula satisfiability or reaching positions that limit opponent moves.
