Speakers

Rajeev Alur, University of Pennsylvania - Marrying Words and Trees

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

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

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  

Hubie Chen, Universitat Pompeu Fabra - Quantifying Chandra-Merlin  

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

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

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

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

Martin Grohe, Humboldt University - Algorithmic and Finite Model Theory

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

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

Stephan Kreutzer, University of Oxford - Computing Excluded Minors 

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

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

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

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

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

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

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

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

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

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

Andreas Podelski, University of Freiburg - Constraints in Verification

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

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

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

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

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

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