default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID34th CSL 2026: Paris, France
- Stefano Guerrini, Barbara König
:
34th EACSL Annual Conference on Computer Science Logic, CSL 2026, Paris, France, February 23-28, 2026. LIPIcs 363, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2026, ISBN 978-3-95977-411-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xiv
- Maribel Fernández, Prakash Panangaden:
The Ackermann Award 2025. 1:1-1:5 - Sandra Kiefer:
The Logic Behind Colour Refinement (Invited Talk). 2:1-2:2 - Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Rational Lawvere Logic (Invited Paper). 3:1-3:21 - Pierre Clairambault:
Towards A Rosetta Stone of Interactive and Quantitative Semantics (Invited Talk). 4:1-4:4 - Ana Sokolova:
Automata and Algebras for Probability and Nondeterminism (Invited Talk). 5:1-5:1 - Manuel Bodirsky, Santiago Guzmán-Pro:
Hereditary First-Order Logic: the Tractable Quantifier Prefix Classes. 6:1-6:20 - Qipeng Kuang, Ondrej Kuzelka, Yuanhong Wang, Yuyi Wang:
Bridging Weighted First Order Model Counting and Graph Polynomials. 7:1-7:23 - Nino Dauvier, Emmanuel Filiot, Pierre-Alain Reynier:
Register-Bounded Synthesis from Constraint LTL. 8:1-8:18 - Anuj Dawar, Lauri Hella, Benedikt Pago:
Arity Hierarchies for Quantifiers Closed Under Partial Polymorphisms. 9:1-9:17 - Nicolas Fröhlich, Phokion G. Kolaitis, Arne Meier:
Disjunctions of Two Dependence Atoms. 10:1-10:21 - Mateo Torres-Ruiz, Robin Piedeleu, Alexandra Silva, Fabio Zanasi:
A Complete Diagrammatic Calculus for Conditional Gaussian Mixtures. 11:1-11:17 - Callum Reader, Alessandro Di Giorgio:
String Diagrams for Closed Symmetric Monoidal Categories. 12:1-12:23 - Sophie Brinke, Anuj Dawar, Erich Grädel, Lovro Mrkonjic, Matthias Naaf:
Compactness in Semiring Semantics. 13:1-13:21 - Zuzana Haniková, Filip Jankovec:
Satisfiability in Łukasiewicz Logic and Its Unbounded Relative. 14:1-14:18 - Gianluca Curzi, Lukas Melgaard:
Cyclic Proof Theory of Generalised Inductive Definitions. 15:1-15:19 - Nicolas Peltier:
On the Entailment Problem in Dynamic Separation Logic with Inductive Definitions. 16:1-16:20 - Alexis Saurin, Esaïe Bauer:
A Uniform Cut-Elimination Theorem for Linear Logics with Fixed Points and Super Exponentials. 17:1-17:23 - Antonella Bilotta, Marco Maggesi, Cosimo Perini Brogi:
A Modular Framework for Proof-Search via Formalised Modal Completeness in HOL Light. 18:1-18:29 - Giulio Fellin:
A Unifying Conservation Theorem. 19:1-19:23 - Perry Hart:
On Left Adjoints Preserving Colimits in HoTT. 20:1-20:17 - Samuel Mimram, Émile Oleon:
Classifying Covering Types in Homotopy Type Theory. 21:1-21:20 - Davide Barbarossa, Thomas Powell:
On the Algorithmic Structure of Dialectica Realisers. 22:1-22:22 - Mohamed H. Bandukara, Nikos Tzevelekos:
A Logic for Fresh Labelled Transition Systems. 23:1-23:24 - Henning Urbat, Thorsten Wißmann:
Well-Founded Coalgebras Meet Kőnig's Lemma. 24:1-24:19 - Ruben Turkenburg, Harsh Beohar, Franck van Breugel, Clemens Kupke, Jurriaan Rot:
Constructing Witnesses for Lower Bounds on Behavioural Distances. 25:1-25:22 - Josée Desharnais, Ana Sokolova:
ε-Distance via Lévy-Prokhorov Lifting. 26:1-26:24 - Michael Benedikt, Chia-Hsuan Lu, Tony Tan:
Analysis of Logics with Arithmetic. 27:1-27:18 - Matthew Earnshaw, Chad Nester, Mario Román:
Resourceful Traces for Commuting Processes. 28:1-28:20 - Alessandro Di Giorgio, Pawel Sobocinski, Niels F. W. Voorneveld:
Parametric Iteration in Resource Theories. 29:1-29:23 - Rafael Dewes, Rayna Dimitrova:
Reward Interfaces with Best-Effort Implementations. 30:1-30:23 - Étienne André, Swen Jacobs, Engel Lefaucheux:
Parametric Disjunctive Timed Networks. 31:1-31:24 - Guy Avni, Suman Sadhukhan:
Mean-Payoff and Energy Discrete-Bidding Games. 32:1-32:18 - Isa Vialard:
Deciding the Value of Two-Clock Almost Non-Zeno Weighted Timed Games. 33:1-33:21 - Yoav Feinstein, Orna Kupferman:
Memory Requirements in Non-Zero-Sum Games. 34:1-34:23 - Sebastian Pfau:
Boolean Basis and Succinctness of Modal Logic via Hella-Vilander Games. 35:1-35:22 - Gregoire Fournier, György Turán:
A Game for Counting Logic Formula Size and an Application to Linear Orders. 36:1-36:22 - Valentin Pasquale, Álvaro García-Pérez:
Towards the Type Safety of Pure Subtype Systems. 37:1-37:16 - Daniël Otten, Matteo Spadetto:
The Biequivalence of Path Categories and Axiomatic Martin-Löf Type Theories. 38:1-38:23 - Yoan Géran:
A Canonical Form for Universe Levels in Impredicative Type Theory. 39:1-39:21 - Thorsten Altenkirch, Ambrus Kaposi, Szumi Xie:
The Groupoid-Syntax of Type Theory Is a Set. 40:1-40:23 - Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté, Florent R. Madelaine:
Weakly-Sparse and Strongly Flip-Flat Classes of Graphs Are Uniformly Almost-Wide. 41:1-41:14 - Stéphane Demri, Tianwen Gu:
Robustness of Constraint Automata for Description Logics with Concrete Domains. 42:1-42:18 - Emily Clement, Enzo Erlich, Jérémy Ledent:
Kamp Theorem for Pomset Languages of Higher Dimensional Automata. 43:1-43:22 - Jan Martens:
Minimal DFAs Witnessing Language Inequivalence. 44:1-44:16 - Samuel Graepler, Benjamin Monmege, Jean-Marc Talbot:
Reasoning About Quality in Hyperproperties. 45:1-45:18 - Nachiappan Valliappan:
Lax Modal Lambda Calculi. 46:1-46:20 - Pablo Barenbaum, Delia Kesner, Mariana Milicich:
Useful Call-by-Value: A Semantic Interpretation via Quantitative Types. 47:1-47:24 - Robert Furber, Radu Mardare, Prakash Panangaden, Dana S. Scott:
Interpreting Lambda Calculus in Domain-Valued Random Variables. 48:1-48:20
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-17 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
