Monday, June 24

9:00 - 10:00

  MFPS-LICS Special Session on Coalgebra
  organized by Jan Rutten and Alexandra Silva

  Jan Rutten. Automata and the Algebra-coalgebra Duality: on Varieties and Covarieties, on Transition Monoids and Their Dual

10:00 - 10:30  Break
10:30 - 12:30

  MFPS-LICS Special Session on Coalgebra (cont.)

  • Bart Jacobs. Coalgebra and Quantum Computing
  • Larry Moss. Fractal Sets and Final Coalgebras Obtained by Completing an Initial Algebra
  • Lutz Schröder. Coalgebraic Announcements

14:00 - 15:30
  Chair: Emmanuel Filiot

  Huber Comon-Lundh. Logic In Computer Security: Some attacker's models and related decision problems

15:30 - 16:00  Break
16:00 - 17:30

  Tutorial (cont.)
  Huber Comon-Lundh. Logic In Computer Security: Some attacker's models and related decision problems

Tuesday, June 25

9:00 - 10:30

  MFPS-LICS Special Session on the Future of Programming Language Theory in Honor of Dana Scott

  • Andy Pitts. Symmetric Scott
  • Steve Awodey. Constructing Higher Inductive Types in Homotopy Type Theory
  • Robert Harper. Unifying Programming Language Semantics with Algorithm Analysis
10:30 - 11:00  Break
11:00 - 12:30

  MFPS-LICS Special Session on the Future of Programming Language Theory in Honor of Dana Scott (cont.)

  • Andrej Bauer. Algebraic Effects and Handlers (How to use Domain Theory and PERs to do Semantics of Effectful Computations)
  Plenary Lecture (11:30 - 12:30)
  Dana Scott

12:30 - 14:00  Lunch Break
14:00 - 15:30

  Session 1: Vector Addition Systems
  Chair: Stefan Göller

  • Jerome Leroux. Presburger Vector Addition Systems
  • Stéphane Demri, Diego Figueira and M. Praveen. Reasoning about Data Repetitions with Counter Systems
  • Jerome Leroux, Vincent Penelle and Grégoire Sutre. On the Context-freeness Problem for Vector Addition Systems

  Session 2: Finite Model Theory
  Chair: Stephan Kreutzer

  • Martin Otto. Groupoids, Hypergraphs, and Symmetries in Finite Models
  • Lucas Heimberg, Dietrich Kuske and Nicole Schweikardt. An optimal Gaifman normal form construction for structures of bounded degree
  • Witold Charatonik and Piotr Witkowski. Two-variable Logic with Counting and Trees

15:30 - 16:00  Break
16:00 - 17:30

  Session 3: Complexity Theory and Quantum Computation
  Chair: Prakash Panangaden

  • Bart Jacobs. Measurable Spaces and their Effect Logic
  • Jamie Vicary. Topological Structure of Quantum Algorithms
  • Hugo Férée, Walid Gomaa and Mathieu Hoyrup. On the query complexity of real functional

  Session 4: Quantitative Approach
  Chair: Catuscia Palamidessi

  • Stephan Kreutzer and Cristian Riveros. Quantitative Monadic Second-Order Logic
  • Thomas Colcombet. Cost Functions with Several Order of Magnitudes and the use of Relative Internal Set Theory
  • Jan Hoffmann, Michael Marmar and Zhong Shao. Quantitative Reasoning for Proving Lock- Freedom of Non-Blocking Data Structures

18:00 - 19:30


Wednesday, June 26

9:00 - 10:00

  Chair: Veronique Cortier

  Invited Talk
  Joe Halpern. From qualitative to quantitative proofs of security properties using first-order conditional logic

