On this page:

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

Invited Speakers

• Christel Baier
  Trade-off analysis meets probabilistic model checking
• Patrick Cousot
  Abstract interpretation: past, present and future
• Jasmin Fisher
  Understanding biology through logic (tutorial)
• Assia Mahboubi
  Computer-checked mathematics: a formal proof of the odd order theorem (tutorial)

Invited Papers

• Christel Baier Clemens Dubslaff Sascha Klüppelholz
  Trade-off analysis meets probabilistic model checkingMore Information...
• Patrick Cousot Radhia Cousot
  Abstract interpretation: past, present and futureMore Information...
• Jasmin Fisher
  Understanding biology through logicMore Information...
• Assia Mahboubi
  Computer-checked mathematics: a formal proof of the odd order theoremMore Information...

Presented Papers

Entries are ordered by surname of first author

• Parosh A. Abdulla Mohamed Faouzi Atig Piotr Hofman Richard Mayr K. Narayan Kumar Patrick Totzke
  Infinite-state energy gamesMore Information...
• Beniamino Accattoli Ugo Dal Lago
  Beta reduction is invariant, indeedMore Information...
• Rajeev Alur Adam Freilich Mukund Raghothaman
  Regular combinators for string transformationsMore Information...
• Eugene Asarin Michel Blockelet Aldric Degorre Catalin Dima Chunyan Mu
  Asymptotic behaviour in temporal logicMore Information...
• Christel Baier Joachim Klein Sascha Klüppelholz Sascha Wunderlich
  Weight monitoring with linear temporal logic: complexity and decidabilityMore Information...
• Pablo Barceló Pablo Muñoz
  Graph logics with rational relations: the role of word combinatoricsMore Information...
• Michael Benedikt Balder ten Cate Michael Vanden Boom
  Effective interpolation and preservation in guarded logicsMore Information...
• Marco Bernardo Davide Sangiorgi Valeria Vignudelli
  On the discriminating power of passivation and higher-order interactionMore Information...
• Paul Bilokon Abbas Edalat
  A domain-theoretic approach to Brownian motion and general continuous stochastic processesMore Information...
• Achim Blumensath Thomas Colcombet Denis Kuperberg Pawel Parys Michael Vanden Boom
  Two-way cost automata and cost logics over infinite treesMore Information...
• Mikołaj Bojańczyk Christoph Dittmann Stephan Kreutzer
  Decomposition theorems and model-checking for the modal μ-calculusMore Information...
• Benedikt Bollig
  Logic for communicating automata with parameterized topologyMore Information...
• Benedikt Bollig Paul Gastin Benjamin Monmege Marc Zeitoun
  Logical characterization of weighted pebble walking automataMore Information...
• Filippo Bonchi Daniela Petrisan Damien Pous Jurriaan Rot
  Coinduction up-to in a fibrational settingMore Information...
• Simone Bova Robert Ganian Stefan Szeider
  Model checking existential logic on partially ordered setsMore Information...
• Tomáš Brázdil Stefan Kiefer Antonín Kučera Petr Novotný Joost-Pieter Katoen
  Zero-reachability in probabilistic multi-counter automataMore Information...
• Romain Brenguier Jean-François Raskin Mathieu Sassolas
  The complexity of admissibility in Omega-regular gamesMore Information...
• Flavien Breuvart
  On the characterization of models of HMore Information...
• James Brotherston Carsten Fuhs Juan A. Navarro Pérez Nikos Gorogiannis
  A decision procedure for satisfiability in separation logic with inductive predicatesMore Information...
• Véronique Bruyére Noémie Meunier Jean-François Raskin
  Secure equilibria in weighted gamesMore Information...
• Facundo Carreiro Alessandro Facchini Yde Venema Fabio Zanasi
  Weak MSO: automata and expressiveness modulo bisimilarityMore Information...
• Simon Castellan Pierre Clairambault Glynn Winskel
  Symmetry in concurrent gamesMore Information...
• Witold Charatonik Emanuel Kieronski Filip Mazowiecki
  Decidability of weak logics with deterministic transitive closureMore Information...
• Kaustuv Chaudhuri Nicolas Guenot
  Equality and fixpoints in the calculus of structuresMore Information...
