Program

LICS 2021

All times are in the Central European Summer Timezone (CEST), UTC+2, GMT+2

Click here to calculate your local time

15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
Tuesday - 29 June
Tuesday - 29 June
Invited Talk - Martin Grohe
Title: The logic of graph neural networks

Break

Polynomial time, games, and complexity

Separating Rank Logic from Polynomial Time – Moritz Lichter  (KLEENE AWARD)

Inapproximability of Unique Games in Fixed-Point Logic with Counting – Jamie Tucker-Foltz  (KLEENE AWARD)

Multi-Structural Games and Number of Quantifiers – Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan and Nikhil Vyas

Towards a more efficient approach for the satisfiability of two-variable logic – Ting-Wei Lin, Chia-Hsuan Lu and Tony Tan

Initial limit Datalog: a new extensible class of decidable constrained Horn clauses – Toby Cathcart Burn, Luke Ong, Steven Ramsay and Dominik Wagner

Finite Model Theory of the Triguarded Fragment and Related Logics –  Emanuel Kieronski and Sebastian Rudolph

Security

  • The Laplace Mechanism is optimal for differential privacy over continuous queriesAnnabelle McIver, Natasha Fernandes and Carroll Morgan 
  • Deciding Differential Privacy for Programs with Unbounded InputsRohit Chadha, A. Prasad Sistla and Mahesh Viswanathan      
  • Quantitative and Approximate MonitoringThomas A. Henzinger and N. Ege Saraç        
  • Alignment Completeness for Relational Hoare LogicsRamana Nagasamudram and David Naumann        
  • Session Logical Relations for NoninterferenceFarzaneh Derakhshan, Stephanie Balzer and Limin Jia  
  • A Bunched Logic for Conditional Independence -  Jialu Bao, Simon Docherty, Justin Hsu and Alexandra Silva 
 

Break

CSP

  • Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik and Dmitriy Zhuk (Distinguished Paper)
  • No-Rainbow Problem and the Surjective Constraint Satisfaction ProblemDmitriy Zhuk,
  • PTAS for Sparse General-Valued CSPsBalázs F. Mezei, Marcin Wrochna and Stanislav Živný.
  • Constraint Satisfaction Problems over Finite StructuresLibor Barto, William De Meo and Antoine Mottet
  • On Logics and Homomorphism ClosureManuel Bodirsky, Thomas Feller, Simon Knäuer and Sebastian Rudolph         
  • Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation PropertyManuel Bodirsky and Bertalan Bodor, 
 

Types I

  • The undecidability of System F typability and type checking for reductionists - Andrej Dudenhefner 
  • Higher lensesPaolo Capriotti, Nils Anders Danielsson and Andrea Vezzosi  
  • Internal -categorical models of dependent type theory: towards 2LTT eating HoTTNicolai Kraus 
  • Types are internal infinity-groupoidsAntoine Allioux, Eric Finster and Matthieu Sozeau 
  • Normalization for Cubical type theory Jonathan Sterling and Carlo Angiuli 
  • Parametricity and semi-cubical typesHugo Moeneclaey 

Probabilistic Aspects

  • Compositional Semantics for Probabilistic Programs with Exact Conditioning - Dario Stein and Sam Staton (Distinguished Paper)
  • From Multisets over Distributions to Distributions over MultisetsBart Jacobs 
  • Combining nondeterminism, probability, and termination: equational and metric reasoningMatteo Mio, Ralph Sarkis and Valeria Vignudelli 
  • Commutative Monads for Probabilistic Programming LanguagesXiaodong Jia, Bert Lindenhovius, Michael Mislove and Vladimir Zamdzhiev    
  • Symbolic Time and Space Tradeoffs for Probabilistic VerificationKrishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger and Alexander Svozil 
  • Stochastic Processes with Expected Stopping TimeKrishnendu Chatterjee and Laurent Doyen 
 

Wednesday - 30 June
Wednesday - 30 June
Invited Talk - Maurizio Lenzerini
Title: Abstraction in data integration

