default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID34th LICS 2020: Saarbrücken, Germany
- Holger Hermanns
, Lijun Zhang, Naoki Kobayashi, Dale Miller:
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020. ACM 2020, ISBN 978-1-4503-7104-9 - Jérôme Leroux:
When Reachability Meets Grzegorczyk. 1-6 - Viviana Bono, Mariangiola Dezani-Ciancaglini:
A tale of intersection types. 7-20 - Erich Grädel:
Automatic Structures: Twenty Years Later. 21-34 - Brigitte Pientka:
Contextual Types, Explained: Invited Tutorial. 35-37 - Matteo Acclavio, Ross Horne, Lutz Straßburger:
Logic Beyond Formulas: A Proof System on Graphs. 38-52 - Benedikt Ahrens, Paige Randall North, Michael Shulman, Dimitris Tsementzis:
A Higher Structure Identity Principle. 53-66 - Thorsten Altenkirch, Luis Scoccola:
The Integers as a Higher Inductive Type. 67-73 - Rajeev Alur, Yu Chen, Kishor Jothimurugan, Sanjeev Khanna:
Space-efficient Query Evaluation over Probabilistic Event Streams. 74-87 - Nathanael Arkor, Marcelo Fiore:
Algebraic models of simple type theories: A polynomial approach. 88-101 - Pranav Ashok, Krishnendu Chatterjee, Jan Kretínský, Maximilian Weininger, Tobias Winkler:
Approximating Values of Generalized-Reachability Stochastic Games. 102-115 - Arthur Azevedo de Amorim, Matt Fredrikson, Limin Jia:
Reconciling noninterference and gradual typing. 116-129 - A. R. Balasubramanian:
Complexity of controlled bad sequences over finite sets of Nd. 130-140 - Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, Mahesh Viswanathan:
Deciding Differential Privacy for Programs with Finite Inputs and Outputs. 141-154 - Gilles Barthe, Charlie Jacomme, Steve Kremer:
Universal equivalence and majority of probabilistic programs over finite fields. 155-166 - Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti:
Modal Logics with Composition on Finite Forests: Expressivity and Complexity. 167-180 - Francesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea:
A Hennessy-Milner Theorem for ATL with Imperfect Information. 181-194 - Raphaël Berthon, Shibashis Guha, Jean-François Raskin:
Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes. 195-208 - Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution. 209-223 - Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. 224-236 - Manuel Bodirsky, Wied Pakusa, Jakub Rydval:
Temporal Constraint Satisfaction Problems in Fixed-Point Logic. 237-251 - Mikolaj Bojanczyk, Amina Doumane:
First-order tree-to-tree functions. 252-265 - Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche:
Extensions of ω-Regular Languages. 266-272 - Peio Borthelle, Tom Hirschowitz, Ambroise Lafont:
A Cellular Howe Theorem. 273-286 - Jendrik Brachter, Pascal Schweitzer:
On the Weisfeiler-Leman Dimension of Finite Groups. 287-300 - Angelos Charalambidis, Giannos Chatziagapis, Panos Rondogiannis:
A Fixed Point Theorem on Lexicographic Lattice Structures. 301-311 - Dmitry Chistikov, Mikhail N. Vyalyi:
Re-pairing brackets. 312-326 - Gianluca Curzi, Michele Pagani:
The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name. 327-340 - Wojciech Czerwinski, Georg Zetzsche:
An Approach to Regular Separability in Vector Addition Systems. 341-354 - Jim de Groot, Dirk Pattinson:
Modal Intuitionistic Logics as Dialgebraic Logics. 355-369 - Thomas Ehrhard:
Cones as a model of intuitionistic linear logic. 370-383 - Grzegorz Fabianski, Michal Skrzypczak, Szymon Torunczyk:
Uniformisations of Regular Relations Over Bi-Infinite Words. 384-396 - John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani:
One-Clock Priced Timed Games are PSPACE-hard. 397-409 - Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler:
Lower Bounds for QBFs of Bounded Treewidth. 410-424 - Marcelo Fiore, Philip Saville:
Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure. 425-439 - Peng Fu, Kohei Kishida, Peter Selinger:
Linear Dependent Type Theory for Quantum Programming Languages: Extended Abstract. 440-453 - Alexandre Goy, Daniela Petrisan:
Combining probabilistic and non-deterministic choice via weak distributive laws. 454-464 - Clemens Grabmayer, Wan J. Fokkink:
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity. 465-478 - Julien Grange:
Successor-Invariant First-Order Logic on Classes of Bounded Degree. 479-491 - Daniel Gratzer, G. A. Kavvos, Andreas Nuyts, Lars Birkedal:
Multimodal Dependent Type Theory. 492-506 - Martin Grohe:
Counting Bounded Tree Depth Homomorphisms. 507-520 - Stefan Göller, Pawel Parys:
Bisimulation Finiteness of Pushdown Systems Is Elementary. 521-534 - Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. 535-549 - Miika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema:
Descriptive complexity of real computation and probabilistic independence logic. 550-563 - Hugo Herbelin, Étienne Miquey:
A calculus of expandable stores: Continuation-and-environment-passing style translations. 564-577 - Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski:
Intermediate problems in modular circuits satisfiability. 578-590 - Russell Impagliazzo, Sasank Mouli, Toniann Pitassi:
The Surprising Power of Constant Depth Algebraic Proofs. 591-603 - Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu:
Interaction Laws of Monads and Comonads. 604-618 - Delia Kesner, Pierre Vial:
Consuming and Persistent Types for Classical Logic. 619-632 - Jérémie Koenig, Zhong Shao:
Refinement-Based Game Semantics for Certified Abstraction Layers. 633-647 - András Kovács, Ambrus Kaposi:
Large and Infinitary Quotient Inductive-Inductive Types. 648-661 - Nicolai Kraus, Jakob von Raumer:
Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type Theory. 662-675 - Antonín Kucera, Jérôme Leroux, Dominik Velan:
Efficient Analysis of VASS Termination Complexity. 676-688 - Karoliina Lehtinen, Martin Zimmermann:
Good-for-games ω-Pushdown Automata. 689-702 - Nathan Lhote:
Pebble Minimization of Polyregular Functions. 703-712 - Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
The Complexity of Dynamic Data Race Prediction. 713-727 - Kuldeep S. Meel, S. Akshay:
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. 728-741 - Paul-André Melliès, Léo Stefanesco:
Concurrent Separation Logic Meets Template Games. 742-755 - Matthew Moore, Taylor Walenczyk:
The Hidden Subgroup Problem for Universal Algebras. 756-767 - Thomas Powell:
On the computational content of Zorn's lemma. 768-781 - Pierre-Marie Pédrot:
Russian Constructivism in a Prefascist Theory. 782-794 - Revantha Ramanayake:
Extended Kripke lemma and decidability for hypersequent substructural logics. 795-806 - Christian Sattler, Andrea Vezzosi:
Partial Univalence in n-truncated Type Theory. 807-819 - Peter Schuster, Daniel Misselbeck-Wessel:
Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem. 820-830 - Salomon Sickert, Javier Esparza:
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. 831-844 - Kristina Sojakova, Floris van Doorn, Egbert Rijke:
Sequential Colimits in Homotopy Type Theory. 845-858 - Cong Tian, Wensheng Wang, Zhenhua Duan:
Making Streett Determinization Tight. 859-872 - Szymon Torunczyk, Thomas Zeume:
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. 873-885 - Takeshi Tsukada:
On Computability of Logical Approaches to Branching-Time Property Verification of Programs. 886-899 - Henning Urbat, Lutz Schröder:
Automata Learning: An Algebraic Approach. 900-914 - Matthew Z. Weaver, Daniel R. Licata:
A Constructive Model of Directed Univalence in Bicubical Sets. 915-928 - Niels van der Weide:
Constructing Higher Inductive Types as Groupoid Quotients. 929-943 - Abraham Westerbaan, Bas Westerbaan, John van de Wetering:
A characterisation of ordered abstract probabilities. 944-957 - Michal Wrona:
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width. 958-971
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 2025-02-20 19:47 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:
