Home Committees Registration Social Scientific Schedule Venue
Scientific Program

Invited speakers
Conference proceedings
Accepted papers

Invited speakers:

Véronique Cortier, LORIA, France cortier-picture

Title: Verification of security protocols

Short Bio (Photo Copyright: Inria / Photo Kaksonen): Véronique Cortier is CNRS research director at Loria (Nancy, France). In 2003, she received her Ph.D. degree in Computer Science from the École Normale Supérieure de Cachan, from which she graduated. Her research focuses on formal verification of security protocols, in particular e-voting, using formal techniques such as first order logic or rewriting. She has co-authored more than 80 publications on these topics. She is editorial member of TOPS, JCS, and FnT in Security and Privacy and she has been member of the steering commitee of CSF and POST. In 2010, she was awarded an ERC starting grant and in 2015, she received the INRIA - Académie des Sciences young researcher award.

Anuj Dawar, University of Cambridge, UK dawar-picture

Title: Symmetric computation

Short Bio: Anuj Dawar is the Professor of Logic and Algorithms at the University of Cambridge, where he has been a member of the faculty since January 1999. His research interests focus on understanding the limits of algorithmic methods in solving hard problems, through the lens of logical definability. B He is especially interested in developing a suite of logical, combinatorial and algebraic methods for understanding computational complexity. He obtained a PhD from the University of Pennsylvania in 1993. B He worked as a post-doctoral researcher and a lecturer at Swansea University before moving to Cambridge in 1999. He served from 2013-17 as president of the European Association for Computer Science Logic. He is a Fellow of the Alan Turing Institute in London.

Artur Jeż, University of Wroclaw, Poland jez-picture

Title: Solving word equations (and other unification problems) by recompression

Short Bio: Artur Jeż graduated mathematics and computer science at the University of Wroclaw in 2006. He pursued his PhD at the same University under the supervision of Krzysztof Loryś and Alexander Okhotin. He completed his PhD thesis on connections between Conjunctive Grammars and Equations over Sets of Natural Numbers in 2010. He was employed as assistant professor at the University of Wroclaw in 2010–2012 and then he was a postdoc at Max Planck Institute for Computer Science (Saarbruecken, Germany) in 2012-14, most of the time as a Humboldt Foundation fellow. Afterwards he returned to Wroclaw, in 2015 he received habilitation and since 2018 he is an associate professor. In recent years Artur Jeż is mostly interested in grammar compression and its connections to word equations and similar topics.

Delia Kesner, University Paris Diderot, France kesner-picture

Title: Reasoning about Dynamic Properties of Classical Term Calculi

Short Bio (Photo Copyright: Yoan Di Cosmo): Delia Kesner is full professor in Computer Science at the University of Paris 7 (IRIF) and senior member of Institut Universitare de France (IUF). She obtained a PhD from University Paris 11 in 1993, where she has been assistant professor until 2002, before moving to the University of Paris 7.  Her research interests fit in the broad field of theory of programming languages, including topics such as lambda-calculus, theory of rewriting, proof theory, linear logic and type theory. She is currently steering committee chair of the International Conference on Formal Structures for Computation and Deduction (FSCD), as well as of the French Spring School on Theoretical Computer Science (EPIT). She (co)founded and (co)directed (1996-2011) the French CNRS-GDR-IM research group on Logic, Algebra and Computation (LAC), gathering more than 150 researchers working on these topics.  In 2011 she (co)founded and (co)directed the French-Argentinian Laboratory in Computer Science, working on Systems, logIcs, laNguages, Foundations of computatIon and verificatioN (SINFIN), early known as INFINIS.  In 2016, she received the RAICES award from the Argentinian Ministry of Research for her contribution to strengthen international scientific cooperation in Computer Science.

Iddo Tzameret, Royal Holloway, UK tzameret-picture

Title: From classical proof theory to P vs. NP: a guide to bounded theories