Break

Automata

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata - Mikołaj Bojańczyk, Bartek Klin and Joshua Moerman (Distinguished Paper)
Parikh's theorem for infinite alphabetsPiotr Hofman, Marta Juzepczuk, Sławomir Lasota and Mohnish Pattathurajan 
Continuous One-Counter AutomataMichael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt and Guillermo Perez 
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape AutomataElisabet Burjons, Fabian Frei and Martin Raszyk 
SD-Regular Transducer Expressions for Aperiodic TransformationsLuc Dartois, Paul Gastin and Shankara Narayanan Krishna   

Lambda-calculus

  • Universal Semantics for the Stochastic Lambda-CalculusPedro H Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden and Michael Roberts 
  • A compositional cost model for the lambda-calculusJames Laird    
  • On Generalized Metric Spaces for the Simply Typed Lambda-CalculusPaolo Pistone 
  • The Space of InteractionBeniamino Accattoli, Ugo Dal Lago and Gabriele Vanoni    
  • Strong Call-by-Value is Reasonable, ImplosivelyBeniamino Accattoli, Andrea Condoluci and Claudio Sacerdoti Coen 
  • Ranking Functions and Probabilistic Lambda CalculusAndrew Kenyon-Roberts and Luke Ong Supermartingales
  •  

    Logic and Proof

    • A Constructive Logic with Classical Proofs and RefutationsPablo Barenbaum and Teodoro Freund    
    • Combinatorial Proofs and Decomposition Theorems for First-order LogicDominic Hughes, Lutz Straßburger and Jui-Hsuan Wu   
    • Decidability and Complexity in Weakening and Contraction Hypersequent Substructural LogicsA. R. Balasubramanian, Timo Lang and Revantha Ramanayake 
    • Gödel-McKinsey-Tarski and Blok-Esakia for Lewis-Brouwer ImplicationJim de Groot, Tadeusz Litak and Dirk Pattinson 
    • Osequentiality and well-bracketing in the π-calculusDaniel Hirschkoff, Enguerrand Prebet and Davide Sangiorgi 
    • Axiomatizations and Computability of Weighted Monadic Second-Order LogicAntonis Achilleos and Mathias Ruggaard Pedersen 
     

    Break

    Invited Talk - Nadia Polikarpova
    Title: Synthesis of Safe Pointer-Manipulating Programs

    Thursday - 01 July
    Thursday - 01 July
    Invited Talk - Ryan Williams
    Title: Complexity Lower Bounds from Algorithm Design

    Break

    Graphs and words

    • Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes Jan Dreier (Distinguished Paper)  
    • Positive first-order logic on words - Denis Kuperber (Distinguished Paper)  
    • On the Expressive Power of Homomorphism CountsAlbert Atserias, Phokion Kolaitis and Wei-Lin Wu   
    • Forbidden Induced Subgraphs and the Los-Tarski TheoremYijia Chen and Jörg Flum 
    • Parameterized Complexity of  Elimination Distance to First-Order Logic PropertiesFedor Fomin, Petr Golovach and Dimitrios Thilikos   
    • An Algebraic Characterisation of First-Order Logic with NeighbourAmaldev Manuel and Dhruv Nevatia 
       

    Concurrency and formal aspects of program analysis

    • A Logic for Locally Complete Abstract Interpretations Roberto Bruni, Roberto Giacobazzi, Roberta Gori and Francesco Ranzato (Distinguished Paper)
    • Efficient Local Computation of Differential Bisimulations via Coupling and Up-to MethodsGiorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, Mirco Tribastone, Max Tschaikowski and Andrea Vandin 
    • A Complete Axiomatization for Divergence Preserving Branching Congruence of Finite-State BehavioursXinxin Liu and Tingting Yu     
    • Verifying higher-order concurrency with data automataAlex Dixon, Ranko Lazic, Andrzej Murawski and Igor Walukiewicz 
    • Compositional relational reasoning via operational game semanticsGuilhem Jaber and Andrzej Murawski 
    • Demonic Lattices and Semilattices in Relational Semigroups with Ordinary CompositionRobin Hirsch and Jas Semrl 
     

    Quantum programs and circuits

    • Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite MemoryTitouan Carette, Simon Perdrix and Marc De Visme 
    • A Quantum Interpretation of Bunched Logic & Quantum Separation LogicLi Zhou, Gilles Barthe, Justin Hsu, Mingsheng Ying and Nengkun Yu    
    • A Normal Form Characterization for Efficient Boolean Skolem Function SynthesisPreey Shah, Aman Bansal, S. Akshay and Supratik Chakraborty 
       

    Break

    Awards+Business

    Friday - 02 July
    Friday - 02 July
    Invited Talk - Luca Aceto
    Title: In search of lost time: Axiomatising parallel composition in process algebras

    Break

    Algebra, arithmetic, and logic

    • Fusible numbers and Peano Arithmetic Jeff Erickson, Gabriel Nivasch and Junyan Xu (Distinguished Paper)
    • Universal Skolem Sets Florian Luca, Joel Ouaknine and James Worrell (Distinguished Paper)
    • Fixed-Points for Quantitative Equational LogicsRadu Mardare, Gordon Plotkin and Prakash Panangaden    
    • Global Optimisation with Constructive RealsDan Ghica and Todd Waugh Ambridge    
    • Monomial-size vs. Bit-complexity in Sums-of-Squares and Polynomial CalculusTuomas Hakoniemi 
    • First-Order Reasoning and Efficient Semi-Algebraic ProofsFedor Part, Neil Thapen and Iddo Tzameret 
       

    Reasoning about processes

    Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics - Maciej Gazda and Rob Hierons
    Responsibility and verification: Importance value in temporal logics - Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch and Stefan Kiefer
    Perspective Multi-Player Games - Orna Kupferman and Noam Shenwald
    Asynchronous extensions of HyperLTL - Laura Bozzelli, Adriano Peron and Cesar Sanchez
    A distributed operational view of Reversible Prime Event Structures - Hernán Melgratti, Claudio Antares Mezzina and G. Michele Pinna  

    Types II

    • Smart choices and the selection monad - Martin Abadi and Gordon Plotkin.
    • Assuming just enough fairness to make session types complete for lock-freedom - Rob van Glabbeek, Peter Höfner and Ross Horne.
    • A Unifying Framework Broadening Realizability Models - Liron Cohen, Étienne Miquey and Ross Tate. Evidenced Frames:
    • Intersection Type Distributors - Federico Olimpieri
    • Categorical models of Linear Logic with fixed points of formulas - Thomas Ehrhard and Farzad Jafarrahmani
    • On the logical structure of choice and bar induction principles - Nuria Brede and Hugo Herbelin. Nuria Brede and Hugo Herbelin

    Break

    Modal Logic

    Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and ApproximationYuichi Komorida, Shin-Ya Katsumata, Clemens Kupke, Jurriaan Rot and Ichiro Hasuo 
    The Topological Mu-Calculus: completeness and decidabilityAlexandru Baltag, Nick Bezhanishvili and David Fernández-Duque 
    Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all framesRineke Verbrugge 
    Definitions and Interpolants in the Guarded and Two-Variable FragmentsJean Christoph Jung and Frank Wolter Living without Beth and Craig 
    Some constructive variants of S4 with the finite model propertyPhilippe Balbiani, Martín Diéguez and David Fernández-Duque 
    Behavioural Preorders via Graded MonadsChase Ford, Stefan Milius and Lutz Schröder 
     

    Categories

    • Comonadic semantics for guarded fragmentsSamson Abramsky and Daniel Marsden
    • Lovász-type Theorems and Game ComonadsAnuj Dawar, Tomáš Jakl and Luca Reggio    
    • The smash product of monoidal theoriesAmar Hadzihasanovic    
    • Categories of NetsJohn Baez, Fabrizio Romano Genovese, Jade Master and Michael Shulman    
    • Asynchronous Template GamesPaul-André Melliès 
    • On Monadic Rewriting Systems, Part IFrancesco Gavazzo and Claudia Faggian    
       

     

     

     

    Participants will be expected to see the talks and/or read papers before the attend sessions.The conference will be conducted virtually using the Zoom platform.

    The program contains links to your papers and talks.

    Each session will be conducted as follows (per paper)

    – Quick reminder/summary (3 min) of the paper
    (you will be able to share screen and show slides) and

    – Questions & Answers for 7 minutes, moderated by session chair.

     Chat

    We have set up a chat workspace at Discord, where you can interact with the authors, the presenters and our community, ask questions during the live sessions, etc. 

    Click here to join LICS 2021 Discord 

     

    Tuesday 29 June, 2021

    15:00-16:00

    ROOM: COLOSSEUM

    Invited Talk 

    Session Chair: Dale Miller
    Backup Chair: Leonid Libkin & Anuj Dawar

    The Logic of Graph Neural Networks – Martin Grohe
      

    16:30-17:30

    ROOM: COLOSSEUM

    ROOM: PANTHEON

    Polynomial time, games, and complexity 

    Session Chair: Erich Grädel
    Backup Chair: Martin Grohe

    Separating Rank Logic from Polynomial Time – Moritz Lichter  (KLEENE AWARD)
       

    Inapproximability of Unique Games in Fixed-Point Logic with Counting – Jamie Tucker-Foltz  (KLEENE AWARD)
      

    Multi-Structural Games and Number of Quantifiers – Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan and Nikhil Vyas
      

    Towards a more efficient approach for the satisfiability of two-variable logic – Ting-Wei Lin, Chia-Hsuan Lu and Tony Tan
       
      

    Initial limit Datalog: a new extensible class of decidable constrained Horn clauses – Toby Cathcart Burn, Luke Ong, Steven Ramsay and Dominik Wagner
       
     

    Finite Model Theory of the Triguarded Fragment and Related Logics –  Emanuel Kieronski and Sebastian Rudolph
      

     

    Security

    Session Chair: Marco Gaboardi
    Backup Chair: Catuscia Palamidessi 

    The Laplace Mechanism is optimal for differential privacy over continuous queries – Natasha Fernandes, Annabelle McIver and Carroll Morgan
      

    On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs – Rohit Chadha, A. Prasad Sistla and Mahesh Viswanathan
      

    Quantitative and Approximate Monitoring – Thomas A. Henzinger and N. Ege Saraç   
      

    Alignment Completeness for Relational Hoare Logics – Ramana Nagasamudram and David Naumann     
      

    Session Logical Relations for Noninterference – Farzaneh Derakhshan, Stephanie Balzer and Limin Jia  
      

    A Bunched Logic for Conditional Independence –  Jialu Bao, Simon Docherty, Justin Hsu and Alexandra Silva 
      

     

    18:00 – 19:00

    ROOM: COLOSSEUM

    ROOM: PANTHEON

    ROOM: FORUM

    CSP 

    Session Chair: Miguel Romero Orth 
    Backup Chair: Martin Grohe

    Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP – Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik and Dmitriy Zhuk (Distinguished Paper)
      

    No-Rainbow Problem and the Surjective Constraint Satisfaction Problem – Dmitriy Zhuk, 
      

    PTAS for Sparse General-Valued CSPs – Balázs F. Mezei, Marcin Wrochna and Stanislav Živný.
      

    Constraint Satisfaction Problems over Finite Structures – Libor Barto, William DeMeo and Antoine Mottet
      

    On Logics and Homomorphism Closure – Manuel Bodirsky, Thomas Feller, Simon Knäuer and Sebastian Rudolph
         
         

    Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property – Manuel Bodirsky and Bertalan Bodor.
      

     

    Probabilistic Aspects 

    Session Chair: Orma Kupferman
    Backup Chair: Véronique Bruyère

    Compositional Semantics for Probabilistic Programs with Exact Conditioning – Dario Stein and Sam Staton (Distinguished Paper)
      

    From Multisets over Distributions to Distributions over Multisets – Bart Jacobs 
      

    Combining nondeterminism, probability, and termination: equational and metric reasoning – Matteo Mio, Ralph Sarkis and Valeria Vignudelli 
      

    Commutative Monads for Probabilistic Programming Languages – Xiaodong Jia, Bert Lindenhovius, Michael Mislove and Vladimir Zamdzhiev    
      

    Symbolic Time and Space Tradeoffs for Probabilistic Verification – Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger and Alexander Svozil 
      

    Stochastic Processes with Expected Stopping Time – Krishnendu Chatterjee and Laurent Doyen 
      

     

    Types I 

    Session Chair: Kristina Sojakova
    Backup Chair: Ekaterina Komendatskaya

    The undecidability of System F typability and type checking for reductionists – Andrej Dudenhefner 
      

    Higher lenses – Paolo Capriotti, Nils Anders Danielsson and Andrea Vezzosi  
      

    Internal -categorical models of dependent type theory: towards 2LTT eating HoTT – Nicolai Kraus 
      

    Types are internal infinity-groupoids – Antoine Allioux, Eric Finster and Matthieu Sozeau 
      

    Normalization for Cubical type theory – Jonathan Sterling and Carlo Angiuli 
      

    Parametricity and semi-cubical types – Hugo Moeneclaey
      

    Wednesday 30 June, 2021

    15:00-16:00

    ROOM: COLOSSEUM

    Invited Talk 

    Session Chair: Leonid Libkin
    Backup Chair: Dale Miller

    Abstraction in data integration – Gianluca Cima, Marco Console, Maurizio Lenzerini, Antonella Poggi
      

    16:30 – 17:30

    ROOM: COLOSSEUM

    ROOM: PANTHEON

    ROOM: FORUM

    Automata 

    Session Chair: Véronique Bruyère
    Backup Chair: Patrick Totzke

    Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata – Mikołaj Bojańczyk, Bartek Klin and Joshua Moerman (Distinguished Paper)
      

    Parikh’s theorem for infinite alphabets – Piotr Hofman, Marta Juzepczuk, Sławomir Lasota and Mohnish Pattathurajan 
      

    Continuous One-Counter Automata – Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt and Guillermo Perez 
      

    Production vs Verification for Finite State Machines– Elisabet Burjons, Fabian Frei and Martin Raszyk 
      

    SD-Regular Transducer Expressions for Aperiodic Transformations – Luc Dartois, Paul Gastin and Shankara Narayanan Krishna 
      

     

    Lambda-Calculus 

    Session Chair: Frederic Blanqui
    Backup Chair: Marco Gaboardi

    Universal Semantics for the Stochastic Lambda-Calculus – Pedro H Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden and Michael Roberts 
      

    A compositional cost model for the lambda-calculus – James Laird    
      

    On Generalized Metric Spaces for the Simply Typed Lambda-Calculus – Paolo Pistone 
      

    The Space of Interaction – Beniamino Accattoli, Ugo Dal Lago and Gabriele Vanoni    
      

    Strong Call-by-Value is Reasonable, Implosively – Beniamino Accattoli, Andrea Condoluci and Claudio Sacerdoti Coen 
      

    Supermartingales, Ranking Functions and Probabilistic Lambda Calculus – Andrew Kenyon-Roberts and Luke Ong 
      

     

    Logic and Proof 

    Session Chair: Jamie Vicary
    Backup Chair: Amina Doumane

    A Constructive Logic with Classical Proofs and Refutations – Pablo Barenbaum and Teodoro Freund    
      

    Combinatorial Proofs and Decomposition Theorems for First-order Logic – Dominic Hughes, Lutz Straßburger and Jui-Hsuan Wu   
      

    Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics – A. R. Balasubramanian, Timo Lang and Revantha Ramanayake 
      

    Gödel-McKinsey-Tarski and Blok-Esakia for Lewis-Brouwer Implication – Jim de Groot, Tadeusz Litak and Dirk Pattinson 
      

    Osequentiality and well-bracketing in the π-calculus – Daniel Hirschkoff, Enguerrand Prebet and Davide Sangiorgi 
      

    Axiomatizations and Computability of Weighted Monadic Second-Order Logic – Antonis Achilleos and Mathias Ruggaard Pedersen 
      

     

    18:00-19:00

    ROOM: COLOSSEUM

    Invited Talk 

    Session Chair: Liron Cohen

    Synthesis of Safe Pointer-Manipulating Programs – Nadia Polikarpova
      

    Thursday 01 July, 2021

    15:00-16:00

    ROOM: COLOSSEUM

    Invited Talk 

    Session Chair: Thomas Zeume
    Backup Chair: Leonid Libkin

    Complexity Lower Bounds from Algorithm Design – Ryan Williams
      

    16:30 – 17:30

    ROOM: COLOSSEUM

    ROOM: PANTHEON

    ROOM: FORUM

    Graphs and words 

    Session Chair: Lauri Hella
    Backup Chair: Wim Martens

    Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes – Jan Dreier (Distinguished Paper)  
      

    Positive first-order logic on words – Denis Kuperber (Distinguished Paper)  
      

    On the Expressive Power of Homomorphism Counts – Albert Atserias, Phokion Kolaitis and Wei-Lin Wu   
      

    Forbidden Induced Subgraphs and the Los-Tarski Theorem – Yijia Chen and Jörg Flum 
      

    Parameterized Complexity of  Elimination Distance to First-Order Logic Properties – Fedor Fomin, Petr Golovach and Dimitrios Thilikos   
      

    An Algebraic Characterisation of First-Order Logic with Neighbour – Amaldev Manuel and Dhruv Nevatia 
      

     

     

    Concurrency and formal aspects of program analysis 

    Session Chair: Filippo Bonchi
    Backup Chair: Dmitry Chistikov

    A Logic for Locally Complete Abstract Interpretations – Roberto Bruni, Roberto Giacobazzi, Roberta Gori and Francesco Ranzato (Distinguished Paper)
      

    Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods – Giorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, Mirco Tribastone, Max Tschaikowski and Andrea Vandin 
      

    A Complete Axiomatization for Divergence Preserving Branching Congruence of Finite-State Behaviours – Xinxin Liu and Tingting Yu     
      

    Verifying higher-order concurrency with data automata – Alex Dixon, Ranko Lazic, Andrzej Murawski and Igor Walukiewicz 
      

    Compositional relational reasoning via operational game semantics – Guilhem Jaber and Andrzej Murawski 
      

    Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition – Robin Hirsch and Jas Semrl 
      

     

    Quantum programs and circuits 

    Session Chair: Jamie Vicary
    Backup Chair: Samson Abramsky

    Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory – Titouan Carette, Simon Perdrix and Marc De Visme 
      

    A Quantum Interpretation of Bunched Logic & Quantum Separation Logic – Li Zhou, Gilles Barthe, Justin Hsu, Mingsheng Ying and Nengkun Yu    
      

    A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis – Preey Shah, Aman Bansal, S. Akshay and Supratik Chakraborty 
      

     

     

    18:00-19:00

    ROOM: COLOSSEUM

    Awards  

    Business

    Friday 02 July, 2021

    15:00-16:00

    ROOM: COLOSSEUM

    Invited Talk 

    Session Chair: Alexandra Silva
    Backup Chair: Naoki Kobayashi

    In search of lost time: Axiomatising parallel composition in process algebras – Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingolfsdottir and Bas Luttik
      

    16:30 – 17:30

    ROOM: COLOSSEUM

    ROOM: PANTHEON

    ROOM: FORUM

    Algebra, arithmetic, and logic 

    Session Chair: Jérôme Leroux
    Backup Chair: Szymon Torunczyk

    Fusible numbers and Peano Arithmetic – Jeff Erickson, Gabriel Nivasch and Junyan Xu (Distinguished Paper)
      

    Universal Skolem Sets – Florian Luca, Joel Ouaknine and James Worrell (Distinguished Paper)
      

    Fixed-Points for Quantitative Equational Logics – Radu Mardare, Gordon Plotkin and Prakash Panangaden    
      

    Global Optimisation with Constructive Reals – Dan Ghica and Todd Waugh Ambridge    
      

    Monomial-size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus – Tuomas Hakoniemi 
      

    First-Order Reasoning and Efficient Semi-Algebraic Proofs – Fedor Part, Neil Thapen and Iddo Tzameret 
      

     

     

    Reasoning about processes 

    Session Chair: Patrick Totzke
    Backup Chair: Thomas Zeume

    Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics – Maciej Gazda and Rob Hierons 
      

    Responsibility and verification: Importance value in temporal logics – Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch and Stefan Kiefer 
      

    Perspective Multi-Player Games – Orna Kupferman and Noam Shenwald 
      

    Asynchronous extensions of HyperLTL – Laura Bozzelli, Adriano Peron and Cesar Sanchez 
      

    A distributed operational view of Reversible Prime Event Structures – Hernán Melgratti, Claudio Antares Mezzina and G. Michele Pinna   
      

     

    Types II

    Session Chair: Ekaterina Komendantskaya
    Backup Chair: Kristina Sojakova

    Smart choices and the selection monad – Martin Abadi and Gordon Plotkin. 
      

    Assuming just enough fairness to make session types complete for lock-freedom – Rob van Glabbeek, Peter Höfner and Ross Horne. 
      

    Evidenced Frames: A Unifying Framework Broadening Realizability Models – Liron Cohen, Étienne Miquey and Ross Tate.  
      

    Intersection Type Distributors – Federico Olimpieri 
      

    Categorical models of Linear Logic with fixed points of formulas – Thomas Ehrhard and Farzad Jafarrahmani 
      

    On the logical structure of choice and bar induction principles – Nuria Brede and Hugo Herbelin. Nuria Brede and Hugo Herbelin    
      

    18:00 – 19:00

    ROOM: COLOSSEUM

    ROOM: PANTHEON

    Modal Logic 

    Session Chairs: Michael Zakharyaschev 
    Backup Chair: Meghyn Bienvenu

    Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and Approximation – Yuichi Komorida, Shin-Ya Katsumata, Clemens Kupke, Jurriaan Rot and Ichiro Hasuo 
      

    The Topological Mu-Calculus: completeness and decidability – Alexandru Baltag, Nick Bezhanishvili and David Fernández-Duque 
      

    Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames – Rineke Verbrugge 
      

    Living without Beth and Craig Definitions and Interpolants in the Guarded and Two-Variable Fragments – Jean Christoph Jung and Frank Wolter 
      

    Some constructive variants of S4 with the finite model property – Philippe Balbiani, Martín Diéguez and David Fernández-Duque 
      

    Behavioural Preorders via Graded Monads – Chase Ford, Stefan Milius and Lutz Schröder 
      

     

    Categories 

    Session Chair: Daniela Petrisan
    Backup Chair: Daniele Gorla

    Comonadic semantics for guarded fragments – Samson Abramsky and Daniel Marsden
      

    Lovász-type Theorems and Game Comonads – Anuj Dawar, Tomáš Jakl and Luca Reggio    
      

    The smash product of monoidal theories – Amar Hadzihasanovic    
      

    Categories of Nets – John Baez, Fabrizio Romano Genovese, Jade Master and Michael Shulman    
      

    Asynchronous Template Games – Paul-André Melliès 
      

    On Monadic Rewriting Systems, Part I – Francesco Gavazzo and Claudia Faggian