On this page:

• Link to Web Page
• Invited Speakers
• Invited Papers
• Presented Papers
• Short Presentations
• Organizers

Invited Speakers

• Samson Abramsky
  High-Level Methods for Quantum Computation and Information
• Robert Harper
  Self-Adjusting Computation
• Alexander A. Razborov
  Feasible Proofs and Computations: Partnership and Fusion
• Davide Sangiorgi
  Bisimulation: From The Origins to Today
• Igor Walukiewicz
  A Landscape with Games in the Background
• Mihalis Yannakakis
  Testing, Optimizaton, and Games

Invited Papers

• Samson Abramsky
  High-Level Methods for Quantum Computation and InformationMore Information...
• Robert Harper
  Self-Adjusting ComputationMore Information...
• Alexander A. Razborov
  Feasible Proofs and Computations: Partnership and FusionMore Information...
• Davide Sangiorgi
  Bisimulation: From The Origins to TodayMore Information...
• Igor Walukiewicz
  A Landscape with Games in the BackgroundMore Information...
• Mihalis Yannakakis
  Testing, Optimizaton, and GamesMore Information...

Presented Papers

Entries are ordered by surname of first author

• Parosh A. Abdulla Johann Deneux Pritha Mahata
  Multi-Clock Timed NetworksMore Information...
• Samson Abramsky Dan R. Ghica Andrzej S. Murawski C.-H. Luke Ong Ian D. B. Stark
  Nominal Games and Full Abstraction for the Nu-CalculusMore Information...
• Samson Abramsky Bob Coecke
  A Categorical Semantics of Quantum ProtocolsMore Information...
• Yohji Akama Stefano Berardi Susumu Hayashi Ulrich Kohlenbach
  An Arithmetical Hierarchy of the Law of Excluded Middle and Related PrinciplesMore Information...
• Patrick Baillot Kazushige Terui
  Light Types for Polynomial Time Computation in Lambda-CalculusMore Information...
• Michael Baldamus Joachim Parrow Björn Victor
  Spi Calculus Translated to π--Calculus Preserving May-TestsMore Information...
• Ulrich Berger
  A Computational Interpretation of Open InductionMore Information...
• Antonio Bucciarelli Antonino Salibra
  The Sensible Graph Theories of Lambda CalculusMore Information...
• Andrei A. Bulatov
  A Graph of a Relational Structure and Constraint Satisfaction ProblemsMore Information...
• Krishnendu Chatterjee Thomas A. Henzinger Marcin Jurdzinski
  Games with Secure EquilibriaMore Information...
• Stephen A. Cook Neil Thapen
  The Strength of Replacement in Weak ArithmeticMore Information...
• Stephen A. Cook Antonina Kolokolova
  A Second-Order Theory for NLMore Information...
• Víctor Dalmau Andrei A. Krokhin Benoit Larose
  First-Order Definable Retraction Problems for Posets and Reflexive GraphsMore Information...
• Dennis Dams Kedar S. Namjoshi
  The Existence of Finite Abstractions for Branching Time Model CheckingMore Information...
• Luca de Alfaro Patrice Godefroid Radha Jagadeesan
  Three-Valued Abstractions of Games: Uncertainty, but with PrecisionMore Information...
• Philippe de Groote Bruno Guillaume Sylvain Salvati
  Vector Addition Tree AutomataMore Information...
• Brian Dunphy Uday S. Reddy
  Parametric LimitsMore Information...
• Javier Esparza Antonín Kučera Richard Mayr
  Model Checking Probabilistic Pushdown AutomataMore Information...
• Jörg Flum Martin Grohe
  Model-Checking Problems as a Basis for Parameterized IntractabilityMore Information...
• Carsten Führmann David J. Pym
  On the Geometry of Interaction for Classical LogicMore Information...
• Murdoch Gabbay James Cheney
  A Sequent Calculus for Nominal LogicMore Information...
• Martin Grohe Nicole Schweikardt
  The Succinctness of First-Order Logic on Linear OrdersMore Information...
• Michael Huth
  Beyond Image-Finiteness: Labelled Transition Systems as a Stone SpaceMore Information...
• Benedetto Intrigila Richard Statman
  The Omega Rule is II_2^0-Hard in the λβ-CalculusMore Information...
• Bakhadyr Khoussainov André Nies Sasha Rubin Frank Stephan
  Automatic Structures: Richness and LimitationsMore Information...
• Felix Klaedtke
  On the Automata Size for Presburger ArithmeticMore Information...
• Louis Latour
  From Automata to Formulas: Convex Integer PolyhedraMore Information...
