Schedule

Monday, January 13th | |

Opening | |

08:30-08:55 |
Registration desk opens |

08:55-09:00 | Opening remarks |

Invited talk | [Chair: Anca Muscholl] |

09:00-10:00 | Symmetric computationAnuj Dawar |

Session 1 | Algebra and languages [Chair: Juriaan Rot] |

10:00-10:30 |
On free completely iterative algebrasJiří Adámek |

10:30-11:00 |
A complete axiomatisation of a fragment of language algebraPaul Brunet |

Coffee break | |

Session 2 | Logic [Chair: Paweł Parys] |

11:30-12:00 |
Guarded Teams: The Horizontally Guarded CaseErich Grädel, Martin Otto |

12:00-12:30 |
FO-Definability of Shrub-DepthYijia Chen, Jörg Flum |

12:30-13:00 |
Order-Invariant First-Order Logic over Hollow TreesJulien Grange, Luc Segoufin |

Lunch break | |

Invited talk | [Chair: Maribel Fernández] |

14:45-15:45 |
Verification of security protocolsVéronique Cortier |

Coffee break | |

Session 3 | Logic and verification [Chair: Anca Muscholl] |

16:15-16:45 |
Coverage and Vacuity in Network Formation GamesGili Bielous, Orna Kupferman |

16:45-17:15 |
On the Union Closed Fragment of Existential Second-Order Logic and
Logics with Team SemanticsMatthias Hoelzel, Richard Wilke |

17:15-17:45 |
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very
Simple FormulasCorto Mascle, Martin Zimmermann |

17:45-18:15 |
Monitoring Event FrequenciesThomas Ferrère, Thomas A. Henzinger, Bernhard Kragl |

Coffee break | |

Meeting | |

18:30-20:00 | EACSL Annual Membership Meeting |

Tuesday, January 14th | |

Invited talk | [Chair: Albert Atserias] |

09:00-10:00 |
From classical proof theory to P vs. NP: a guide to
bounded theoriesIddo Tzameret |

Session 4 | Proof theory [Chair: Arno Pauly] |

10:00-10:30 |
Syntactic Interpolation for Tense Logics and Bi-Intuitionistic
Logic via Nested SequentsTim Lyon, Alwen Tiu, Rajeev Goré, Ranald Clouston |

10:30-11:00 |
Internal Calculi for Separation LogicsStéphane Demri, Etienne Lozes, Alessio Mansutti |

Coffee break | |

Session 5 | Logic and complexity [Chair: Martin Otto] |

11:30-12:00 |
Proof complexity of systems of (non-deterministic) decision trees
and branching programsSam Buss, Anupam Das, Alexander Knop |

12:00-12:30 |
Dynamic Complexity of Parity Exists QueriesNils Vortmeier, Thomas Zeume |

12:30-13:00 |
Dynamic Complexity Meets Parameterised AlgorithmsJonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis |

Lunch break | |

Session 6 | Co-algebra and nominal theory [Chair: Paul Brunet] |

14:45-15:15 |
Expressive Logics for Coinductive PredicatesClemens Kupke, Jurriaan Rot |

15:15-15:45 |
Separation and Renaming in Nominal SetsJoshua Moerman, Jurriaan Rot |

Coffee break | |

Session 7 | Automata and games [Chair: Anuj Dawar] |

16:15-16:45 |
State Space Reduction For Parity AutomataChristof Löding, Andreas Tollkötter |

16:45-17:15 |
Strongly Unambiguous Büchi Automata Are Polynomially
Predictable with Membership QueriesDana Angluin, Timos Antonopoulos, Dana Fisman |

17:15-17:45 |
A Robust Class of Linear Recurrence SequencesCorentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki |

17:45-18:15 |
Parity Games: Another View on Lehtinen's AlgorithmPaweł Parys |

Wednesday, January 15th | |

Invited talk | [Chair: Thomas Schwentick] |

9:00-10:00 |
Solving word equations (and other unification
problems) by recompressionArtur Jeż |

Session 8 | Logic and algorithms [Chair: Dietrich Kuske] |

10:00-10:30 |
Computing Haar MeasuresArno Pauly, Dongseong Seon, Martin Ziegler |

10:30-11:00 |
Automatic equivalence structures of polynomial growthMoses Ganardi, Bakhadyr Khoussainov |

Coffee break | |

Invited talk | [Chairs: Thomas Schwentick and Simona Ronchi Della Rocca] |

11:30-12:30 | Ackermann Award |

Free Afternoon (Guided Tour?) | |

Conference banquet (20:00 - ) | |

Thursday, January 16th | |

Invited talk | [Chair: Simona Ronchi Della Rocca] |

9:00-10:00 |
Reasoning about Dynamic Properties of Classical Term
CalculiDelia Kesner |

Session 9 | Lambda-calculus and realizability [Chair: Roberto Maieli] |

10:00-10:30 |
Revisiting the duality of computation: an algebraic analysis of classical realizability modelsÉtienne Miquey |

10:30-11:00 |
The call-by-value lambda-calculus with generalized applicationsJose Espirito Santo |

Coffee break | |

Session 10 | Linear logic [Chair: Delia Kesner] |

11:30-12:00 |
Generalized Connectives for Multiplicative Linear LogicMatteo Acclavio, Roberto Maieli |

12:00-12:30 |
Glueability of resource proof-structures: inverting the Taylor
expansionGiulio Guerrieri, Luc Pellissier, Lorenzo Tortora De Falco |

12:30-13:00 |
Taylor expansion for Call-By-Push-ValueJules Chouquet, Christine Tasson |

Lunch break | |

Session 11 | Category theory [Chair: Giulio Guerrieri] |

14:45-15:15 |
Tangent Categories from the Coalgebras of Differential
CategoriesRobin Cockett, Jean-Simon Lemay, Rory Lucyshyn-Wright |

15:15-15:45 |
Reverse derivative categoriesRobin Cockett, Geoffrey Cruttwell, Jonathan Gallagher, Jean-Simon Lemay, Benjamin MacAdam, Gordon Plotkin, Dorette Pronk |

Coffee break | |

Session 12 | Type theory and set theory [Chair: Jose Espirito Santo] |

16:15-16:45 |
Unifying Cubical Models of Univalent Type TheoryEvan Cavallo, Anders Mörtberg, Andrew W. Swan |

16:45-17:15 |
Internal Parametricity for Cubical Type TheoryEvan Cavallo, Robert Harper |

17:15-17:45 |
De Jongh's Theorem for Intuitionistic Zermelo-Fraenkel Set
TheoryRobert Passmann |