10:00 - 10:30  Break
10:30 - 12:30

  Session 5: Model Checking
  Chair: Grigore Rosu

  • Kord Eickmeyer, Ken-Ichi Kawarabayashi and Stephan Kreutzer. Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
  • Philippe Balbiani, Andreas Herzig and Nicolas Troquard. Dynamic logic of propositional assignments: a well-behaved variant of PDL
  • Anudhyan Boral and Sylvain Schmitz. Model-Checking Parse Trees
  • Benedikt Bollig, Dietrich Kuske and Roy Mennicke. The Complexity of Model Checking Multi-Stack Systems

  Session 6: Complexity and Computability
  Chair: Dexter Kozen

  • Matthew Anderson, Anuj Dawar and Bjarki Holm. Linear Programming and Maximum Matching in Fixed-Point Logic with Counting
  • Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota and Szymon Toruńczyk. Turing Machines with Atoms
  • Angelo Montanari and Pietro Sala. Adding an equivalence relation to the interval logic ABB: complexity and expressiveness
  • Piotr Hofman, Richard Mayr and Patrick Totzke. Decidability of Weak Simulation on One-counter Nets

12:30 - 14:00  Lunch Break
14:00 - 15:00

  Chair: Luke Ong

  Invited talk
  Prakash Panangaden. Duality in Logic and Computation

15:00 - 15:30  Break
15:30 - 17:30

  Session 7: Type Theory and Applications
  Chair: Andrew Pitts

  • Lars Birkedal and Rasmus Ejlers Møgelberg. Intensional Type Theory with Guarded Recursive Types qua Fixed-Points on Universes
  • Daniel R. Licata and Michael Shulman. Calculating the Fundamental Group of the Circle in Homotopy Type Theory
  • Jorge Luis Sacchini. Type-Based Productivity of Stream Definitions in the Calculus of Constructions
  • Neil Ghani, Peter Hancock, Lorenzo Malatesta, Fredrik Nordvall Forsberg and Anton Setzer. Fibred Data Types

  Session 8: Multi-agent Systems, Programming Languages
  Chair: Uday Reddy

  • James Hales. Arbitrary Action Model Logic and the Synthesis of Action Models
  • Fabio Mogavero, Aniello Murano and Luigi Sauro. On the Boundary of Behavioral Strategies
  • Sergey Goncharov and Lutz Schröder. A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
  • Chuck Liang and Dale Miller. Unifying Classical and Intuitionistic Logics for Computational Control


  Business meeting

Thursday, June 27

9:00 - 10:00

  Chair: Rajeev Alur

  Invited Talk
  Nancy Lynch. Timed and Probabilistic I/O Automata

10:00 - 10:30  Break
10:30 - 12:00

  Session 9: Lambda Calculus
  Chair: Naoki Kobayashi

  • Andrea Asperti and Jean-Jacques Levy. The cost of usage in the lambda calculus
  • Jim Laird, Giulio Manzonetto, Guy McCusker and Michele Pagani. Weighted relational models of typed lambda-calculi
  • Tom Gundersen, Willem Heijltjes and Michel Parigot. Atomic lambda-calculus: a typed lambda-calculus with explicit sharing

  Session 10: The Probabilistic Setting
  Chair: Joel Ouaknine

  • Dexter Kozen, Kim Guldstrand Larsen, Radu Mardare and Prakash Panangaden. Stone Duality for Markov Processes
  • Tomas Brazdil, Krishnendu Chatterjee, Vojtech Forejt and Antonin Kucera. Trading Performance for Stability in Markov Decision Processes
  • Sumit Nain and Moshe Vardi. Solving Partial Information Stochastic Parity Games

12:00 - 13:30  Lunch Break
13:30 - 15:00

  Session 11: Temporal Logic
  Chair: Angelo Montanari

  • Paul Hunter, Joel Ouaknine and James Worrell. Expressive Completeness for Metric Temporal Logic
  • Grigore Rosu, Andrei Stefanescu, Stefan Ciobaca and Brandon Moore. Reachability Logic
  • Massimo Benerecetti, Fabio Mogavero and Aniello Murano. Substructure Temporal Logic

  Session 12: Process Calculus and Recursion Theory
  Chair: Eijiro Sumii

  • Daniel Hirschkoff, Jean-Marie Madiot and Davide Sangiorgi. Name-passing calculi: from fusions to preorders and types
  • Ioana Domnina Cristescu, Jean Krivine and Daniele Varacca. A compositional semantics for the reversible pi-calculus
  • Naoki Kobayashi. Pumping by Typing

