1. Home
  2. Proceedings
  3. LICS
  4. LICS 2021
Default Cover Image

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

June 29 2021 to July 2 2021

Rome, Italy

ISBN: 978-1-6654-4895-6

Table of Contents

Front MatterFreely available from IEEE.pp. i-viii
Citations for the Test-of-Time Award from 2001Freely available from IEEE.pp. i-i
Abstraction in Data IntegrationFull-text access may be available. Sign in or learn about subscription options.pp. 1-11
by Gianluca Cima, Marco Console, Maurizio Lenzerini, Antonella Poggi
Complexity Lower Bounds from Algorithm DesignFull-text access may be available. Sign in or learn about subscription options.pp. 1-3
by R. Ryan Williams
In search of lost time: Axiomatising parallel composition in process algebrasFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik
The Logic of Graph Neural NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 1-17
by Martin Grohe
An Algebraic Characterisation of First-Order Logic with NeighbourFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Amaldev Manuel, Dhruv Nevatia
Alignment Completeness for Relational Hoare LogicsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Ramana Nagasamudram, David A. Naumann
Assuming Just Enough Fairness to make Session Types Complete for Lock-freedomFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Rob van Glabbeek, Peter Höfner, Ross Horne
Asynchronous Extensions of HyperLTLFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Laura Bozzelli, Adriano Peron, César Sánchez
Asynchronous Template Games and the Gray Tensor Product of 2-CategoriesFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Paul-André Melliès
Axiomatizations and Computability of Weighted Monadic Second-Order LogicFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Antonis Achilleos, Mathias Ruggaard Pedersen
Behavioural Preorders via Graded MonadsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Chase Ford, Stefan Milius, Lutz Schröder
A Bunched Logic for Conditional IndependenceFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Jialu Bao, Simon Docherty, Justin Hsu, Alexandra Silva
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation PropertyFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Manuel Bodirsky, Bertalan Bodor
Categorical models of Linear Logic with fixed points of formulasFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Thomas Ehrhard, Farzad Jafarrahmani
Categories of NetsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by John C. Baez, Fabrizio Genovese, Jade Master, Michael Shulman
Combinatorial Proofs and Decomposition Theorems for First-order LogicFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Dominic J. D. Hughes, Lutz Straßburger, Jui-Hsuan Wu
Combining Nondeterminism, Probability, and Termination: Equational and Metric ReasoningFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Matteo Mio, Ralph Sarkis, Valeria Vignudelli
Commutative Monads for Probabilistic Programming LanguagesFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Xiaodong Jia, Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev
Comonadic semantics for guarded fragmentsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Samson Abramsky, Dan Marsden
A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State BehavioursFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Xinxin Liu, Tingting Yu
A Compositional Cost Model for the λ-calculusFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by James Laird
Compositional relational reasoning via operational game semanticsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Guilhem Jaber, Andrzej S. Murawski
Compositional Semantics for Probabilistic Programs with Exact ConditioningFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Dario Stein, Sam Staton
Constraint Satisfaction Problems over Finite StructuresFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Libor Barto, William DeMeo, Antoine Mottet
A Constructive Logic with Classical Proofs and RefutationsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Pablo Barenbaum, Teodoro Freund
Continuous One-Counter AutomataFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Perez
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural LogicsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary CompositionFull-text access may be available. Sign in or learn about subscription options.pp. 1-10
by Robin Hirsch, Jaš Šemrl
A distributed operational view of Reversible Prime Event StructuresFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Hernán Melgratti, Claudio Antares Mezzina, G. Michele Pinna
Efficient Local Computation of Differential Bisimulations via Coupling and Up-to MethodsFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Mirco Tribastone, Max Tschaikowski, Andrea Vandin
Evidenced Frames: A Unifying Framework Broadening Realizability ModelsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Liron Cohen, Étienne Miquey, Ross Tate
Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and ApproximationFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Yuichi Komorida, Shin-ya Katsumata, Clemens Kupke, Jurriaan Rot, Ichiro Hasuo
Finite Model Theory of the Triguarded Fragment and Related LogicsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Emanuel Kieroński, Sebastian Rudolph
First-Order Reasoning and Efficient Semi-Algebraic ProofsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Fedor Part, Neil Thapen, Iddo Tzameret
Fixed-Points for Quantitative Equational LogicsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Radu Mardare, Prakash Panangaden, Gordon Plotkin
Forbidden Induced Subgraphs and the Łoś–Tarski TheoremFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Yijia Chen, Jörg Flum
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape AutomataFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Elisabet Burjons, Fabian Frei, Martin Raszyk
From Multisets over Distributions to Distributions over MultisetsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Bart Jacobs
Fusible numbers and Peano ArithmeticFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Jeff Erickson, Gabriel Nivasch, Junyan Xu
Global Optimisation with Constructive RealsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Dan R. Ghica, Todd Waugh Ambridge
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis ImplicationFull-text access may be available. Sign in or learn about subscription options.pp. 1-15
by Jim de Groot, Tadeusz Litak, Dirk Pattinson
Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite MemoryFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Titouan Carette, Marc de Visme, Simon Perdrix
Higher LensesFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Paolo Capriotti, Nils Anders Danielsson, Andrea Vezzosi
Inapproximability of Unique Games in Fixed-Point Logic with CountingFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Jamie Tucker-Foltz
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn ClausesFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Toby Cathcart Burn, Luke Ong, Steven Ramsay, Dominik Wagner
Internal ∞-Categorical Models of Dependent Type Theory : Towards 2LTT Eating HoTTFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Nicolai Kraus
Intersection Type DistributorsFull-text access may be available. Sign in or learn about subscription options.pp. 1-15
by Federico Olimpieri
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion ClassesFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Jan Dreier
The Laplace Mechanism has optimal utility for differential privacy over continuous queriesFull-text access may be available. Sign in or learn about subscription options.pp. 1-12
by Natasha Fernandes, Annabelle McIver, Carroll Morgan
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable FragmentsFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Jean Christoph Jung, Frank Wolter
A Logic for Locally Complete Abstract InterpretationsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato
Lovász-Type Theorems and Game ComonadsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Anuj Dawar, Tomáš Jakl, Luca Reggio
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSPFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk
Monomial size vs. Bit-complexity in Sums-of-Squares and Polynomial CalculusFull-text access may be available. Sign in or learn about subscription options.pp. 1-7
by Tuomas Hakoniemi
Multi-Structural Games and Number of QuantifiersFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas
No-Rainbow Problem and the Surjective Constraint Satisfaction ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 1-7
by Dmitriy Zhuk
A Normal Form Characterization for Efficient Boolean Skolem Function SynthesisFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty
Normalization for Cubical Type TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 1-15
by Jonathan Sterling, Carlo Angiuli
On Generalized Metric Spaces for the Simply Typed Lambda-CalculusFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Paolo Pistone
On Linear Time Decidability of Differential Privacy for Programs with Unbounded InputsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
On Logics and Homomorphism ClosureFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph
A Relational Theory of Monadic Rewriting Systems, Part IFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Francesco Gavazzo, Claudia Faggian
On sequentiality and well-bracketing in the π-calculusFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi
On the Expressive Power of Homomorphism CountsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Albert Atserias, Phokion G. Kolaitis, Wei-Lin Wu
On the logical structure of choice and bar induction principlesFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Nuria Brede, Hugo Herbelin
Orbit-Finite-Dimensional Vector Spaces and Weighted Register AutomataFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Mikołaj Bojańczyk, Bartek Klin, Joshua Moerman
Parameterized Complexity of Elimination Distance to First-Order Logic PropertiesFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Parametricity and Semi-Cubical TypesFull-text access may be available. Sign in or learn about subscription options.pp. 1-11
by Hugo Moeneclaey
Parikh’s theorem for infinite alphabetsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Piotr Hofman, Marta Juzepczuk, Sławomir Lasota, Mohnish Pattathurajan
Perspective Multi-Player GamesFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Orna Kupferman, Noam Shenwald
Positive First-order Logic on WordsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Denis Kuperberg
PTAS for Sparse General-Valued CSPsFull-text access may be available. Sign in or learn about subscription options.pp. 1-11
by Balázs F. Mezei, Marcin Wrochna, Stanislav Živný
Quantitative and Approximate MonitoringFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Thomas A. Henzinger, N. Ege Saraç
A Quantum Interpretation of Bunched Logic & Quantum Separation LogicFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Li Zhou, Gilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu
Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace SemanticsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Maciej Gazda, Robert M. Hierons
Responsibility and verification: Importance value in temporal logicsFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch, Stefan Kiefer
SD-Regular Transducer Expressions for Aperiodic TransformationsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Luc Dartois, Paul Gastin, Shankara Narayanan Krishna
Separating Rank Logic from Polynomial TimeFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Moritz Lichter
Session Logical Relations for NoninterferenceFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Farzaneh Derakhshan, Stephanie Balzer, Limin Jia
Smart Choices and the Selection MonadFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Martín Abadi, Gordon Plotkin
The Smash Product of Monoidal TheoriesFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Amar Hadzihasanovic
Some constructive variants of S4 with the finite model propertyFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Philippe Balbiani, Martín Diéguez, David Fernández-Duque
The Space of InteractionFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni
Stochastic Processes with Expected Stopping TimeFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Krishnendu Chatterjee, Laurent Doyen
Strong Call-by-Value is Reasonable, ImplosivelyFull-text access may be available. Sign in or learn about subscription options.pp. 1-14
by Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen
Supermartingales, Ranking Functions and Probabilistic Lambda CalculusFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Andrew Kenyon-Roberts, C.-H. Luke Ong
Symbolic Time and Space Tradeoffs for Probabilistic VerificationFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, Alexander Svozil
The Topological Mu-Calculus: completeness and decidabilityFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Alexandru Baltag, Nick Bezhanishvili, David Fernández-Duque
Towards a more efficient approach for the satisfiability of two-variable logicFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan
Types Are Internal ∞-GroupoidsFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Eric Finster, Antoine Allioux, Matthieu Sozeau
The Undecidability of System F Typability and Type Checking for ReductionistsFull-text access may be available. Sign in or learn about subscription options.pp. 1-10
by Andrej Dudenhefner
Universal Semantics for the Stochastic λ-CalculusFull-text access may be available. Sign in or learn about subscription options.pp. 1-12
by Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts
Universal Skolem SetsFull-text access may be available. Sign in or learn about subscription options.pp. 1-6
by Florian Luca, Joël Ouaknine, James Worrell
Verifying higher-order concurrency with data automataFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Alex Dixon, Ranko Lazić, Andrzej S. Murawski, Igor Walukiewicz
Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all framesFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Rineke Verbrugge
Showing 97 out of 97