• Daniel Leivant
  Proving Termination Assertions in Dynamic LogicsMore Information...
• Kerkko Luosto
  Equicardinality on Linear OrdersMore Information...
• J. Raymundo Marcial-Romero Martín H. Escardó
  Semantics of a Sequential Language for Exact Real-Number ComputationMore Information...
• Mohammad R. Mousavi Michel A. Reniers Jan F. Groote
  Congruence for SOS with DataMore Information...
• Tom Murphy VII Karl Crary Robert Harper Frank Pfenning
  A Symmetric Modal Lambda Calculus for Distributed ComputingMore Information...
• David A. Naumann Michael Barnett
  Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable StateMore Information...
• Phuong Nguyen Stephen A. Cook
  VTC⁰: A Second-Order Theory for TC⁰More Information...
• Gustav Nordh Peter Jonsson
  An Algebraic Approach to the Complexity of Propositional CircumscriptionMore Information...
• Joël Ouaknine James Worrell
  On the Language Inclusion Problem for Timed Automata: Closing a Decidability GapMore Information...
• Andreas Podelski Andrey Rybalchenko
  Transition InvariantsMore Information...
• Sanjit A. Seshia Randal E. Bryant
  Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution BoundsMore Information...
• Kazushige Terui
  Proof Nets and Boolean CircuitsMore Information...
• Stefan Wöhrle Wolfgang Thomas
  Model Checking Synchronized Products of Infinite Transition SystemsMore Information...

Short Presentations

Entries are ordered by surname of first author

• Miguel Couceiro Stephan Foldes
  On Definability of Function Classes by Relational Constraints and Corresponding Galois ConnectionsMore Information...
• Ugo Dal Lago
  The Geometry of Linear Ramified RecurrenceMore Information...
• Anuj Dawar Lauri Hella Mikko Suonio
  On Abiteboul-Vianu Theorem for Fixed-Point Logics with Generalized QuantifiersMore Information...
• Claudia Faggian Francois Maurel
  Ludics on Graphs. Towards ConcurrencyMore Information...
• Richard McKinley
  Categorical Models of First-Order Classical Sequent ProofsMore Information...
• Ahti-Veikko Pietarinen
  Epistemic Logics of Imperfect Information for Multi-agent CommunicationMore Information...
• Alexis Saurin
  Separation and the Lambdamu-CalculusMore Information...
• Roger Villemaire
  Lazy Structure Preserving Translation of Boolean Expressions into CNFMore Information...

Organizers

General Chair Phokion G. Kolaitis (University of California at Santa Cruz) Program Chair Harald Ganzinger (MPI, Saarbruecken) Conference Chair Lauri Hella (University of Tampere) Publicity Chair Alex K. Simpson (University of Edinburgh) Workshops Chair Phil J. Scott (University of Ottawa)

Program Committee: Rajeev Alur (University of Pennsylvania); Andrew W. Appel (Princeton University); Albert Atserias (UPC, Barcelona); Franz Baader (Dresden University); Samuel R. Buss (University of California, San Diego); Roberto Di Cosmo (Universite de Paris VII); Gilles Dowek (Ecole Polytechnique, Paris); Harald Ganzinger (MPI, Saarbruecken) (chair); Martin Hofmann (LMU Muenchen); Achim Jung (University of Birmingham); Kim G. Larsen (Aalborg University); Leonid Libkin (University of Toronto); Rocco De Nicola (Università di Firenze); Damian Niwinski (Warsaw University); Prakash Panangaden (McGill University, Montreal); Albert Rubio (UPC, Barcelona); Vitaly Shmatikov (SRI International); Moshe Y. Vardi (Rice University, Houston); Helmut Veith (TU Wien); Andrei Voronkov (University of Manchester) Organizing Committee Samson Abramsky; Andrei Z. Broder; Edmund M. Clarke; Amy Felty; Ulrich Furbach; Harold N. Gabow; Harald Ganzinger; Joseph Y. Halpern; Lauri Hella; Ulrich Kohlenbach; Phokion G. Kolaitis (chair); Harry G. Mairson; Aart Middeldorp; John C. Mitchell; Mogens Nielsen; Prakash Panangaden; Gordon D. Plotkin; Philip J. Scott; Richard A. Shore; Alex K. Simpson; Iain A. Stewart Advisory Board Robert L. Constable; Yuri Gurevich; Claude Kirchner; Dexter C. Kozen; Ursula Martin; Albert R. Meyer; Leszek Pacholski; Vaughan R. Pratt; Andre Scedrov; Moshe Y. Vardi; Glynn Winskel