15:00 - 15:30  Break
15:30 - 17:00

  Short Talks (Track 1)
  Chair: Andrzej Murawski

  • Ariel Fernández and Michael Soltys. Feasible combinatorial matrix theory (Polytime proofs for Koënig's Min-Max and related theorems)
  • Christoph Dittmann, Stephan Kreutzer and Alexandru I. Tomescu. Graph Operations on Parity Games and Polynomial-Time Algorithms
  • Uli Fahrenberg and Axel Legay. History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
  • Sylvain Schmitz. Complexity Hierarchies Beyond Elementary
  • Thomas A. Henzinger and Jan Otop. From Model Checking to Model Measuring

  Short Talks (Track 2)
  Chair: Sam Staton

  • Jean-Philippe Bernardy and Guilhem Moulin. Type-Theory In Color
  • Witold Charatonik and Piotr Witkowski. Two-variable Logics with Counting and Datalog
  • Matthew Anderson and Anuj Dawar. On Symmetric Circuits and FP+C
  • Jim Laird. Semantics of Closures: Deconstructing Local State
  • Robert J. Simmons and Ian Zerny. A Logical Correspondence between Natural Semantics and Abstract Machines
  • Jonas De Vuyst. Dynamic Tableaux for Public Announcement Logic

19:00 Open Bar
19:30 Dinner

  Conference Banquet @ Astor Hotel

Friday, June 28

9:00 - 10:00
  Chair: Larry Moss

  Invited Talk
  Rajeev Alur. Regular functions and Cost Register Automata

10:00 - 10:30  Break
10:30 - 12:30

  Session 13: Modal Logic and Proof Theory
  Chair: Dale Miller

  • Ori Lahav. From Frame Properties to Hypersequent Rules in Modal Logics
  • Dirk Pattinson. The Logic of Exact Covers: Completeness and Uniform Interpolation
  • Beniamino Accattoli. Compressing polarized boxes
  • Achim Jung and Umberto Rivieccio. Kripke semantics for modal bilattice logic

  Session 14: Logic, Automata, and Transducers
  Chair: Fabio Mogavero

  • Colin Riba. Forcing MSO on Infinite Words in Weak MSO
  • Ashutosh Trivedi, Antoine Durand-Gasselin and Rajeev Alur. From Monadic Second-Order Definable String Transformations to Transducers
  • Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier and Frédéric Servais. From Two-Way to One-Way Finite State Transducers
  • Alessandro Facchini, Yde Venema and Fabio Zanasi. A characterization theorem for the alternation-free fragment of the modal mu-calculus

12:30 - 14:00  Lunch Break
14:00 - 15:30

  Session 15: Automata Theory
  Chair: Mikołaj Bojańczyk

  • Michael Benedikt, Stefan Göller, Stefan Kiefer and Andrzej Murawski. Bisimilarity of Pushdown Automata is Nonelementary
  • Alessandro Facchini, Filip Murlak and Michał Skrzypczak. Rabin-Mostowski index problem: a step beyond deterministic automata
  • Swarat Chaudhuri, Sriram Sankaranarayanan and Moshe Vardi. Regular Real Analysis

  Session 16: Algebraic Approach
  Chair: Achim Jung

  • Sam Staton. Instances of computational effects: an algebraic perspective
  • Makoto Hamana and Marcelo Fiore. Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
  • Pierre-Evariste Dagand and Conor McBride. A Categorical Treatment of Ornament

15:30 - 16:00   Break
16:00 - 17:00

  Session 17: Databases
  Chair: Michael Benedikt

  • Tomasz Gogacz and Jerzy Marcinkowski. Converging to the Chase - a Tool for Finite Controllability
  • Gaelle Fontaine. Why is it hard to obtain a dichotomy for consistent query answering?

  Session 18: Networks, Applications
  Chair: James Laird

  • Olle Fredriksson and Dan Ghica. Abstract machines for game semantics, revisited