10.1145/acmotherconferences
ACM Other Conferences
0000000
10.5555/0000000
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
CSL 2020
Fernández
Maribel
King’s College London, UK
maribel.fernandez@kcl.ac.uk
Editor
Muscholl
Anca
University of Bordeaux, France
anca@labri.fr
Editor
06
01
2020
9783959771320
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
PUB7509
Germany
2020
13
01
2020
16
01
2020
CSL 2020: 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
CSL 2020
Verification of Security Protocols (Invited Talk)
10.4230/LIPIcs.CSL.2020.1
1
Symmetric Computation (Invited Talk)
10.4230/LIPIcs.CSL.2020.2
2
Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk)
10.4230/LIPIcs.CSL.2020.3
3
Strong Bisimulation for Control Operators (Invited Talk)
10.4230/LIPIcs.CSL.2020.4
4
From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk)
10.4230/LIPIcs.CSL.2020.5
5
Generalized Connectives for Multiplicative Linear Logic
10.4230/LIPIcs.CSL.2020.6
6
On Free Completely Iterative Algebras
10.4230/LIPIcs.CSL.2020.7
7
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries
10.4230/LIPIcs.CSL.2020.8
8
A Robust Class of Linear Recurrence Sequences
10.4230/LIPIcs.CSL.2020.9
9
Coverage and Vacuity in Network Formation Games
10.4230/LIPIcs.CSL.2020.10
10
A Complete Axiomatisation of a Fragment of Language Algebra
10.4230/LIPIcs.CSL.2020.11
11
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
10.4230/LIPIcs.CSL.2020.12
12
Internal Parametricity for Cubical Type Theory
10.4230/LIPIcs.CSL.2020.13
13
Unifying Cubical Models of Univalent Type Theory
10.4230/LIPIcs.CSL.2020.14
14
FO-Definability of Shrub-Depth
10.4230/LIPIcs.CSL.2020.15
15
Taylor expansion for Call-By-Push-Value
10.4230/LIPIcs.CSL.2020.16
16
Tangent Categories from the Coalgebras of Differential Categories
10.4230/LIPIcs.CSL.2020.17
17
Reverse Derivative Categories
10.4230/LIPIcs.CSL.2020.18
18
Internal Calculi for Separation Logics
10.4230/LIPIcs.CSL.2020.19
19
Monitoring Event Frequencies
10.4230/LIPIcs.CSL.2020.20
20
Automatic Equivalence Structures of Polynomial Growth
10.4230/LIPIcs.CSL.2020.21
21
Guarded Teams: The Horizontally Guarded Case
10.4230/LIPIcs.CSL.2020.22
22
Order-Invariant First-Order Logic over Hollow Trees
10.4230/LIPIcs.CSL.2020.23
23
Glueability of Resource Proof-Structures: Inverting the Taylor Expansion
10.4230/LIPIcs.CSL.2020.24
24
On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics
10.4230/LIPIcs.CSL.2020.25
25
Expressive Logics for Coinductive Predicates
10.4230/LIPIcs.CSL.2020.26
26
State Space Reduction For Parity Automata
10.4230/LIPIcs.CSL.2020.27
27
Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents
10.4230/LIPIcs.CSL.2020.28
28
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas
10.4230/LIPIcs.CSL.2020.29
29
Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability Models
10.4230/LIPIcs.CSL.2020.30
30
Separation and Renaming in Nominal Sets
10.4230/LIPIcs.CSL.2020.31
31
Parity Games: Another View on Lehtinen’s Algorithm
10.4230/LIPIcs.CSL.2020.32
32
De Jongh’s Theorem for Intuitionistic Zermelo-Fraenkel Set Theory
10.4230/LIPIcs.CSL.2020.33
33
Computing Haar Measures
10.4230/LIPIcs.CSL.2020.34
34
The Call-By-Value Lambda-Calculus with Generalized Applications
10.4230/LIPIcs.CSL.2020.35
35
Dynamic Complexity Meets Parameterised Algorithms
10.4230/LIPIcs.CSL.2020.36
36
Dynamic Complexity of Parity Exists Queries
10.4230/LIPIcs.CSL.2020.37
37