- The Descriptive Complexity of Graph Neural Networks, Martin Grohe (Distinguished Paper)
- The Iteration Number of the Weisfeiler-Leman Algorithm, Martin Grohe, Moritz Lichter and Daniel Neuen
- Simulating Logspace-Recursion with Logarithmic Quantifier Depth, Steffen van Bergerem, Martin Grohe, Sandra Kiefer and Luca Oeljeklaus
- Embedded Finite Models beyond Restricted Quantifier Collapse, Michael Benedikt and Ehud Hrushovski
- Distal combinatorial tools for graphs of bounded twin-width, Wojciech Przybyszewski
- A categorical account of composition methods in logic, Dan Marsden, Tomáš Jakl and Nihil Shah
14:00-15:30 Logics and verification
- The Logic of Prefixes and Suffixes is Elementary under Homogeneity, Dario Della Monica, Angelo Montanari, Gabriele Puppis and Pietro Sala
- Revisiting Membership Problems in Subclasses of Rational Relations, Pascal Bergsträßer and Moses Ganardi
- PDL on Steroids, Diego Figueira, Santiago Figueira and Edwin Pin Baque
- Verifying linear temporal specifications of constant-rate multi-mode systems, Michael Blondin, Philip Offtermatt and Alex Sansfaçon-Buchanan
- Minimization of Dynamical Systems over Monoids, Georgios Argyris, Alberto Lluch Lafuente, Alexander Leguizamon Robayo, Mirco Tribastone, Max Tschaikowski and Andrea Vandin
- A Higher-Order Indistinguishability Logic for Cryptographic Reasoning, David Baelde, Adrien Koutsos and Joseph Lallemand
16:00- 17:00 Semantic games and bicategories
18:30 Reception and distinguished papers announcements
- Folding interpretations, Mikołaj Bojańczyk
- On the growth rates of polyregular functions, Mikołaj Bojańczyk
- Z-polyregular functions, Gaëtan Douéneau-Tabot, Aliaume Lopez and Thomas Colcombet
- Quantifying over Trees in Monadic Second-Order Logic, Massimo Benerecetti, Bozzelli Laura, Fabio Mogavero and Adriano Peron
- Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Queries on Unranked Trees, Jelle Hellings, Marc Gyssens, Jan Van den Bussche and Dirk Van Gucht
- Group separation strikes back, Thomas Place and Marc Zeitoun
- Intuitionistic S4 is decidable, Marianna Girlando, Roman Kuznets, Sonia Marin, Marianela Morales Elena and Lutz Straßburger
- Cut-restriction: from cuts to analytic cuts, Agata Ciabattoni, Timo Lang and Revantha Ramanayake
- Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations, Yoshiki Nakamura
- Simplicial Set Models for Distributed Knowledge, Éric Goubault, Roman Kniazev, Jérémy Ledent and Sergio Rajsbaum
- Fixed Point Logics on Hemimetric Spaces, David Fernández-Duque and Quentin Gougeon
- Computational expressivity of (circular) proofs with fixed points, Gianluca Curzi and Anupam Das
- The Probabilistic Rabin Tree Theorem, Damian Niwinski, Paweł Parys and Michał Skrzypczak
- Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives, Jan Kretinsky, Tobias Meggendorfer and Maximilian Weininger
- Stochastic Best-Effort Strategies for Borel Goals, Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin and Florian Zuleger
- On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata, Tobias Winkler and Joost-Pieter Katoen
17:15- 18:15 Randomness
10:30- 12:00 Decidability and complexity
- The Identity Problem in the special affine group of Z2, Ruiwen Dong (Kleene Award Paper)
- Orbit-finite linear programming, Arka Ghosh, Piotr Hofman and Sławomir Lasota (Distinguished Paper)
- Reachability in Injective Piecewise Affine Maps, Faraz Ghahremani, Edon Kelmendi and Joel Ouaknine
- Multiplicity Problems on Algebraic Series and Context-Free Grammars, Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi and James Worrell
- Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF, Johannes K. Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky and Sebastian Ordyniak
- The Power of Positivity, Toghrul Karimov, Edon Kelmendi, Joris Nieuwveld, Joël Ouaknine and James Worrell
11:00- 12:30 Semantics and rewriting
- Operational Algorithmic Game Semantics, Benedict Bunting and Andrzej Murawski
- Weak Similarity in Higher-Order Mathematical Operational Semantics, Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius and Lutz Schröder
- Fully Abstract Normal Form Bisimulation for call-by-value PCF, Nikos Tzevelekos, Vasileios Koutavas and Yu-Yang Lin (Distinguished Paper)
- Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages, Titouan Carette, Louis Lemonnier and Vladimir Zamdzhiev
- Allegories of Symbolic Manipulation, Francesco Gavazzo
- Higher-dimensional subdiagram matching, Amar Hadzihasanovic and Diana Kessler
15:30- 16:30 Pi-calculus and quantum circuits
- Extensional and Non-extensional Functions as Processes, Ken Sakayori and Davide Sangiorgi (Distinguished Paper)
- A Complete Equational Theory for Quantum Circuits, Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix and Benoît Valiron
- Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus, Boldizsár Poór, Quanlong Wang, Razin Shaikh, Lia Yeh, Richie Yeung and Bob Coecke
- Complete Graphical Language for Hermiticity-Preserving Superoperators, Renaud Vilmart, Titouan Carette, Timothée Hoffreumon and Émile Larroque