BEGIN:VCALENDAR VERSION:2.0 PRODID:ILLC Website X-WR-TIMEZONE:Europe/Amsterdam BEGIN:VTIMEZONE TZID:Europe/Amsterdam X-LIC-LOCATION:Europe/Amsterdam BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:19700329T020000 RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:19701025T030000 RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU END:STANDARD END:VTIMEZONE BEGIN:VEVENT UID:/NewsandEvents/Archives/2006/newsitem/1401/3-7 -July-2006-Games-and-Verification-Cambridge-Englan d DTSTAMP:20060615T000000 SUMMARY:Games and Verification, Cambridge, England DTSTART;VALUE=DATE:20060703 DTEND;VALUE=DATE:20060707 LOCATION:Cambridge, England DESCRIPTION:Games are pervasive in the theory of c omputation. Traditionally, they have been used as tools for understanding definability in logic. Mor e generally, games are useful, as alternating auto mata, for solving a variety of algorithmic questio ns about finite and infinite state systems (such a s reachability and liveness properties). A third, and much more recent, use of games is the semantic s of programming languages, where the meaning of a program is defined in terms of winning strategies . This event will bring together researchers in th e several different areas in the theory of computa tion in which games play an important role. Thi s 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 Instit ute for Mathematical Sciences. For more informat ion, an online registration form and a preliminary program, see http://www.newton.cam.ac.uk/programm es/LAA/laaw06.html X-ALT-DESC;FMTTYPE=text/html:\n
\n Games are pervasive in the theory of\n comp utation. Traditionally, they have been used as too ls for\n understanding definability in logi c. More generally,\n games are useful, as a lternating automata, for solving a\n variet y of algorithmic questions about finite and infini te\n state systems (such as reachability an d liveness\n properties). A third, and much more recent, use of games is\n the semanti cs of programming languages, where\n the me aning of a program is defined in terms of winning strategies.\n This event will bring\n together researchers in the several different ar eas in the\n theory of computation in which games play an important role.\n
\n\n This workshop is the first annual mee ting of GAMES, a research\n training networ k funded by the European Community, and is part\n of the Spring 2006 program on Logic and Alg orithms at the\n Isaac Newton Institute for Mathematical Sciences.\n
\n \n < p>For more information, an online registration for m and\n a preliminary program, see\n http://www.newton. cam.ac.uk/programmes/LAA/laaw06.html\n p> URL:/NewsandEvents/Archives/2006/newsitem/1401/3-7 -July-2006-Games-and-Verification-Cambridge-Englan d END:VEVENT END:VCALENDAR