Scientific Organisers:

• Anuj Dawar, University of Cambridge

• Kousha Etessami, University of Edinburgh

• Moshe Vardi, Rice University
  

Scientific Advisory Committee

• Andrei Bulatov, Simon Fraser University

• Javier Esparza, Technical University

• Erich Grädel, Aachen University

• Phokion Kolaitis, IBM
  

• Andrei Krokhin, Durham University

• Orna Kupferman, Hebrew University

• Leonid Libkin, University of Edinburgh

• Luke Ong, University of Oxford

Speakers:

• Rajeev Alur, University of Pennsylvania - Marrying Words and Trees

• Mikolaj Bojanczyk, Warsaw University - Tree Languages Defined by Formulas with One Quantifier Alternation

• Balder ten Cate, University of Amsterdam - XPath, Tree Walking Automata and Transitive Closure Logic 

• Andreas Podelski, University of Freiburg - Constraints in Verification

• Alexander Malkis, University of Freiburg - Precise Thread-Modular Verification

• Achim Blumensath, Technische Universität Darmstadt - The Interpretation Hierarchy for Guarded Second-Order Logic

• Joel Ouaknine, University of Oxford - On Termination of Linear Programs and the Skolem Problem

• Albert Atserias, UPC - Finite Model Theory for Constraint Satisfaction Problems and Back

• Hubie Chen, Universitat Pompeu Fabra - Quantifying Chandra-Merlin 

• Andrei Krokhin, Durham University - Hard CSPs Have Hard Gaps at Location 1 

• Paul Gastin, École Normale Supérieure de Cachan - Distributed Timed Automata with Independently Evolving Clocks

• Stefan Göller, University of Leipzig - ICPDL with Fixed Points and Nominals

• Michael Luttenberger, Technical University of Munich - Derivation Tree Analysis for Accelerated Fixed-Point Computation

• Pascal Tesson, University of Laval - Towards a Refinement of the Complexity Classification of CSPs

• Martin Otto, Technische Universität Darmstadt - Bisimulation Invariance Over Classes of Transitive Frames 

• Wolfgang Thomas, RWTH - Facets of Strategy Synthesis in Infinite Games 

• Thomas Wilke, Christian-Albrechts-Universität - Complementation, Disambiguation and Determinization of Büchi Automata 

• Stefan Kiefer, Technische Universität München - Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations 

• Phokion Kolaitis, IBM - Foundations and Applications of Schema Mappings

• Benjamin Rossman, Massachusetts Institute of Technology - The First-Order Variable Hierarchy on Finite Ordered Structures 

• Philipp Weis, University of Massachusetts - Lower Bounds for Formula Size 

• Tony Kucera, Masaryk University - On the Satisfiability Problem for Probabilistic CTL

• Marta Kwiatkowska, University of Oxford - Game-Based Abstraction-Refinement Framework for Probabilistic Processes

• Dominik Wojtczack, University of Edinburgh - Automated Analysis of Probabilistic Recursive Models

• Wouter Gelade, Hasselt University - XML Schema Languages and Succinctness of Regular Expressions 

• Jacques Duparc, University of Lausanne - On the Non-Borel Mu-Calculus Formulae

• Yehuda Naveh, IBM - Advances in Constraint Satisfaction for Stimuli Generation for Functional Hardware Verification

• Martin Grohe, Humboldt University - Algorithmic and Finite Model Theory

• Stephan Kreutzer, University of Oxford - Computing Excluded Minors 

• Marcin Jurdzinski, University of Warwick - A Simple P-Matrix Linear Complementarity Problem for Discounted Games

• Patrice Ossona de Mendez, CNRS - Nowhere Dense Structures, Theory and Implications

• Jaroslav Nesetril, Charles University - Many Facets of Dualities (FO and CSP Context)

Additional support was provided by the Isaac Newton Institute and the Laboratory for Foundations of Computer Science.