LICS — PROGRAM

Days: Monday, 20 July 2026 Tuesday, 21 July 2026 Wednesday, 22 July 2026 Thursday, 23 July 2026

Monday, 20 July 2026
10:00-10:20 Coffee Break LICS
Location: B1.04
10:00-10:20 Coffee Break LICS
Location: C1.03
10:20-10:30 Opening & welcome (room A) LICS
Location: B1.04
10:20-10:30 Opening & welcome (room B) LICS
Location: C1.03
10:30-12:30 Session 1B Automata on Infinite Words and MSO LICS
Session Chair:
Location: C1.03
10:30-11:00
A Naturally-Colored Translation from LTL to Parity and COCOA (abstract) 30 min
1 TU Clausthal
11:00-11:30
Layered automata: A canonical model for automata over infinite words (abstract) 30 min
1 University of Kaiserslautern-Landau
2 RWTH Aachen University
3 CNRS, University of Bordeaux
11:30-12:00
The uniformisation of monadic second-order logic over countable ordinals (abstract) 30 min
1 IRIF
2 Tel Aviv University
12:00-12:30
Automata for MSO over infinite trees with quantification over Borel sets of branches (abstract) 30 min
1 MIMUW, University of Warsaw
2 University of Kaiserslautern-Landau
3 University of Bonn
10:30-12:30 Session 1A Lambda Calculi and Abstract Syntax LICS
Session Chair:
Location: B1.04
10:30-11:00
A Machine-Independent, Log-Sensitive Space-Cost Measure for the Weak Lambda-Calculus (abstract) 30 min
1 Université Paris-Saclay, LMF
11:00-11:30
A Pointfree Algebraic Metatheory of Syntax-Based Systems (abstract) 30 min
1 University of Padova
11:30-12:00
Oracles Just for Fan: A Robust Computational Interpretation of the Fan Theorem (abstract) 30 min
1 Aix-Marseille Université
12:00-12:30
A Unified Treatment of Substitution for Presheaves, Nominal Sets, Renaming Sets, and so on (abstract) 30 min
1 FAU Erlangen-Nürnberg
12:30-13:30 Lunch LICS
Location: B1.04
12:30-13:30 Lunch LICS
Location: C1.03
13:30-15:00 Session 2A Proof Theory and Linear Logic LICS
Session Chair:
Location: B1.04
13:30-14:00
The logic of bunched implications is undecidable (abstract) 30 min
1 University of Amsterdam
2 University of Denver
3 University of Groningen
4 Chapman University
14:00-14:30
Hypersequent calculi have Ackermannian upper bounds (abstract) 30 min
1 Max Planck Institute for Software Systems (MPI-SWS)
2 University of Groningen
14:30-15:00
The Logic of Intersection Subtyping (abstract) 30 min
1 ENS de Lyon
13:30-15:00 Session 2B Automata LICS
Session Chair:
Location: C1.03
13:30-14:00
Checking History-Determinism for Parity Automata is in NP (abstract) 30 min
1 CNRS, Aix Marseille Univ., LIS
2 Aix Marseille Univ., CNRS, LIS
3 University of Warsaw
14:00-14:30
Commutative algebras of series (abstract) 30 min
1 University of Warsaw
14:30-15:00
Minimization of streaming transducers (abstract) 30 min
1 Udine University
15:00-15:30 Coffee Break LICS
Location: B1.04
15:00-15:30 Coffee Break LICS
Location: C1.03
15:30-16:30 Session 3B Automata LICS
Session Chair:
Location: C1.03
15:30-16:00
A Complexity Bound for Determinisation of Min-Plus Weighted Automata (abstract) 30 min
1 Technion
16:00-16:30
Differential Tree Automata (abstract) 30 min
1 IRIF, CNRS
2 University of Oxford
15:30-16:30 Session 3A Type Systems LICS
Session Chair:
Location: B1.04
15:30-16:00
LFPL: Revisited and Mechanized (abstract) 30 min
1 Carnegie Mellon University
16:00-16:30
Layered Modal ML: Syntax and Full Abstraction (abstract) 30 min
1 University of Oxford
2 Nanyang Technological University
16:30-17:00 Test of Time Awards LICS
Location: B1.04
Tuesday, 21 July 2026
09:00-10:00 Keynote by Nada Amin LICS
Session Chair:
Location: B1.04
09:00-10:00
A Rational Defense of Reasonable Reflection (abstract) 60 min
1 Harvard
10:00-10:30 Coffee Break LICS
Location: B1.04
10:00-10:30 Coffee Break LICS
Location: C1.03
10:30-12:30 Session 4A Verification & Foundations of Probabilistic Systems LICS
Session Chair:
Location: B1.04
10:30-11:00
Verifying Exact Samplers for Continuous Distributions with a Discrete Program Logic (abstract) 30 min
1 New York University
2 NYU Shanghai
3 Aarhus University
11:00-11:30
Complete Supermartingale Certificates for ω-Regular Properties (abstract) 30 min
1 University of Oxford
2 University of Birmingham
11:30-12:00
On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic (abstract) 30 min
1 Università di Bologna
2 Université Claude Bernard Lyon 1
12:00-12:30
Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability (abstract) 30 min
1 Aalborg University
2 IT University of Copenhagen
10:30-12:30 Session 4B Logic and Structural Graph Theory LICS
Session Chair:
Location: C1.03
10:30-11:00
Existential Positive Transductions of Sparse Graphs (abstract) 30 min
1 University of Warsaw
2 University of Bremen
11:00-11:30
Low Rank MSO (abstract) 30 min
1 University of Warsaw
2 Max Planck Institute for Informatics, Saarland Informatics Campus
3 IRIF, Université Paris Cité, CNRS, Paris
11:30-12:00
Model checking for low monodimensionality fragments of CMSO on topological-minor-free graph classes (abstract) 30 min
1 LIRMM, Univ Montpellier, CNRS
2 University of Bremen
3 IRIF, Université Paris Cité, CNRS, France
4 Univ Clermont Auvergne
12:00-12:30
Well-Quasi-Ordered Classes of Bounded Clique-Width (abstract) 30 min
1 INP Bordeaux, LaBRI, CNRS
2 University of Warsaw
12:30-14:00 Lunch LICS
Location: B1.04
12:30-14:00 Lunch LICS
Location: C1.03
14:00-16:00 Session 5A Logical Aspects of Quantum Computation LICS
Session Chair:
Location: B1.04
14:00-14:30
Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi (abstract) 30 min
1 University of Oxford
14:30-15:00
A Complete Equational Theory for Real-Clifford+CH Quantum Circuits (abstract) 30 min
1 Université Paris-Saclay, LMF
15:00-15:30
Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions (abstract) 30 min
1 MPI-SP & IMDEA Software Institute
2 Institute of Software, Chinese Academy of Sciences
3 MPI-SP
4 RUB
5 University of Chinese Academy of Sciences
15:30-16:00
Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras (abstract) 30 min
1 University of Cambridge
14:00-16:00 Session 5B Counter and Vector Addition Systems LICS
Session Chair:
Location: C1.03
14:00-14:30
PVASS Reachability is Decidable (abstract) 30 min
1 University of Warsaw
2 TU Braunschweig
14:30-15:00
Reachability in VASS Extended with Integer Counters (abstract) 30 min
1 University of Bordeaux
2 University of Warsaw
15:00-15:30
The Complexity of Nested Reset Counter Systems (abstract) 30 min
1 Max Planck Institute for Software Systems
2 Technical University of Munich
15:30-16:00
The complexity of downward closures of indexed languages (abstract) 30 min
1 Max Planck Institute for Software Systems
16:00-16:30 Coffee Break LICS
Location: B1.04
16:00-16:30 Coffee Break LICS
Location: C1.03
16:30-18:00 Session 6A Logical aspects of Quantum computation LICS
Session Chair:
Location: B1.04
16:30-17:00
Quantum Control and General Recursion beyond the Unitary Case (abstract) 30 min
1 LORIA, CNRS, INRIA, Université de Lorraine, France
17:00-17:30
Causality in Pure Quantum Computation with Quantum Control (abstract) 30 min
1 University of Edinburgh, Kyoto University
2 Chiba University
17:30-18:00
One rig to control them all (abstract) 30 min
1 University of Edinburgh
2 University of Southern Denmark
16:30-18:00 Session 6B Quantitative and Analytical Properties of Formal Languages LICS
Session Chair:
Location: C1.03
16:30-17:00
Randomness Extraction Fails for Finite-State Dimension (abstract) 30 min
1 National Research University Higher School of Economics Moscow
2 Indian Institute of Technology Kanpur
17:00-17:30
Unbounded data nesting for loops in higher-order programs (abstract) 30 min
1 University of Birmingham
2 University of Oxford
17:30-18:00
Star Complexity of Parikh Images of Languages over Infinite Alphabets (abstract) 30 min
1 Technion -- Israel Institute of Technology, Haifa, Israel
18:10-18:50 LICS General Assembly LICS
Location: B1.04
Wednesday, 22 July 2026
10:00-10:30 Coffee Break LICS
Location: B1.04
10:00-10:30 Coffee Break LICS
Location: C1.03
10:30-12:30 Session 7A Categorical models: effects, automata & model theory LICS
Session Chair:
Location: B1.04
10:30-11:00
A categorical perspective on constraint satisfaction: The wonderland of adjunctions (abstract) 30 min
1 Charles University
2 Czech Technical University
3 University of Birmingham
11:00-11:30
Forgetting Event Order in Higher-Dimensional Automata (abstract) 30 min
1 Norwegian University of Science and Technology (NTNU)
11:30-12:00
A cartesian closed fibration of regular languages (abstract) 30 min
1 CNRS, Université Paris Cité, INRIA
2 Tallinn University of Technology
12:00-12:30
Monads and Distributive Laws in Substructural Contexts (abstract) 30 min
1 National Institute of Informatics
2 National Institute of Informatics and SOKENDAI
3 National Institute of Informatics, SOKENDAI, and Imiron
10:30-12:30 Session 7B Decidability in Arithmetic and Linear Theories LICS
Session Chair:
Location: C1.03
10:30-11:00
Constructing Small Monadic Decompositions in Presburger Arithmetic (abstract) 30 min
1 RPTU Kaiserslautern-Landau
11:00-11:30
On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic (abstract) 30 min
1 University of Oxford
2 Max Planck Institute for Software Systems, Saarland Informatics Campus
11:30-12:00
Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property (abstract) 30 min
1 Tel Aviv University
12:00-12:30
On the Subspace Orbit Problem and the Simultaneous Skolem Problem (abstract) 30 min
1 University of Oxford
2 TU Wien
3 Max Planck Institute for Software Systems, Saarland Informatics Campus
12:30-14:00 Lunch LICS
Location: B1.04
12:30-14:00 Lunch LICS
Location: C1.03
14:00-16:00 Session 8A Foundations of Probabilistic Computation LICS
Session Chair:
Location: B1.04
14:00-14:30
Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation (abstract) 30 min
1 University of Twente
14:30-15:00
A synthetic account of Metropolis--Hastings via categorical probability (abstract) 30 min
1 Nanyang Technological University
2 University of Warwick
15:00-15:30
Interpreting De Finetti's Theorem in the Category of Integrable Cones (abstract) 30 min
1 LIS, Aix-Marseille Université
15:30-16:00
A convenient fibration for dependently-typed probability theory (abstract) 30 min
1 University of Tartu
2 University of Edinburgh
3 IT University of Copenhagen
14:00-16:00 Session 8B Graph Isomorphism, Homomorphisms, and Combinatorial Invariants LICS
Session Chair:
Location: C1.03
14:00-14:30
Local combinatorial analogues for bounded VC dimension (abstract) 30 min
1 The University of Chicago
14:30-15:00
Dynamic Planar Graph Isomorphism is in DynFO (abstract) 30 min
1 Chennai Mathematical Institute, India
2 Ruhr University Bochum, Germany
15:00-15:30
The Finite Length Property of the Rado graph and Friends (abstract) 30 min
1 University of Oxford
2 University of Warsaw
15:30-16:00
Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs (abstract) 30 min
1 Max Planck Institute for Informatics
2 IT-University of Copenhagen
16:00-16:30 Coffee Break LICS
Location: B1.04
16:00-16:30 Coffee Break LICS
Location: C1.03
16:30-17:30 Session 9A Semantics of Programming Languages LICS
Session Chair:
Location: B1.04
16:30-17:00
Lazy Intermediate Representations for Algebraic Effects (abstract) 30 min
1 Inria, IRISA, Univ. Rennes
2 Inria, École Normale Supérieure
17:00-17:30
Wiring the Pi-calculus to Denotational Semantics (abstract) 30 min
1 The University of Tokyo
2 Bologna University, Inria
3 Inria
4 CNRS, Aix-Marseille Université
16:30-17:30 Session 9B Games and Strategies under Uncertainty LICS
Session Chair:
Location: C1.03
16:30-17:00
Dicey Games: Shared Sources of Randomness in Distributed Systems (abstract) 30 min
1 Institute of Science and Technology Austria
2 Université Libre de Bruxelles
17:00-17:30
Mixing Any Cocktail with Limited Ingredients: On the Structure of Payoff Sets in Multi-Objective POMDPs and its Impact on Randomised Strategies (abstract) 30 min
1 University of Oxford
2 F.R.S.-FNRS & UMONS - Université de Mons
Thursday, 23 July 2026
09:00-10:00 Keynote by Stéphanie Delaune LICS
Session Chair:
Location: B1.04
09:00-10:00
Formal Verification of Security Protocols: 25 Years of ProVerif (abstract) 60 min
1 CNRS
10:00-10:30 Coffee Break LICS
Location: B1.04
10:00-10:30 Coffee Break LICS
Location: C1.03
10:30-12:30 Session 10B Constraint Satisfaction LICS
Session Chair:
Location: C1.03
10:30-11:00
On the Computational Power of Extensional ESO (abstract) 30 min
1 Institut für Algebra, TU Dresden
11:00-11:30
Towards infinite PCSP: a dichotomy for monochromatic cliques (abstract) 30 min
1 Jagiellonian University
2 Charles University
3 Philipps-University Marburg
11:30-12:00
Decidability of Interpretability (abstract) 30 min
1 TU Wien
12:00-12:30
Complexity Classes Arising from Circuits over Finite Algebraic Structures (abstract) 30 min
1 TU Wien
2 Maria Curie-Sklodowska University, Lublin
10:30-12:30 Session 10A Constructive Mathematics & Type Theory LICS
Session Chair:
Location: B1.04
10:30-11:00
The infinity category of infinity categories in simplicial type theory (abstract) 30 min
1 Aarhus University
2 Chapman University
3 University of Nottingham
11:00-11:30
Generalized Decidability via Brouwer Trees (abstract) 30 min
1 University of Nottingham
2 University of Strathclyde
11:30-12:00
Eliminating reversals from cubical type theories (abstract) 30 min
1 University of Gothenburg and Chalmers University of Technology
12:00-12:30
Fat cell structures and generalized algebraic theories (abstract) 30 min
1 Indiana University
12:30-14:00 Lunch LICS
Location: B1.04
12:30-14:00 Lunch LICS
Location: C1.03
14:00-16:00 Session 11B Modal and Guarded Logics LICS
Session Chair:
Location: C1.03
14:00-14:30
The Size of Interpolants in Modal Logics (abstract) 30 min
1 Universiteit van Amsterdam
2 University of Liverpool
14:30-15:00
Computation and Size of Interpolants for Hybrid Modal Logics (abstract) 30 min
1 TU Dortmund University
2 University of Warsaw
3 University of Liverpool
15:00-15:30
Guarded Negation Transitive Closure Logic (abstract) 30 min
1 CNRS & Univ Bordeaux
2 University of Buenos Aires & CONICET
3 Chiba University, Institute of Science Tokyo
15:30-16:00
The Guarded Fragment with Nested Equivalence Relations (abstract) 30 min
1 University of Wrocław
14:00-16:00 Session 11A Constructive Mathematics & Type Theory LICS
Session Chair:
Location: B1.04
14:00-14:30
Constructive higher sheaf models of type theory with applications to synthetic mathematics (abstract) 30 min
1 University of Gothenburg and Chalmers University of Technology
14:30-15:00
Classifying 2-Groups in Homotopy Type Theory (abstract) 30 min
1 University of Minnesota, Twin Cities
2 Carnegie Mellon University
15:00-15:30
Cellular Methods in Homotopy Type Theory (abstract) 30 min
1 University of Nottingham
2 University of Strasbourg
15:30-16:00
A computer formalisation of the Serre finiteness theorem (abstract) 30 min
1 Carnegie Mellon University
2 University of Nottingham
3 Stockholm University
16:00-16:30 Coffee Break LICS
Location: B1.04
16:00-16:30 Coffee Break LICS
Location: C1.03
16:30-18:00 Session 12B Proof Theory, Fixed Points, and Meta-Complexity LICS
Session Chair:
Location: C1.03
16:30-17:00
The Algebra of Iterative Constructions (abstract) 30 min
1 Cornell University
2 Saarland University and University College London
3 Saarland University
4 Proofcraft & UNSW Sydney
5 Bucknell University
6 Friedrich-Alexander-Universität Erlangen-Nürnberg
17:00-17:30
Meta-mathematics of Algebraic Complexity (abstract) 30 min
1 Imperial College London
2 University of Oxford
17:30-18:00
Axiomatisability of Alexandrov Dynamic Topological Logic (abstract) 30 min
1 Universität Bern
2 University of Barcelona
16:30-18:00 Session 12A Constructive Mathematics & Type Theory LICS
Session Chair:
Location: B1.04
16:30-17:00
Definitional Proof Irrelevance Made Accessible (abstract) 30 min
1 INRIA
2 Nantes Université
3 Université de Strasbourg
4 University of Chile
17:00-17:30
Problems with Fixpoints of Polynomials of Polynomials (abstract) 30 min
1 Swansea University
17:30-18:00
From Co-Coverages to Radicals in Complete Lattices (abstract) 30 min
1 LMU Munich
Designed and Developed by EventKey | Copyright 2026 EventKey Last updated:
🔍