LICS 2020 and ICALP 2020 will be held online. More info to follow.

LICS 2020 Accepted Papers

Daniel Gratzer, Alex Kavvos, Andreas Nuyts and Lars Birkedal. Multimodal Dependent Type Theory
Karoliina Lehtinen and Martin Zimmermann. Good-for-games omega-Pushdown Automata
Peio Borthelle, Tom Hirschowitz and Ambroise Lafont. A Cellular Howe Theorem
Martin Grohe. Counting Bounded Treedepth Homomorphisms
Pierre-Marie Pédrot. Russian Constructivism in a Prefascist Theory
Michael Blondin and Mikhail Raskin. The Complexity of Reachability in Affine Vector Addition Systems with States
Abraham Westerbaan, Bas Westerbaan and John van de Wetering. A characterisation of ordered abstract probabilities
Salomon Sickert and Javier Esparza. An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
Clemens Grabmayer and Wan Fokkink. A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
Thomas Powell. A computational interpretation of Zorn's lemma
Charlie Jacomme, Steve Kremer and Gilles Barthe. Universal equivalence and majority on probabilistic programs over finite fields
Rajeev Alur, Yu Chen, Kishor Jothimurugan and Sanjeev Khanna. Space-efficient Query Evaluation over Probabilistic Event Streams
Szymon Toruńczyk and Thomas Zeume. Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
Stefan Göller and Paweł Parys. Bisimulation Finiteness of Pushdown Systems Is Elementary
Manuel Bodirsky, Wied Pakusa and Jakub Rydval. Temporal Constraint Satisfaction Problems in Fixed-Point Logic
Antonin Kucera, Jérôme Leroux and Dominik Velan. Efficient Analysis of VASS Termination Complexity
Dmitry Chistikov and Mikhail Vyalyi. Re-pairing brackets
Balasubramanian A.R.. Complexity of controlled bad sequences over finite sets of $\mathbb{N}^d$
Russell Impagliazzo, Sasank Mouli and Toniann Pitassi. The Surprising Power of Constant Depth Algebraic Proofs
Benedikt Ahrens, Paige Randall North, Michael Shulman and Dimitris Tsementzis. A Higher Structure Identity Principle
Johannes K. Fichte, Markus Hecher and Andreas Pfandler. Lower Bounds for QBFs of Bounded Treewidth
Cong Tian, Wensheng Wang and Zhenhua Duan. Making Streett Determinization Tight
Thomas Ehrhard. On the linear structure of cones
Christian Sattler and Andrea Vezzosi. Partial Univalence in n-truncated Type Theory
Thorsten Altenkirch and Luis Scoccola. The Integers as a Higher Inductive Type
Pranav Ashok, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger and Tobias Winkler. Approximating Values of Generalized-Reachability Stochastic Games
Paul-André Melliès and Léo Stefanesco. Concurrent Separation Logic Meets Template Games
Matteo Acclavio, Ross Horne and Lutz Straßburger. Logic beyond Formulas
Matthew Moore and Taylor Walenczyk. The Hidden Subgroup Problem for Universal Algebras
Peng Fu, Kohei Kishida and Peter Selinger. Linear Dependent Type Theory for Quantum Programming Languages
Takeshi Tsukada. On Computability of Logical Approaches to Branching-Time Property Verification of Programs
Julien Grange. Successor-Invariant First-Order Logic on Classes of Bounded Degree
Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion and Romain Péchoux. A tier-based typed programming language characterizing Feasible Functionals
Marcelo Fiore and Philip Saville. Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure
András Kovács and Ambrus Kaposi. Large and Infinitary Quotient Inductive-Inductive Types
Nathanael Arkor and Marcelo Fiore. Algebraic models of simple type theories: a polynomial approach
John Fearnley, Rasmus Ibsen-Jensen and Rahul Savani. One-Clock Priced Timed Games are PSPACE-hard
Miika Hannula, Juha Kontinen, Jan Van den Bussche and Jonni Virtema. Descriptive complexity of real computation and probabilistic independence logic
Delia Kesner and Pierre Vial. Consuming and Persistent Types for Classical Logic
Henning Urbat and Lutz Schröder. Automata Learning: An Algebraic Approach
Wojciech Czerwiński and Georg Zetzsche. An Approach to Regular Separability in Vector Addition Systems
Peter Schuster and Daniel Wessel. Resolving Finite Indeterminacy
Arthur Azevedo de Amorim, Matt Fredrikson and Limin Jia. Reconciling noninterference and gradual typing
Mikołaj Bojańczyk, Edon Kelmendi, Rafał Stefański and Georg Zetzsche. Extensions of $\omega$-Regular Languages
Pawel Idziak, Piotr Kawalek and Jacek Krzaczkowski. Intermediate problems in modular circuits satisfiability
Michał Wrona. On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width
Grzegorz Fabiański, Michał Skrzypczak and Szymon Toruńczyk. Uniformisations of regular relations over bi-infinite words
Umang Mathur, Andreas Pavlogiannis and Mahesh Viswanathan. The Complexity of Dynamic Data Race Prediction
Catalin Dima, Francesco Belardinelli, Vadim Malvone and Ferucio Tiplea. A Hennessy-Milner Theorem for ATL with Imperfect Information
Mikolaj Bojanczyk and Amina Doumane. First-order tree-to-tree functions
Jendrik Brachter and Pascal Schweitzer. On the Weisfeiler-Leman Dimension of Finite Groups
Bartosz Bednarczyk, Stéphane Demri, Raul Fervari and Alessio Mansutti. Modal Logics with Composition on Finite Forests: Expressivity and Complexity
Hugo Herbelin and Étienne Miquey. A calculus of expandable stores. Continuation-and-environment-passing style translations
Olaf Beyersdorff, Joshua Blinkhorn and Meena Mahajan. Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
Matthew Weaver and Daniel R. Licata. A Constructive Model of Type Theory with Directed Univalence in Bicubical Sets
Alexandre Goy and Daniela Petrisan. Combining probabilistic and non-deterministic choice via weak distributive laws
Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla and Mahesh Viswanathan. Deciding Differential Privacy for Programs with Finite Inputs and Outputs
Angelos Charalambidis, Ioannis Chatziagapis and Panos Rondogiannis. A Fixed Point Theorem on Lexicographic Lattice Structures
Gianluca Curzi and Michele Pagani. The Benefit of Being Non-Lazy in Probabilistic λ-calculus
Jérémie Koenig and Zhong Shao. Refinement-based game semantics for certified abstraction layers
Nicolai Kraus and Jakob von Raumer. Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type Theory
Kristina Sojakova, Floris van Doorn and Egbert Rijke. Sequential Colimits in Homotopy Type Theory
Revantha Ramanayake. Extended Kripke lemma and decidability for hypersequent substructural logics
Niels van der Weide. Constructing Finitary 1-Truncated Higher Inductive Types as Groupoid Quotients
Nathan Lhote. Pebble Minimization of Polyregular Functions
Raphaël Berthon, Shibashis Guha and Jean-Francois Raskin. Mixing Probabilistic and non-Probabilistic Objectives in MDPs
Jim de Groot and Dirk Pattinson. Modal Intuitionistic Logics as Dialgebraic Logics
Shin-ya Katsumata, Exequiel Rivas and Tarmo Uustalu. Interaction laws of monads and comonads
S. Akshay and Kuldeep S. Meel. Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice

LICS Sponsorship

The symposium is sponsored by ACM SIGLOG and the IEEE Technical Committee on Mathematical Foundations of Computing.

  • ACM
  • IEEE

Website by Sam Staton based on a bootstrap design by Hartmut Eilers and Eric Koskinen.