LICS 2020 and ICALP 2020 will be held online, hosted at Saarland (details).
LICS 2020 Accepted Papers
Multimodal Dependent Type Theory
Good-for-games omega-Pushdown Automata
A Cellular Howe Theorem
Counting Bounded Treedepth Homomorphisms
Russian Constructivism in a Prefascist Theory
The Complexity of Reachability in Affine Vector Addition Systems with States
A characterisation of ordered abstract probabilities
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
A computational interpretation of Zorn's lemma
Universal equivalence and majority on probabilistic programs over finite fields
Space-efficient Query Evaluation over Probabilistic Event Streams
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
Bisimulation Finiteness of Pushdown Systems Is Elementary
Temporal Constraint Satisfaction Problems in Fixed-Point Logic
Efficient Analysis of VASS Termination Complexity
Re-pairing brackets
Complexity of controlled bad sequences over finite sets of $\mathbb{N}^d$
The Surprising Power of Constant Depth Algebraic Proofs
A Higher Structure Identity Principle
Lower Bounds for QBFs of Bounded Treewidth
Making Streett Determinization Tight
On the linear structure of cones
Partial Univalence in n-truncated Type Theory
The Integers as a Higher Inductive Type
Approximating Values of Generalized-Reachability Stochastic Games
Concurrent Separation Logic Meets Template Games
Logic beyond Formulas
The Hidden Subgroup Problem for Universal Algebras
Linear Dependent Type Theory for Quantum Programming Languages
On Computability of Logical Approaches to Branching-Time Property Verification of Programs
Successor-Invariant First-Order Logic on Classes of Bounded Degree
A tier-based typed programming language characterizing Feasible Functionals
Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure
Large and Infinitary Quotient Inductive-Inductive Types
Algebraic models of simple type theories: a polynomial approach
One-Clock Priced Timed Games are PSPACE-hard
Descriptive complexity of real computation and probabilistic independence logic
Consuming and Persistent Types for Classical Logic
Automata Learning: An Algebraic Approach
An Approach to Regular Separability in Vector Addition Systems
Resolving Finite Indeterminacy
Reconciling noninterference and gradual typing
Extensions of $\omega$-Regular Languages
Intermediate problems in modular circuits satisfiability
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width
Uniformisations of regular relations over bi-infinite words
The Complexity of Dynamic Data Race Prediction
A Hennessy-Milner Theorem for ATL with Imperfect Information
First-order tree-to-tree functions
On the Weisfeiler-Leman Dimension of Finite Groups
Modal Logics with Composition on Finite Forests: Expressivity and Complexity
A calculus of expandable stores. Continuation-and-environment-passing style translations
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
A Constructive Model of Type Theory with Directed Univalence in Bicubical Sets
Combining probabilistic and non-deterministic choice via weak distributive laws
Deciding Differential Privacy for Programs with Finite Inputs and Outputs
A Fixed Point Theorem on Lexicographic Lattice Structures
The Benefit of Being Non-Lazy in Probabilistic λ-calculus
Refinement-based game semantics for certified abstraction layers
Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type Theory
Sequential Colimits in Homotopy Type Theory
Extended Kripke lemma and decidability for hypersequent substructural logics
Constructing Finitary 1-Truncated Higher Inductive Types as Groupoid Quotients
Pebble Minimization of Polyregular Functions
Mixing Probabilistic and non-Probabilistic Objectives in MDPs
Modal Intuitionistic Logics as Dialgebraic Logics
Interaction laws of monads and comonads
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.
Website by Sam Staton based on a bootstrap design by Hartmut Eilers and Eric Koskinen.