default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th CSL 2020: Barcelona, Spain
- Maribel Fernández, Anca Muscholl:
28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain. LIPIcs 152, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-132-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Véronique Cortier:
Verification of Security Protocols (Invited Talk). 1:1-1:2 - Anuj Dawar
:
Symmetric Computation (Invited Talk). 2:1-2:12 - Artur Jez:
Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk). 3:1-3:17 - Delia Kesner, Eduardo Bonelli, Andrés Viso:
Strong Bisimulation for Control Operators (Invited Talk). 4:1-4:23 - Iddo Tzameret:
From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk). 5:1-5:2 - Matteo Acclavio, Roberto Maieli:
Generalized Connectives for Multiplicative Linear Logic. 6:1-6:16 - Jirí Adámek:
On Free Completely Iterative Algebras. 7:1-7:21 - Dana Angluin, Timos Antonopoulos, Dana Fisman:
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. 8:1-8:17 - Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A Robust Class of Linear Recurrence Sequences. 9:1-9:16 - Gili Bielous, Orna Kupferman:
Coverage and Vacuity in Network Formation Games. 10:1-10:18 - Paul Brunet:
A Complete Axiomatisation of a Fragment of Language Algebra. 11:1-11:15 - Sam Buss, Anupam Das, Alexander Knop:
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. 12:1-12:17 - Evan Cavallo, Robert Harper:
Internal Parametricity for Cubical Type Theory. 13:1-13:17 - Evan Cavallo, Anders Mörtberg, Andrew W. Swan:
Unifying Cubical Models of Univalent Type Theory. 14:1-14:17 - Yijia Chen, Jörg Flum:
FO-Definability of Shrub-Depth. 15:1-15:16 - Jules Chouquet, Christine Tasson:
Taylor expansion for Call-By-Push-Value. 16:1-16:16 - J. Robin B. Cockett, Jean-Simon Pacaud Lemay, Rory B. B. Lucyshyn-Wright:
Tangent Categories from the Coalgebras of Differential Categories. 17:1-17:17 - J. Robin B. Cockett, Geoff S. H. Cruttwell, Jonathan Gallagher, Jean-Simon Pacaud Lemay, Benjamin MacAdam, Gordon D. Plotkin, Dorette Pronk:
Reverse Derivative Categories. 18:1-18:16 - Stéphane Demri, Étienne Lozes, Alessio Mansutti:
Internal Calculi for Separation Logics. 19:1-19:18 - Thomas Ferrère, Thomas A. Henzinger, Bernhard Kragl:
Monitoring Event Frequencies. 20:1-20:16 - Moses Ganardi, Bakhadyr Khoussainov:
Automatic Equivalence Structures of Polynomial Growth. 21:1-21:16 - Erich Grädel, Martin Otto:
Guarded Teams: The Horizontally Guarded Case. 22:1-22:17 - Julien Grange, Luc Segoufin:
Order-Invariant First-Order Logic over Hollow Trees. 23:1-23:16 - Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco:
Glueability of Resource Proof-Structures: Inverting the Taylor Expansion. 24:1-24:18 - Matthias Hoelzel, Richard Wilke:
On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics. 25:1-25:16 - Clemens Kupke, Jurriaan Rot:
Expressive Logics for Coinductive Predicates. 26:1-26:18 - Christof Löding, Andreas Tollkötter:
State Space Reduction For Parity Automata. 27:1-27:16 - Tim Lyon, Alwen Tiu, Rajeev Goré, Ranald Clouston:
Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents. 28:1-28:16 - Corto Mascle, Martin Zimmermann:
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas. 29:1-29:16 - Étienne Miquey:
Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability Models. 30:1-30:18 - Joshua Moerman, Jurriaan Rot:
Separation and Renaming in Nominal Sets. 31:1-31:17 - Pawel Parys:
Parity Games: Another View on Lehtinen's Algorithm. 32:1-32:15 - Robert Paßmann:
De Jongh's Theorem for Intuitionistic Zermelo-Fraenkel Set Theory. 33:1-33:16 - Arno Pauly, Dongseong Seon, Martin Ziegler:
Computing Haar Measures. 34:1-34:17 - José Espírito Santo:
The Call-By-Value Lambda-Calculus with Generalized Applications. 35:1-35:12 - Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis:
Dynamic Complexity Meets Parameterised Algorithms. 36:1-36:17 - Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Parity Exists Queries. 37:1-37:16
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-02 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
