News and Events: Conferences

Please note that this newsitem has been archived, and may contain outdated information or links.

3-7 July 2006, Games and Verification, Cambridge, England

Date: 3-7 July 2006
Location: Cambridge, England

Games are pervasive in the theory of computation. Traditionally, they have been used as tools for understanding definability in logic. More generally, games are useful, as alternating automata, for solving a variety of algorithmic questions about finite and infinite state systems (such as reachability and liveness properties). A third, and much more recent, use of games is the semantics of programming languages, where the meaning of a program is defined in terms of winning strategies. This event will bring together researchers in the several different areas in the theory of computation in which games play an important role.

This workshop is the first annual meeting of GAMES, a research training network funded by the European Community, and is part of the Spring 2006 program on Logic and Algorithms at the Isaac Newton Institute for Mathematical Sciences.

For more information, an online registration form and a preliminary program, see http://www.newton.cam.ac.uk/programmes/LAA/laaw06.html

Please note that this newsitem has been archived, and may contain outdated information or links.