Workshop Programme
for period 3-7 July
Games and Verification
3-7 July
Timetable
| Monday 03 July |
| 08:30-09:00 |
Registration |
LAA |
| 09:00-10:25 |
van Benthem, J (Stanford and Amsterdam) |
LAA |
| |
Dynamic-epistemic logic of games | Sem 1 |
| 10:30-10:45 |
Kaiser, L (RWTH Aachen) |
LAA |
| |
Game quantification on automatic structures and hierarchical games | Sem 1 |
| 11:00-11:30 |
Coffee |
LAA |
| 11:30-12:00 |
Duparc, J (Universite de Lausanne) |
LAA |
| |
Towards the Wadge hierarchy of weak alternating tree automata | Sem 1 |
| 12:00-12:30 |
Obdrzalek, J (Masaryk University, Brno) |
LAA |
| |
Are parity games spineless? | Sem 1 |
| 12:30-13:30 |
Lunch at Wolfson Court |
LAA |
| 14:00-14:30 |
Colcombet, T (IRISA) |
LAA |
| |
Ramseyan factorisation for trees | Sem 1 |
| 14:30-14:45 |
Samuelides, M (Universite Denis Diderot) |
LAA |
| |
Pebble tree-walking automata | Sem 1 |
| 14:45-15:00 |
Barany, V (RWTH Aachen) |
LAA |
| |
A hierachy of automatically presentable omega-words having a decidable MSO theory | Sem 1 |
| 15:00-15:30 |
Tea |
LAA |
| 15:30-16:00 |
Janin, D (Universite Bordeaux-1) |
LAA |
| |
On distributed synthesis of discrete systems | Sem 1 |
| 16:00-16:30 |
Esparza, J (Universitaet Stuttgart) |
LAA |
| |
Solving fixpoint equations in omega-continuous semirings: Some ideas and many questions | Sem 1 |
| 16:30-17:00 |
Immerman, N (Massachusetts) |
LAA |
| |
On size versus number of variables | Sem 1 |
| 17:00-18:00 |
Wine reception |
LAA |
| Thursday 06 July |
| 09:00-10:25 |
Alur, R (Pennsylvania) |
LAA |
| |
Nested words and trees | Sem 1 |
| 10:30-11:00 |
Murawski, A (Oxford) |
LAA |
| |
Game semantics and automata | Sem 1 |
| 11:00-11:30 |
Coffee |
LAA |
| 11:30-12:00 |
Touili, T (LIAFA - Universite Paris 7) |
LAA |
| |
Verifying concurrent message-passing C programs with recursive calls | Sem 1 |
| 12:00-12:15 |
Rozier, K (Rice) |
LAA |
| |
Algorithms for automata-theoretic linear temporal logic model checking | Sem 1 |
| 12:15-12:30 |
Tabakov, D (Rice) |
LAA |
| |
Experimental evaluation of complementation of non-deterministic Buechi automata | Sem 1 |
| 12:30-13:30 |
Lunch at Wolfson Court |
LAA |
| 14:00-14:30 |
Jurdzinski, M (Warwick) |
LAA |
| |
Optimality equations and strategy improvement for average payoff games | Sem 1 |
| 14:30-14:45 |
Trivedi, A (Warwick) |
LAA |
| |
A strategy improvement algorithm for optimal time reachability games | Sem 1 |
| 14:45-15:00 |
Krcal, P (Uppsala) |
LAA |
| |
Communicating timed automata | Sem 1 |
| 15:00-15:30 |
Tea |
LAA |
| 15:30-16:00 |
Jonsson, B (Uppsala) |
LAA |
| |
Proving liveness by backwards reachability | Sem 1 |
| 16:00-16:30 |
Lange, M (Munich) |
LAA |
| |
Model checking games for fixpoint logic with Chop | Sem 1 |
| 16:30-17:00 |
GAMES Coordinator's Report |
LAA |
| 17:00-18:00 |
Panel discusssion: The future of GAMES |
LAA |
| 19:30-23:00 |
Conference Dinner, Emmanuel College (Old Library) |
LAA |