• Hubie Chen
  The tractability frontier of graph-like first-order query setsMore Information...
• Hubie Chen Moritz Müller
  One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queriesMore Information...
• Taolue Chen Stefan Kiefer
  On the total variation distance of labelled Markov chainsMore Information...
• Julien Cretin Didier Rémy
  System F with coercion constraintsMore Information...
• Ugo Dal Lago Claudia Faggian Ichiro Hasuo Akira Yoshimizu
  The geometry of synchronizationMore Information...
• Anupam Das
  On the pigeonhole and related principles in deep inference and monotone systemsMore Information...
• Stéphane Demri Morgan Deters
  Expressive completeness of separation logic with two variables and no separating conjunctionMore Information...
• Thomas Ehrhard
  A new correctness criterion for MLL proof netsMore Information...
• Jörg Endrullis Dimitri Hendriks
  On periodically iterated morphismsMore Information...
• Diego Figueira Leonid Libkin
  Pattern logics and auxiliary relationsMore Information...
• Marcelo P. Fiore Sam Staton
  Substitution, jumps, and algebraic effectsMore Information...
• Matthew Fredrikson Somesh Jha
  Satisfiability modulo counting: a new approach for analyzing privacy propertiesMore Information...
• Georg Gottlob Enrico Malizia
  Achieving new upper bounds for the hypergraph duality problem through logicMore Information...
• Niels Bjørn Bugge Grathwohl Dexter Kozen Konstantinos Mamouras
  KAT + B!More Information...
• Nicolas Guenot Lutz Straßburger
  Symmetric normalisation for intuitionistic logicMore Information...
• Julian Gutierrez Michael Wooldridge
  Equilibria of concurrent games on event structuresMore Information...
• Christoph Haase
  Subclasses of presburger arithmetic and the weak EXP hierarchyMore Information...
• Matthew Hague
  Senescent ground tree rewrite systemsMore Information...
• Frederik Harwath Lucas Heimberg Nicole Schweikardt
  Preservation and decomposition theorems for bounded degree structuresMore Information...
• Willem Heijltjes Robin Houston
  No proof nets for MLL with units: proof equivalence in MLL is PSPACE-completeMore Information...
• Martin Hofmann Wei Chen
  Abstract interpretation from Büchi automataMore Information...
• Naohiko Hoshino Koko Muroya Ichiro Hasuo
  Memoryful geometry of interaction: from coalgebraic components to algebraic effectsMore Information...
• Danko Ilik
  Axioms and decidability for type isomorphism in the presence of sumsMore Information...
• Alan Jeffrey
  Functional reactive typesMore Information...
• Joost-Pieter Katoen Lei Song Lijun Zhang
  Probably safe or liveMore Information...
• Bakhadyr Khoussainov
  A quest for algorithmically random infinite structuresMore Information...
• Stanislav Kikot Roman Kontchakov Vladimir V. Podolskii Michael Zakharyaschev
  On the succinctness of query rewriting over shallow ontologiesMore Information...
• Bartek Klin Sławomir Lasota Joanna Ochremiak Szymon Toruńczyk
  Turing machines with atoms, constraint satisfaction problems, and descriptive complexityMore Information...
• Eric Koskinen Tachio Terauchi
  Local temporal reasoningMore Information...
• Stephan Kreutzer Nicole Schweikardt
  On Hanf-equivalence and the number of embeddings of small induced subgraphsMore Information...
• Ranko Lazic Sylvain Schmitz
  Non-elementary complexities for branching VASS, MELL, and extensionsMore Information...
• Jérôme Leroux M. Praveen Grégoire Sutre
  Hyper-Ackermannian bounds for pushdown vector addition systemsMore Information...
• Paul Blain Levy Sam Staton
  Transition systems over gamesMore Information...
• Hongjin Liang Xinyu Feng Zhong Shao
  Compositional verification of termination-preserving refinement of concurrent programsMore Information...
• Daniel R. Licata Eric Finster
  Eilenberg-MacLane spaces in homotopy type theoryMore Information...
• Katja Losemann Wim Martens
  MSO queries on trees: enumerating answers under updatesMore Information...
• Marcello Mamino
  On the computing power of +, -, and ×More Information...
• Konstantinos Mamouras
  On the Hoare theory of monadic recursion schemesMore Information...
