LICS - RankMe – RankMe

74 papers

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