Short Bio: Iddo Tzameret's research lies broadly in the foundations of computer science with a primary focus on computational complexity theory, aiming to understand the limits of efficient computation, both as a natural and a mathematical phenomenon. His work comprises of contributions to the field of satisfiability and the advancement of logical, algebraic and combinatorial methods in complexity, including notable contributions in the development of algebraic approaches in proof complexity. From 2014 Iddo is a faculty member in the Computer Science department at Royal Holloway, University of London. Prior to that he served as an Assistant Professor at Tsinghua University, Beijing. He obtained his PhD in 2009 from Tel Aviv University and was subsequently awarded a postdoctoral fellowship by the Eduard Cech Center for Algebra and Geometry, Prague.

Conference Proceedings:

The conference proceedings of CSL 2020 are published as volume 152 of LIPIcs and DOI: http://www.dagstuhl.de/dagpub/978-3-95977-132-0.

Accepted papers:

Generalized Connectives for Multiplicative Linear Logic
Matteo Acclavio, Roberto Maieli

On free completely iterative algebras
Jiří Adámek

Strongly Unambiguous Büchi Automata Are Polynomially Predictable with Membership Queries
Dana Angluin, Timos Antonopoulos, Dana Fisman

A Robust Class of Linear Recurrence Sequences
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki

Coverage and Vacuity in Network Formation Games
Gili Bielous, Orna Kupferman

A complete axiomatisation of a fragment of language algebra
Paul Brunet

Proof complexity of systems of (non-deterministic) decision trees and branching programs
Sam Buss, Anupam Das, Alexander Knop

Internal Parametricity for Cubical Type Theory
Evan Cavallo, Robert Harper

Unifying Cubical Models of Univalent Type Theory
Evan Cavallo, Anders Mörtberg, Andrew W. Swan

FO-Definability of Shrub-Depth
Yijia Chen, Jörg Flum

Taylor expansion for Call-By-Push-Value
Jules Chouquet, Christine Tasson

Tangent Categories from the Coalgebras of Differential Categories
Robin Cockett, Jean-Simon Lemay, Rory Lucyshyn-Wright

Reverse derivative categories
Robin Cockett, Geoffrey Cruttwell, Jonathan Gallagher, Jean-Simon Lemay, Benjamin MacAdam, Gordon Plotkin, Dorette Pronk

Internal Calculi for Separation Logics
Stéphane Demri, Etienne Lozes, Alessio Mansutti

Monitoring Event Frequencies
Thomas Ferrère, Thomas A. Henzinger, Bernhard Kragl

Automatic equivalence structures of polynomial growth
Moses Ganardi, Bakhadyr Khoussainov

Guarded Teams: The Horizontally Guarded Case
Erich Grädel, Martin Otto

Order-Invariant First-Order Logic over Hollow Trees
Julien Grange, Luc Segoufin

Glueability of resource proof-structures: inverting the Taylor expansion
Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora De Falco

On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics
Matthias Hoelzel, Richard Wilke

Expressive Logics for Coinductive Predicates
Clemens Kupke, Jurriaan Rot

State Space Reduction For Parity Automata
Christof Löding, Andreas Tollkötter

Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents
Tim Lyon, Alwen Tiu, Rajeev Goré, Ranald Clouston

The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas
Corto Mascle, Martin Zimmermann

Revisiting the duality of computation: an algebraic analysis of classical realizability models
Étienne Miquey

Separation and Renaming in Nominal Sets
Joshua Moerman, Jurriaan Rot

Parity Games: Another View on Lehtinen's Algorithm
Paweł Parys

De Jongh's Theorem for Intuitionistic Zermelo-Fraenkel Set Theory
Robert Passmann

Computing Haar Measures
Arno Pauly, Dongseong Seon, Martin Ziegler

The call-by-value lambda-calculus with generalized applications
Jose Espirito Santo

Dynamic Complexity Meets Parameterised Algorithms
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis

Dynamic Complexity of Parity Exists Queries
Nils Vortmeier, Thomas Zeume