On this page:
Invited Speakers
- Luca Aceto
In search of lost time: Axiomatising parallel composition in process algebras - Martin Grohe
The Logic of Graph Neural Networks - Maurizio Lenzerini
Abstraction in Data Integration - Nadia Polikarpova
Synthesis of safe pointer-manipulating programs - R. Ryan Williams
Complexity Lower Bounds from Algorithm Design
Invited Papers
- Luca Aceto Elli Anastasiadi Valentina Castiglioni Anna Ingólfsdóttir Bas Luttik
In search of lost time: Axiomatising parallel composition in process algebrasMore Information... - Gianluca Cima Marco Console Maurizio Lenzerini Antonella Poggi
Abstraction in Data IntegrationMore Information... - Martin Grohe
The Logic of Graph Neural NetworksMore Information... - R. Ryan Williams
Complexity Lower Bounds from Algorithm DesignMore Information...
Presented Papers
Entries are ordered by surname of first author
- Martín Abadi Gordon D. Plotkin
Smart Choices and the Selection MonadMore Information... - Samson Abramsky Dan Marsden
Comonadic semantics for guarded fragmentsMore Information... - Beniamino Accattoli Andrea Condoluci Claudio Sacerdoti Coen
Strong Call-by-Value is Reasonable, ImplosivelyMore Information... - Beniamino Accattoli Ugo Dal Lago Gabriele Vanoni
The Space of InteractionMore Information... - Antonis Achilleos Mathias Ruggaard Pedersen
Axiomatizations and Computability of Weighted Monadic Second-Order LogicMore Information... - Pedro H. Azevedo de Amorim Dexter Kozen Radu Mardare Prakash Panangaden Michael Roberts
Universal Semantics for the Stochastic λ-CalculusMore Information... - Albert Atserias Phokion G. Kolaitis Wei-Lin Wu
On the Expressive Power of Homomorphism CountsMore Information... - Giorgio Bacci Giovanni Bacci Kim G. Larsen Mirco Tribastone Max Tschaikowski Andrea Vandin
Efficient Local Computation of Differential Bisimulations via Coupling and Up-to MethodsMore Information... - John C. Baez Fabrizio Genovese Jade Master Michael Shulman
Categories of NetsMore Information... - A. R. Balasubramanian Timo Lang Revantha Ramanayake
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural LogicsMore Information... - Philippe Balbiani Martín Diéguez David Fernández-Duque
Some constructive variants of S4 with the finite model propertyMore Information... - Alexandru Baltag Nick Bezhanishvili David Fernández-Duque
The Topological Mu-Calculus: completeness and decidabilityMore Information... - Jialu Bao Simon Docherty Justin Hsu Alexandra Silva
A Bunched Logic for Conditional IndependenceMore Information... - Pablo Barenbaum Teodoro Freund
A Constructive Logic with Classical Proofs and RefutationsMore Information... - Libor Barto Zarathustra Brady Andrei Bulatov Marcin Kozik Dmitriy Zhuk
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSPMore Information... - Libor Barto William J. DeMeo Antoine Mottet
Constraint Satisfaction Problems over Finite StructuresMore Information... - Michael Blondin Tim Leys Filip Mazowiecki Philip Offtermatt Guillermo A. Pérez
Continuous One-Counter AutomataMore Information... - Manuel Bodirsky Thomas Feller Simon Knäuer Sebastian Rudolph
On Logics and Homomorphism ClosureMore Information... - Manuel Bodirsky Bertalan Bodor
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation PropertyMore Information... - Mikolaj Bojanczyk Bartek Klin Joshua Moerman
Orbit-Finite-Dimensional Vector Spaces and Weighted Register AutomataMore Information... - Laura Bozzelli Adriano Peron César Sánchez
Asynchronous Extensions of HyperLTLMore Information... - Nuria Brede Hugo Herbelin
On the logical structure of choice and bar induction principlesMore Information... - Roberto Bruni Roberto Giacobazzi Roberta Gori Francesco Ranzato
A Logic for Locally Complete Abstract InterpretationsMore Information... - Elisabet Burjons Fabian Frei Martin Raszyk
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape AutomataMore Information... - Toby Cathcart Burn Luke Ong Steven J. Ramsay Dominik Wagner
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn ClausesMore Information... - Paolo Capriotti Nils Anders Danielsson Andrea Vezzosi
Higher LensesMore Information... - Titouan Carette Marc de Visme Simon Perdrix
Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite MemoryMore Information... - Rohit Chadha A. Prasad Sistla Mahesh Viswanathan
On Linear Time Decidability of Differential Privacy for Programs with Unbounded InputsMore Information... - Krishnendu Chatterjee Laurent Doyen
Stochastic Processes with Expected Stopping TimeMore Information... - Krishnendu Chatterjee Wolfgang Dvorák Monika Henzinger Alexander Svozil
Symbolic Time and Space Tradeoffs for Probabilistic VerificationMore Information... - Yijia Chen Jörg Flum
Forbidden Induced Subgraphs and the Łoś-Tarski TheoremMore Information... - Liron Cohen Étienne Miquey Ross Tate
Evidenced Frames: A Unifying Framework Broadening Realizability ModelsMore Information... - Luc Dartois Paul Gastin Shankara Narayanan Krishna
SD-Regular Transducer Expressions for Aperiodic TransformationsMore Information... - Anuj Dawar Tomás Jakl Luca Reggio
Lovász-Type Theorems and Game ComonadsMore Information... - Farzaneh Derakhshan Stephanie Balzer Limin Jia
Session Logical Relations for NoninterferenceMore Information... - Alex Dixon Ranko Lazic Andrzej S. Murawski Igor Walukiewicz
Verifying higher-order concurrency with data automataMore Information... - Jan Dreier
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion ClassesMore Information... - Andrej Dudenhefner
The Undecidability of System F Typability and Type Checking for ReductionistsMore Information... - Thomas Ehrhard Farzad Jafar-Rahmani
Categorical models of Linear Logic with fixed points of formulasMore Information... - Jeff Erickson Gabriel Nivasch Junyan Xu
Fusible numbers and Peano ArithmeticMore Information... - Ronald Fagin Jonathan Lenchner Kenneth W. Regan Nikhil Vyas
Multi-Structural Games and Number of QuantifiersMore Information... - Natasha Fernandes Annabelle McIver Carroll Morgan
The Laplace Mechanism has optimal utility for differential privacy over continuous queriesMore Information... - Eric Finster Antoine Allioux Matthieu Sozeau
Types Are Internal ∞-GroupoidsMore Information... - Fedor V. Fomin Petr A. Golovach Dimitrios M. Thilikos
Parameterized Complexity of Elimination Distance to First-Order Logic PropertiesMore Information... - Chase Ford Stefan Milius Lutz Schröder
Behavioural Preorders via Graded MonadsMore Information... - Francesco Gavazzo Claudia Faggian
A Relational Theory of Monadic Rewriting Systems, Part IMore Information... - Maciej Gazda Robert M. Hierons
Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace SemanticsMore Information... - Dan R. Ghica Todd Waugh Ambridge
Global Optimisation with Constructive RealsMore Information... - Rob van Glabbeek Peter Höfner Ross Horne
Assuming Just Enough Fairness to make Session Types Complete for Lock-freedomMore Information... - Jim de Groot Tadeusz Litak Dirk Pattinson
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis ImplicationMore Information... - Amar Hadzihasanovic
The Smash Product of Monoidal TheoriesMore Information... - Tuomas Hakoniemi
Monomial size vsMore Information... - Thomas A. Henzinger N. Ege Saraç
Quantitative and Approximate MonitoringMore Information... - Robin Hirsch Jas Semrl
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary CompositionMore Information... - Daniel Hirschkoff Enguerrand Prebet Davide Sangiorgi
On sequentiality and well-bracketing in the π-calculusMore Information... - Piotr Hofman Marta Juzepczuk Slawomir Lasota Mohnish Pattathurajan
Parikh's theorem for infinite alphabetsMore Information... - Dominic J. D. Hughes Lutz Straßburger Jui-Hsuan Wu
Combinatorial Proofs and Decomposition Theorems for First-order LogicMore Information... - Guilhem Jaber Andrzej S. Murawski
Compositional relational reasoning via operational game semanticsMore Information... - Bart Jacobs
From Multisets over Distributions to Distributions over MultisetsMore Information... - Xiaodong Jia Bert Lindenhovius Michael W. Mislove Vladimir Zamdzhiev
Commutative Monads for Probabilistic Programming LanguagesMore Information... - Jean Christoph Jung Frank Wolter
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable FragmentsMore Information... - Andrew Kenyon-Roberts C.-H. Luke Ong
Supermartingales, Ranking Functions and Probabilistic Lambda CalculusMore Information... - Emanuel Kieronski Sebastian Rudolph
Finite Model Theory of the Triguarded Fragment and Related LogicsMore Information... - Yuichi Komorida Shin-ya Katsumata Clemens Kupke Jurriaan Rot Ichiro Hasuo
Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and ApproximationMore Information... - Nicolai Kraus
Internal ∞-Categorical Models of Dependent Type Theory : Towards 2LTT Eating HoTTMore Information... - Denis Kuperberg
Positive First-order Logic on WordsMore Information... - Orna Kupferman Noam Shenwald
Perspective Multi-Player GamesMore Information... - James Laird
A Compositional Cost Model for the λ-calculusMore Information... - Moritz Lichter
Separating Rank Logic from Polynomial TimeMore Information... - Ting-Wei Lin Chia-Hsuan Lu Tony Tan
Towards a more efficient approach for the satisfiability of two-variable logicMore Information... - Xinxin Liu Tingting Yu
A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State BehavioursMore Information... - Florian Luca Joël Ouaknine James Worrell
Universal Skolem SetsMore Information... - Amaldev Manuel Dhruv Nevatia
An Algebraic Characterisation of First-Order Logic with NeighbourMore Information... - Radu Mardare Prakash Panangaden Gordon D. Plotkin
Fixed-Points for Quantitative Equational LogicsMore Information... - Corto Mascle Christel Baier Florian Funke Simon Jantsch Stefan Kiefer
Responsibility and verification: Importance value in temporal logicsMore Information... - Hernán C. Melgratti Claudio Antares Mezzina G. Michele Pinna
A distributed operational view of Reversible Prime Event StructuresMore Information... - Paul-André Melliès
Asynchronous Template Games and the Gray Tensor Product of 2-CategoriesMore Information... - Balázs F. Mezei Marcin Wrochna Stanislav Zivný
PTAS for Sparse General-Valued CSPsMore Information... - Matteo Mio Ralph Sarkis Valeria Vignudelli
Combining Nondeterminism, Probability, and Termination: Equational and Metric ReasoningMore Information... - Hugo Moeneclaey
Parametricity and Semi-Cubical TypesMore Information... - Ramana Nagasamudram David A. Naumann
Alignment Completeness for Relational Hoare LogicsMore Information... - Federico Olimpieri
Intersection Type DistributorsMore Information... - Bit-complexity in Sums-of-Squares and Polynomial Calculus. 1-7 Fedor Part Neil Thapen Iddo Tzameret
First-Order Reasoning and Efficient Semi-Algebraic ProofsMore Information... - Paolo Pistone
On Generalized Metric Spaces for the Simply Typed Lambda-CalculusMore Information... - Preey Shah Aman Bansal S. Akshay Supratik Chakraborty
A Normal Form Characterization for Efficient Boolean Skolem Function SynthesisMore Information... - Dario Stein Sam Staton
Compositional Semantics for Probabilistic Programs with Exact ConditioningMore Information... - Jonathan Sterling Carlo Angiuli
Normalization for Cubical Type TheoryMore Information... - Jamie Tucker-Foltz
Inapproximability of Unique Games in Fixed-Point Logic with CountingMore Information... - Rineke Verbrugge
Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all framesMore Information... - Li Zhou Gilles Barthe Justin Hsu Mingsheng Ying Nengkun Yu
A Quantum Interpretation of Bunched Logic and Quantum Separation LogicMore Information... - Dmitriy Zhuk
No-Rainbow Problem and the Surjective Constraint Satisfaction ProblemMore Information...
Organizers
General ChairDale Miller Program ChairLeonid Libkin Conference ChairDaniele Gorla Publicity ChairSam Staton Workshops Chair
Frederic Blanqui |
Program Committee:Christoph Berkholz (Humboldt-University Berlin); Meghyn Bienvenu (CNRS, University of Bordeaux); Filippo Bonchi (University of Pisa); Véronique Bruyere@Bruyère (University of Mons); Yu-Fang Chen (Academia Sinica); Dmitry Chistikov (University of Warwick); Silvia Crafa (University of Padova); Amina Doumane (CNRS-ENS de Lyon); Stéphanie Delaune (University Rennes, CNRS, IRISA); Ekaterina Fokina (TU Wien); Marco Gaboardi (Boston University); Adria Gascon (Google UK); Lauri Hella (Tampere University); Ekaterina Komendantskaya (Heriott-Watt University); Benoit Larose (UQAM, Montréal); Jérôme Leroux (CNRS, University of Bordeaux); Leonid Libkin (Univ. of Edinburgh/ENS-Paris); Wim Martens (University of Bayreuth); Peter OHearn@O’Hearn (UCL/Facebook); Daniela Petrisan (Université de Paris, CNRS, IRIF); Miguel Romero (Universidad Adolfo Ibáñez); Philippe Schnoebelen (CNRS and ENS Paris-Saclay); Olivier Serre (Université de Paris, CNRS, IRIF); Sebastian Siebertz (University of Bremen); Kristina Sojakova (INRIA); Alwen Tiu (Australian National University); Patrick Totzke (University of Liverpool); Szymon Torunczyk (University of Warsaw); Takeshi Tsukada (University of Tokyo); Jamie Vicary (University of Cambridge); Michael Zakharyaschev (Birkbeck); Anna Zamansky (Haifa University); Georg Zetzsche (Max Planck Institute for Software Systems); Thomas Zeume (Ruhr-Universität Bochum) |