• Grgur Petric Maretic Mohammad Torabi Dashti David A. Basin
  Anchored LTL separationMore Information...
• Rasmus E. Møgelberg
  A type theory for productive coprogramming via guarded recursionMore Information...
• Guillaume Munch-Maccagnoni
  Formulae-as-types for an involutive negationMore Information...
• Luca Padovani
  Deadlock and lock freedom in the linear λ-calculusMore Information...
• Pierre-Marie Pédrot
  A functional functional interpretationMore Information...
• Matthieu Perrinel
  On context semantics and interaction netsMore Information...
• Thomas Place Marc Zeitoun
  Separating regular languages with first-order logicMore Information...
• Ian Pratt-Hartmann
  Logics with counting and equivalenceMore Information...
• Stéphane Le Roux Arno Pauly
  Infinite sequential games with real-valued payoffsMore Information...
• Takeshi Tsukada C.-H. Luke Ong
  Compositional higher-order model checking via ω-regular games over Böhm treesMore Information...
• Yaron Velner
  Finite-memory strategy synthesis for robust multidimensional mean-payoff objectivesMore Information...
• Ryan Williams
  Faster decision of first-order graph propertiesMore Information...

Organizers

General Chair Luke Ong University of Oxford luke.ong@cs.ox.ac.uk Program Chair Thomas A. Henzinger Dale A. Miller IST Austria INRIA & LIX Publicity Chair Andrzej Murawski University of Warwick a.murawski@warwick.ac.uk Workshops Chair Patricia Bouyer-Decitre CNRS & ENS Cachan bouyer@lsv.ens-cachan.fr

Program Committee: Andrea Asperti (University of Bologna); Gilles Barthe (IMDEA); Andrej Bauer (IMFM); Lars Birkedal (Aarhus University); Krishnendu Chatterjee (IST Austria); Adriana Compagnoni (Stevens Institute of Technology); Valeria DePaiva (Nuance Communications); Laurent Doyen (ENS Cachan); Jacques Duparc (University of Lausanne); Maribel Fernández (King's College London); Herman Geuvers (Radboud University Nijmegen); Dan Ghica (University of Birmingham); Erich Grädel (RWTH Aachen University); Holger Hermanns (Saarland University); Neil Immerman (University of Mass. Amherst); Naoki Kobayashi (University of Tokyo); Laura Kovács (Chalmers University); Viktor Kuncak (EPFL); Salvatore La Torre (University of Salerno); Rupak Majumdar (MPI-SWS); Damiano Mazza (CNRS & University Paris-Nord); Joel Ouaknine (University of Oxford); Leszek Pacholski (University of Wroclaw); Nir Piterman (University of Leicester); Andrew Pitts (University of Cambridge); Andreas Podelski (University of Freiburg); R. Ramanujam (IMS Chennai); James Riely (DePaul University); Simona Ronchi Della Rocca (University of Torino); Amr Sabry (Indiana University); Tom Schrijvers (Ghent University); P. S. Thiagarajan (National University of Singapore); Alwen Tiu (Nanyang Technological University); Victor Vianu (University of California, San Diego); Igor Walukiewicz (CNRS & University of Bordeaux) Organizing Committee Martín Abadi; Luca Aceto; Rajeev Alur; Paul Beame; Maria PaolaBonacina; Patricia Bouyer-Decitre; Krishnendu Chatterjee; Adriana Compagnoni; Anuj Dawar; Nachum Dershowitz; Maribel Fernández; Martin Grohe; Orna Grumberg; Thomas A. Henzinger; Phokion Kolaitis; Orna Kupferman; Benoit Larose; Vlatko Lipovac; Dale Miller; Michael Mislove; Georg Moser; Andrzej Murawski; Luke Ong; Andre Scedrov; David Shmoys; Matt Valeriote Advisory Board Martín Abadi; Samson Abramsky; Rajeev Alur; Bob Constable; Thierry Coquand; Thomas Henzinger; Jean-Pierre Jouannaud; Phokion Kolaitis; Dexter Kozen; Dale Miller; John Mitchell; Prakash Panangaden; Andrew Pitts; Gordon Plotkin; Moshe Y. Vardi; Glynn Winskel