We have been made aware of a convincing email scam that is focusing on our Programme and Workshop participants. Participants may receive an email from a firm called Expo Hotel Services (ehotelservices.org) to arrange accommodation for workshops and/or programmes. This might include a request to provide them with credit card information.
Please note, INI will never ask for your card details. We take all payments via the University of Cambridge Online store https://onlinesales.admin.cam.ac.uk/.
If you have been contacted by this company please contact us as soon as possible.
Workshop theme
Games are pervasive in the theory of computation. Traditionally, they have been used as tools for understanding definability in logic. For example, in the case of finite model theory they provide a mechanism for showing that certain properties are not definable in enrichments of first-order logic that are computationally interesting. A second role is that important algorithmic questions can be couched in terms of games. For instance, model checking properties expressible in modal logic with fixed points is equivalent to deciding which player has a winning strategy in a simple two-player game, the parity game. The exact complexity of this model checking problem is a long standing open problem, and games may help to solve it. In fact 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. The idea is that the meaning of a program is defined in terms of winning strategies. What is particularly exciting about this approach is that such a semantics is exact in the sense that it is fully abstract.
The aim of the conference is to bring together researchers who work in these different areas. In one direction, there is strong interest amongst the semanticists in understanding algorithmic properties of games in the semantics of programming languages. Researchers have examined fragments of Idealized Algol and shown that program equivalence is decidable by reducing it to equivalent decidable automata theoretic problems. In the opposite direciton, there is also strong interest amongst the model checking community to be able to cope with more realistic models of programs than classical automata. The meeting will begin with a number of invited tutorials covering the relevant areas before the more specialist contributed talks.
The conference is also the final annual meeting of GAMES, a research training network funded by the European Community under the Fifth Framework Programme.
Invited Tutorials:
- Rajeev Alur (U. of Pennsylvania) - Pushdown games
- Johan van Bentham (U. of Amsterdam) - Dynamic-Epistemic Logic of Games
- Didier Caucal (IRISA-CNRS) - Deterministic grammars
- Georg Gottlob (U. of Oxford) - Hypertree decompositions
- Dov Monderer (Technion) - Mechanism design
- Moshe Vardi (Rice U) - Games as an algorithmic construct
Speakers
- Rajeev Alur University of Pennsylvania
- Krzysztof Apt Centrum voor Wiskunde en Informatica (CWI)
- Vince Barany RWTH Aachen University
- Dietmar Berwanger Université Bordeaux 1
- Didier Caucal
- Thomas Colcombet
- Jacques Duparc Université de Lausanne
- Javier Esparza Universität Stuttgart
- Kousha Etessami University of Edinburgh
- Sibylle Fröschle
- Hugo Gimbert
- Georg Gottlob University of Oxford
- Florian Horn
- Neil Immerman University of Massachusetts
- David Janin
- Bengt Jonsson
- Marcin Jurdzinski University of Warwick
- Lukasz Kaiser RWTH Aachen University
- Pavel Krcal
- Martin Lange
- Slawomir Lasota
- Ranko Lazic University of Warwick
- Dov Monderer Technion - Israel Institute of Technology
- Andrzej Murawski University of Oxford
- Jan Obdrzalek
- Kristin Rozier Rice University
- Mathias Samuelides Université Denis Diderot
- Deian Tabakov Rice University
- Tayssir Touili
- Ashutosh Trivedi University of Warwick
- Johan van Benthem University of Helsinki
- Moshe Vardi Rice University
- Yde Venema University of Helsinki
- Sergei Vorobyov
- Igor Walukiewicz
- Wieslaw Zielonka
Supported By
