CSL 2022

February 14-19, Georg-August-Universität, Göttingen


Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL).

It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science.

CSL'22 will be held online on February 14 - 19, 2022. The event is hosted by the University of Göttingen.

Invited Speakers

  • Udi Boker

    Invited Talk

    Udi Boker

    Udi Boker is Professor of Computer Science at the Interdisciplinary Center (IDC) Herzliya, Israel. He specializes in logic, formal verification, computational models, game theory, and automata theory. He received his PhD in computer science from the Tel-Aviv University, and did postdoctoral research in the Hebrew University and in the Institute of Science and Technology (IST) Austria. Prior to joining the academy, he served as an R&D Director in the Hi-Tech company Mercury Interactive, initiating and leading the area of load-testing over the Internet.

  • Martin Escardo

    Invited Talk

    Martin Escardo

    Martín Escardó is a Professor of Theoretical Computer Science at the School of Computer Science of the University of Birmingham, UK. His research interests include topology, locale theory, domain theory, game theory, homotopy type theory, formalization of mathematics, constructive mathematics. He studied at UFRGS, Brazil, and received a PhD from Imperial College, London. Before joining Birmingham, he was a lecturer at the universities of Edinburgh and St Andrews in Scotland.

  • Rosalie Iemhoff

    Invited Talk

    Rosalie Iemhoff

    Rosalie Iemhoff is a professor at Utrecht University, the Netherlands, specializing in mathematical and philosophical logic, with a special interest in proof theory, its aims and its methods. Rosalie studied mathematics at the University of Amsterdam, and obtained a PhD in mathematical logic at the same university in 2001. After spending several years as a postdoc, at the University of California, San Diego, and the Technical University Vienna, she joined the Department of Philosophy at Utrecht University in 2006. In 2018 she received a large grant for a five year research project Optimal Proofs on the proof theory of logics. Rosalie is one of the editor’s in chief of the Journal of Philosophical Logic.

  • Karen Lange

    Invited Talk

    Karen Lange

    Karen Lange is an associate professor of mathematics at Wellesley College. Her research is in computability theory; she studies the ''balance scales'' used to calibrate computational information and applies these tools to measure the difficulty of algebraic problems. She earned her undergraduate degree at Swarthmore College and her doctoral degree at the University of Chicago, and she completed an NSF Postdoctoral Fellowship at the University of Notre Dame.

  • Annabelle McIver

    Invited Talk

    Annabelle McIver

    Annabelle McIver is a professor of Computer Science at Macquarie University in Sydney. Annabelle trained as a mathematician at Cambridge and Oxford Universities. Her research uses mathematics to prove quantitative properties of programs, and more recently to provide foundations for quantitative information flow for analysing security properties. She is co-author of the book ''Abstraction, Refinement and Proof for Probabilistic Systems'', and ''The Science of Quantitative Information Flow''.


Important Dates

July 5, 2021 (AoE) - Abstract submission
July 12, 2021 (AoE) - Paper Submission
September 30, 2021 - Notification
October 29, 2021 - Final Version Deadline
February 14-19, 2022 - Conference [Online]

Submission guidelines

Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC.

The papers should be submitted via easychair here.

The CSL 2022 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs), see here.

Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (not including references), presenting unpublished work fitting the scope of the conference. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal.

Papers authored or co-authored by members of the PC are not allowed.

At least one of the authors of each accepted paper is expected to register for the conference and attend it in person or online, in order to present their papers.


The Helena Rasiowa Award is the best student paper award for the CSL conference series, starting from CSL 2022. The award will be given to the best paper (as decided by the PC) written solely by students or for which students were the main contributors. A student in this context is any person who is currently studying for a degree or whose PhD award date is less than one year prior to the first day of the conference. Read more about the contribution of Helena Rasiowa to logic and computer science, and their interplay, here.

List of topics

automated deduction and interactive theorem proving
constructive mathematics and type theory
equational logic and term rewriting
automata and games, game semantics
modal and temporal logic
model checking
decision procedures
logical aspects of computational complexity
finite model theory
computational proof theory
logic programming and constraints
lambda calculus and combinatory logic
domain theory
categorical logic and topological semantics
database theory
specification, extraction and transformation of programs
logical aspects of quantum computing
logical foundations of programming paradigms
verification and program analysis
linear logic
higher-order logic
nonmonotonic reasoning

Program Committee

