*** TUESDAY, JULY 13 ***

SESSION 1

14:00 Stefan Woehrle and Wolfgang Thomas.
      Model Checking Synchronized Products of Infinite Transition Systems
14:30 Javier Esparza, Antonin Kucera and Richard Mayr.
      Model-Checking Probabilistic Pushdown Automata
15:00 Michael Baldamus, Joachim Parrow and Bjoern Victor. 
      Spi Calculus Translated to pi-Calculus Preserving May-Tests
15:30 Andreas Podelski and Andrey Rybalchenko.
      Transition Invariants

SESSION 2

16:30 Sasha Rubin, Bakhadyr Khoussainov, Andre Nies and Frank Stephan.
      Automatic Structures: Richness and Limitation 
17:00 Joel Ouaknine and James Worrell. 
      On the Language Inclusion Problem for Timed Automata: 
      Closing a Decidability Gap
17:30 Philippe de Groote, Bruno Guillaume and Sylvain Salvati.
      Vector Addition Tree Automata

SESSION 3 (Short Presentations)

18:15 Richard McKinley. 
      Categorical models of first-order classical sequent proofs
18:25 Roger Villemaire. 
      Lazy structure preserving translation of boolean 
      expressions into CNF
18:35 Miguel Couceiro and Stephan Foldes. 
      On Definability of Function Classes by Relational 
      Constraints and Corresponding Galois Connections
18:45 Anuj Dawar, Lauri Hella and Mikko Suonio.
      On Abiteboul-Vianu theorem for fixed-point logics 
      with generalized quantifiers
18:55 Claudia Faggian and Francois Maurel. 
      Ludics on graphs. Towards concurrency
19:05 Ugo Dal Lago. 
      The Geometry of Linear Ramified Recurrence
19:15 Alexis Saurin.
      Separation and the Lambdamu-calculus
19:25 Ahti-Veikko Pietarinen.
      Epistemic Logics of Imperfect Information for Multi-agent
      Communication

*** WEDNESDAY, JULY 14 ***

SESSION 4

 9:00 Mihalis Yannakakis (Joint Invited Lecture)
      Testing, Optimization, and Games
10:00 Daniel Leivant. 
      Proving Termination Assertions in Dynamic Logics

SESSION 5

11:00 Sanjit Seshia and Randal Bryant. 
      Deciding Quantifier-Free Presburger Formulas using 
      Parameterized Solution Bounds
11:30 Felix Klaedtke. 
      On the Automata Size for Presburger Arithmetic
12:00 Louis Latour.
      From Automata to Formulas: Convex Integer Polyhedra

SESSION 6 (Award Ceremonies)

*** THURSDAY, JULY 15 ***

SESSION 7

 9:00 Alexander Razborov (Joint Invited Lecture)
      Feasible Proofs and Computations: Partnership and Fusion
10:00 James Cheney and Murdoch Gabbay. 
      A Sequent Calculus for Nominal Logic

SESSION 8

11:00 Samson Abramsky, Dan Ghica, Andrzej Murawski, Luke Ong and Ian Stark.
      Nominal Games and Full Abstraction for the Nu-Calculus
11:30 Krishnendu Chatterjee, Thomas A. Henzinger and Marcin Jurdzinski.
      Games with Secure Equilibria
12:00 Luca de Alfaro, Patrice Godefroid and Radha Jagadeesan. 
      Three-Valued Abstractions of Games: Uncertainty, but with Precision

SESSION 9

14:00 Kazushige Terui.
      Proof Nets and Boolean Circuits
14:30 Yohji Akama, Stefano Berardi, Susumu Hayashi and Ulrich Kohlenbach. 
      An Arithmetical Hierarchy of the Laws of Excluded 
      Middle and Related Principles
15:00 Benedetto Intrigila and Rick Statman. 
      The Omega Rule is $\Pi^{0}_{2} $-Hard in the $\lambda\beta $-Calculus
15:30 Carsten Fuhrmann and David J. Pym.
      On the Geometry of Interaction for Classical Logic

SESSION 10

16:30 Michael Huth.
      Beyond Image-Finiteness: Labelled Transition Systems as a Stone Space
17:00 Victor Dalmau, Andrei Krokhin and Benoit Larose. 
      First-order Definable Retraction Problems for Posets and 
      Reflexive Graphs
17:30 Brian P. Dunphy and Uday S. Reddy.
      Parametric Limits

*** FRIDAY, JULY 16 ***

SESSION 11

 9:00 Robert Harper (Joint Invited Lecture)
      Self-Adjusting Computation
10:00 Stephen Cook and Neil Thapen.
      The Strength of Replacement in Weak Arithmetic

SESSION 12

11:00 Patrick Baillot and Kazushige Terui.
      Light Types for Polynomial Time Computation in Lambda Calculus
11:30 Antonio Bucciarelli and Antonino Salibra.
      The Sensible Graph Theories of Lambda Calculus
12:00 Tom Murphy VII, Karl Crary, Robert Harper and Frank Pfenning. 
      A Symmetric Modal Lambda Calculus for Distributed Computing

SESSION 13

14:00 Davide Sangiorgi (Invited Lecture)
      Bisimulation and coinduction: from the origins to today
15:00 Mohammad Reza Mousavi, Michel A. Reniers and Jan Friso Groote. 
      Congruence for SOS with Data
15:30 David A Naumann and Mike Barnett.
      Towards Imperative Modules: Reasoning About 
      Invariants and Sharing of Mutable State 

SESSION 14

16:30 Ulrich Berger. 
      A Computational Interpretation of Open Induction
17:00 Dennis Dams and Kedar Namjoshi.
      The Existence of Finite Abstractions for Branching Time Model Checking 
17:30 Parosh Aziz Abdulla, Johann Deneux and Pritha Mahata.
      Multi-Clock Timed Networks

*** SATURDAY, July 17 ***

SESSION 15

 9:00 Igor Walukiewicz (Invited Lecture)
      A landscape with games in the background
10:00 Gustav Nordh and Peter Jonsson.
      An Algebraic Approach to the Complexity of 
      Propositional Circumscription

SESSION 16

11:00 Phuong Nguyen and Stephen Cook.
      VTC0: A Second-Order Theory for TC0
11:30 Joerg Flum and Martin Grohe. 
      Model-Checking Problems as a Basis for Parameterized Intractability
12:00 Stephen Cook and Antonina Kolokolova.
      A Second-Order Theory for NL

SESSION 17

14:00 Samson Abramsky (Invited Lecture)
      Information is physical, but physics is logical!
15:00 Samson Abramsky and Bob Coecke.
      A Categorical Semantics of Quantum Protocols
15:30 Jose Raymundo Marcial-Romero and Martin Hotzel Escardo.
      Semantics of a Sequential Language for Exact Real Number Computation 

SESSION 18

16:30 Martin Grohe and Nicole Schweikardt. 
      The Succinctness of First-Order Logic on Linear Orders
17:00 Andrei Bulatov. 
      A Graph of a Relational Structure and Constraint Satisfaction Problems
17:30 Kerkko Luosto. 
      Equicardinality on Linear Orders