34th EACSL Annual Conference on
Computer Science Logic

CSL 2026

Paris, France
24-27 February 2026

Accepted Papers

Manuel Bodirsky, Santiago Guzman Pro. Hereditary First-Order Logic: the tractable quantifier prefix classes.
Samuel Mimram, Emile Oleon. Classifying covering types in homotopy type theory.
Qipeng Kuang, Ondřej Kuželka, Yuanhong Wang, Yuyi Wang. Bridging Weighted First Order Model Counting and Graph Polynomials.
Valentin Pasquale, Álvaro García-Pérez. Towards the type safety of Pure Subtype Systems.
Gianluca Curzi, Lukas Melgaard. Cyclic proof theory of positive inductive definitions.
Nicolas Peltier. On the Entailment Problem in Dynamic Separation Logic with Inductive Definitions.
Sophie Brinke, Anuj Dawar, Erich Grädel, Lovro Mrkonjić, Matthias Naaf. Compactness in Semiring Semantics.
Josée Desharnais, Ana Sokolova. $\varepsilon$-Distance via Lévy-Prokhorov Lifting.
Pablo Barenbaum, Delia Kesner, Mariana Milicich. Useful Call-by-Value: A Semantic Interpretation via Quantitative Types.
Isa Vialard. Deciding the Value of Two-Clock Almost Non-Zeno Weighted Timed Games.
Guy Avni, Suman Sadhukhan. Mean-payoff and Energy Discrete Bidding Games.
Matthew Earnshaw, Chad Nester, Mario Román. Resourceful traces for commuting processes.
Stéphane Demri, Tianwen Gu. Robustness of Constraint Automata for Description Logics with Concrete Domains.
Thorsten Altenkirch, Ambrus Kaposi, Szumi Xie. The Groupoid-syntax of Type Theory is a Set.
Michael Benedikt, Chia-Hsuan Lu, Tony Tan. Analysis of logics with arithmetic.
Anuj Dawar, Lauri Hella, Benedikt Pago. Arity hierarchies for quantifiers closed under partial polymorphisms.
Sebastian Pfau. Boolean Basis and Succinctness of Modal Logic via Hella-Vilander games.
Nicolas Fröhlich, Phokion Kolaitis, Arne Meier. Disjunctions of Two Dependence Atoms.
Gregoire Fournier, Gyorgy Turan. A Game for Counting Logic Formula Size and an Application to Linear Orders.
Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté, Florent Madelaine. Weakly-sparse and strongly flip-flat classes of graphs are almost-wide.
Filip Jankovec, Zuzana Haniková. Satisfiability in Łukasiewicz logic and its unbounded relative.
Emily Clement, Enzo Erlich, Jérémy Ledent. Kamp theorem for Higher Dimensinal Automata.
Jan J.M. Martens. Minimal DFAs Witnessing Language Inequivalence.
Henning Urbat, Thorsten Wißmann. Well-Founded Coalgebras Meet König's Lemma.
Ruben Turkenburg, Harsh Beohar, Franck van Breugel, Clemens Kupke, Jurriaan Rot. Constructing Witnesses for Lower Bounds on Behavioural Distances.
Rafael Dewes, Rayna Dimitrova. Reward Interfaces with Best-Effort Implementations.
Nino Dauvier, Emmanuel Filiot, Pierre-Alain Reynier. Register-Bounded Synthesis from Constraint LTL.
Mateo Torres-Ruiz, Robin Piedeleu, Alexandra Silva, Fabio Zanasi. A Complete Diagrammatic Calculus for Conditional Gaussian Mixtures.
Mohamed Bandukara, Nikos Tzevelekos. A Logic for Fresh Labelled Transition Systems.
Étienne André, Swen Jacobs, Engel Lefaucheux. Parametric disjunctive timed networks.
Daniël Otten, Matteo Spadetto. The biequivalence of path categories and axiomatic Martin-Löf type theories.
Yoan Géran. A Canonical Form for Universe Levels in Impredicative Type Theory.
Perry Hart. On Left Adjoints Preserving Colimits in HoTT.
Antonella Bilotta, Marco Maggesi, Cosimo Perini Brogi. A modular framework for proof-search via formalised modal completeness in HOL Light.
Esaïe Bauer, Alexis Saurin. A uniform cut-elimination theorem for linear logics with fixed points and super-exponentials.
Alessandro Di Giorgio, Pawel Sobocinski, Niels Voorneveld. Parametric Iteration in Resource Theories.
Callum Reader, Alessandro Di Giorgio. String Diagrams for Closed Symmetric Monoidal Categories.
Giulio Fellin. A Unifying Conservation Theorem.
Radu Mardare, Robert Furber, Prakash Panangaden, Dana Scott. Interpreting Lambda Calculus in Domain-Valued Random Variables.
Samuel Graepler, Benjamin Monmege, Jean-Marc Talbot. Reasoning about Quality in Hyperproperties.
Yoav Feinstein, Orna Kupferman. Memory Requirements in Non-Zero-Sum Games.
Davide Barbarossa, Thomas Powell. On the algorithmic structure of Dialectica realisers.
Nachiappan Valliappan. Lax Modal Lambda Calculi.