Thorsten Altenkirch (Nottingham, UK)
Benedikt Bollig (Cachan, France)
Agata Ciabattoni (Vienna, Austria)
Liron Cohen (Ben-Gurion University, Israel)
Anupam Das (Birmingham, UK)
Claudia Faggian (Paris, France)
Francesco Gavazzo (Bologna, Italy)
Stefan Göller (Kassel, Germany)
Willem Heijltjes (Bath, UK)
Sandra Kiefer (Aachen, Germany)
Emanuel Kieronski (Wroclaw, Poland)
Bartek Klin (Warsaw, Poland)
Juha Kontinen (Helsinki, Finland)
Anthony Lin (Kaiserslautern, Germany)
Karoliina Lehtinen (Marseille, France)
Florin Manea (Göttingen, Germany, co-chair)
Fredrik Nordvall Forsberg (Strathclyde, UK)
Liat Peterfreund (Paris, France and Edinburgh, UK)
Daniela Petrisan (Paris, France)
Karin Quaas (Lepizig)
Alex Simpson (Ljubljana, Slovenia, co-chair)
Pawel Sobocinski (Tallin, Estonia)
Ana Sokolova (Salzburg, Austria)
Linda Brown Westrick (Connecticut, US)

Organization Committee

Fundamentals of Computer Science Group at University of Göttingen, Germany. Maria Kosche, Tore Koß, Florin Manea (chair), Patricia Nitzke, Viktoriya Pak, Stefan Siemer.


Please send all questions about submissions to the PC co-chairs: csl2022@easychair.org


Affiliated Workshops

The Twenty Second International Workshop on Logic and Computational Complexity LCC 2022.
The Logic Mentoring Workshop @ CSL.



Accepted papers

Lê Thành Dũng Nguyễn and Lutz Straßburger. BV and Pomset Logic are not the same
Liang-Ting Chen and Hsiang-Shang Ko. Realising Intensional S4 and GL Modalities
Andrej Dudenhefner. Constructive Many-one Reduction from the Halting Problem to Semi-unification
Matthew de Brecht. Constructing the space of valuations of a quasi-Polish space as a space of ideals
Gonzague Yernaux and Wim Vanhoof. Anti-unification of Unordered Goals
Guillaume Brunerie, Axel Ljungström and Anders Mörtberg. Synthetic Integral Cohomology in Cubical Agda
David Fernández-Duque and Yoàv Montacute. Dynamic Cantor Derivative Logic
Paulin Jacobé De Naurois. Parallelism in Soft Linear Logic
Antonio Abu Nassar and Shaull Almagor. Simulation by Rounds of Letter-to-Letter Transducers
Jacobo Torán and Florian Wörz. Number of Variables for Graph Identification and the Resolution of GI Formulas
Martin Baillon, Assia Mahboubi and Pierre-Marie Pédrot. Gardening with the Pythia
Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz and Jeffrey Shallit. Decidability for Sturmian words
Emile Hazard and Denis Kuperberg. Cyclic proofs for transfinite expressions
Ritam Raha and Guillermo Pérez. Revisiting Synthesis for One-Counter Automata
Anuj Dawar and Abhisekh Sankaran. MSO undecidability for some hereditary classes of unbounded clique-width
Antonio Casares. On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions
Delia Kesner and Andrés Ezequiel Viso. Encoding Tight Typing in a Unified Framework
Nicole Schrader, Sebastian Siebertz and Alexandre Vigny. First-Order Logic with Connectivity Operators
Jaroslav Nesetril, Patrice Ossona de Mendez and Sebastian Siebertz. Structural properties of the first-order transduction quasiorder
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier and Jean-Marc Talbot. Weighted Automata and Expressions over Pre-Rational Monoids
Guilhem Jaber and Davide Sangiorgi. Games, mobile processes, and functions
Clemens Kupke, Johannes Marti and Yde Venema. Succinct Graph Representations of mu-Calculus Formulas
Jakub Gajarský, Stephan Kreutzer and Maximilian Gorsky. Differential games, locality, and model checking for FO logic of graphs
Carmen Maria Constantin, Nuiok Dicaire and Chris Heunen. Localisable monads
Dana Fisman, Hadar Frenkel and Sandra Zilles. Inferring Symbolic Automata
Fredrik Dahlqvist and Renato Neves. An Internal Language for Categories Enriched over Generalised Metric Spaces
Léonard Brice, Jean-Francois Raskin and Marie Van Den Bogaard. On the complexity of SPEs in parity games
Beniamino Accattoli and Maico Leberle. Useful Open Call-by-Need
Haruka Tomita. Planar realizability via left and right applications
Davide Castelnovo and Marino Miculan. Fuzzy algebraic theories
Benjamin Bordais, Patricia Bouyer and Stephane Le Roux. Optimal strategies in concurrent reachability games
Patricia Bouyer, Stephane Le Roux and Nathan Thomasset. Finite-memory winning strategies in $\Delta^0_2$
András Kovács. Generalized Universe Hierarchies and First-Class Universe Levels
Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch and Ernst-Ruediger Olderog. Global Winning Conditions in Synthesis of Distributed Systems with Causal Memory
Yoshiki Nakamura. Spatial Existential Positive Logics for Hyperedge Replacement Grammars