On this page:

• Link to Web Page
• Invited Speakers
• Invited Papers
• Presented Papers
• Organizers

Invited Speakers

• Nada Amin
  A Rational Defense of Reasonable Reflection
• Stéphanie Delaune
  Formal Verification of Security Protocols: 25 Years of ProVerif

Invited Papers

• Nada Amin
  A Rational Defense of Reasonable ReflectionMore Information...
• Stéphanie Delaune
  Formal Verification of Security Protocols: 25 Years of ProVerifMore Information...

Presented Papers

Entries are ordered by surname of first author

• Alessandro Abate Mirco Giacobbe Sergey Ichtchenko Diptarko Roy
  Complete ω-Regular Supermartingale CertificatesMore Information...
• Danel Ahman Ohad Kammar Rasmus Ejlers Møgelberg
  A Convenient Fibration for Dependently-Typed Probability TheoryMore Information...
• Rida Ait El Manssour Vincent Cheval Mahsa Shirmohammadi James Worrell
  Differential Tree AutomataMore Information...
• Shaull Almagor Guy Arbel Sarai Sheinvald
  A Complexity Bound for Determinisation of Min-Plus Weighted Automata [Distinguished Paper]More Information...
• Giorgio Bacci Rasmus Ejlers Møgelberg
  Induction and Recursion Principles in a Higher-Order Quantitative Logic for ProbabilityMore Information...
• Piotr Bacik Joris Nieuwveld Joël Ouaknine Mihir Vahanwala Madhavan Venkatesh Emil Rugaard Wieser
  On Variable-Bounded Non-Linear Expansions of Presburger ArithmeticMore Information...
• Piotr Bacik Anton Varonka
  On the Subspace Orbit Problem and the Simultaneous Skolem ProblemMore Information...
• Thibaut Balabonski
  A Machine-Independent, Log-Sensitive Space-Cost Measure for the Weak Lambda-CalculusMore Information...
• A. R. Balasubramanian Vitor Greati Revantha Ramanayake
  Hypersequent Calculi Have Ackermann ComplexityMore Information...
• A. R. Balasubramanian Franzisco Schmidt
  The Complexity of Nested Reset Counter SystemsMore Information...
• Adriana Baldacchino Andrzej S. Murawski
  Unbounded Data Nesting for Loops in Higher-Order ProgramsMore Information...
• Demian Banakh Alexey Barsukov Tamio-Vesa Nakajima
  Towards Infinite PCSP: A Dichotomy for Monochromatic CliquesMore Information...
• Kathleen Barsse Romain Péchoux Simon Perdrix
  Quantum Control and General Recursion Beyond the Unitary Case [Distinguished Paper]More Information...
• Gilles Barthe Minbo Gao Jam Kabeer Ali Khan Matthijs Muis Ivan Renison Keiya Sakabe Michael Walter Yingte Xu Tianshi Yu Li Zhou
  Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded AssertionsMore Information...
• Reid Barton Axel Ljungström Owen Milner Anders Mörtberg
  A Computer Formalisation of the Serre Finiteness TheoremMore Information...
• Kevin Batz Benjamin Lucien Kaminski Lucas Kehrer Gerwin Klein Todd Schmid Henning Urbat
  The Algebra of Iterative ConstructionsMore Information...
• Christian Bianchini Gabriele Puppis
  Minimization of Streaming TransducersMore Information...
• Clotilde Bizière Wojciech Czerwiński Roland Guttenberg Jérôme Leroux Vincent Michielini Łukasz Orlikowski Antoni Puch Henry Sinclair-Banks
  Reachability in VASS Extended with Integer CountersMore Information...
• Manuel Bodirsky Santiago Guzmán-Pro
  On the Computational Power of Extensional ESOMore Information...
• Mikołaj Bojańczyk Antonio Casares Sven Manthe Paweł Parys
  Automata for MSO over Infinite Trees with Quantification over Borel Sets of BranchesMore Information...
• Mikołaj Bojańczyk Michał Pilipczuk Wojciech Przybyszewski Marek Sokołowski Giannos Stamoulis
  Low Rank MSOMore Information...
• Léonard Brice Thomas A. Henzinger K. S. Thejaswini
  Dicey Games: Shared Sources of Randomness in Distributed SystemsMore Information...
• Antonio Casares Christof Löding Igor Walukiewicz
  Layered Automata: A Canonical Model for Automata over Infinite WordsMore Information...
• Simon Castellan Hugo Paquet
  Lazy Intermediate Representations for Algebraic EffectsMore Information...
• Balder ten Cate Louwe B. Kuijer Frank Wolter
  The Size of Interpolants in Modal LogicsMore Information...
• Evan Cavallo Christian Sattler
  Eliminating Reversals from Cubical Type TheoriesMore Information...
• Lorenzo Clemente
  Commutative Algebras of SeriesMore Information...
• Alexandre Clément
  A Complete Equational Theory for Real-Clifford+CH Quantum CircuitsMore Information...
• Thomas Colcombet Alexander Rabinovich
  The Uniformisation of Monadic Second-Order Logic over Countable OrdinalsMore Information...
• Thierry Coquand Jonas Höfer Christian Sattler
  Constructive Higher Sheaf Models with Applications to Synthetic MathematicsMore Information...
• Rob Cornish Andi Q. Wang
  A Categorical Account of the Metropolis-Hastings AlgorithmMore Information...
• Raphaëlle Crubillé
  Interpreting De Finetti’s Theorem in the Category of Integrable ConesMore Information...
• Ugo Dal Lago Guido Fiorillo Paolo Pistone
  On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear LogicMore Information...
• Yoav Danieli
  Star Complexity of Parikh Images of Languages over Infinite Alphabets [Kleene Award]More Information...
• Samir Datta Asif Khan Felix Tschirbs Nils Vortmeier Thomas Zeume
  Dynamic Planar Graph Isomorphism Is in DynFO [Distinguished Paper]More Information...
• Anuj Dawar Nihil Shah
  Complexity of Satisfiability in Kochen-Specker Partial Boolean AlgebrasMore Information...
• Maël Dumas Aliaume Lopez
  Well-Quasi-Ordered Classes of Bounded Clique-WidthMore Information...
• Rüdiger Ehlers Ayrat Khalimov
  A Naturally-Colored Translation from LTL to Parity and COCOAMore Information...
• Neta Elad Sharon Shoham
  Decidability Results for Fragments of First-Order Logic via a Symbolic Model PropertyMore Information...
• Thiago Felicissimo Yann Leray Loïc Pujet Nicolas Tabareau Éric Tanter Théo Winterhalter
  Definitional Proof Irrelevance Made AccessibleMore Information...
• Roman Feller Michael Pinsker
  Decidability of InterpretabilityMore Information...
• Diego Figueira Santiago Figueira Yoshiki Nakamura
  Guarded Negation Transitive Closure LogicMore Information...
• Oskar Fiuk
  The Guarded Fragment with Nested EquivalencesMore Information...
• Soichiro Fujii Yun Chen Tsai Yoàv Montacute Ichiro Hasuo
  Monads and Distributive Laws in Substructural ContextsMore Information...
• Nikolaos Galatos Peter Jipsen Søren Brinck Knudstorp Revantha Ramanayake
  The Logic of Bunched Implications Is Undecidable [Distinguished Paper]More Information...
• Moses Ganardi Marin Ricros
  Constructing Small Monadic Decompositions in Presburger ArithmeticMore Information...
• Dichuan Gao Razin A. Shaikh Aleks Kissinger
  Graphical Algebraic Geometry: From Ideals and Varieties to Quantum CalculiMore Information...
• Michal Garlík Svyatolav Gryaznov Jiaqi Lu Rahul Santhanam Iddo Tzameret
  Meta-Mathematics of Algebraic ComplexityMore Information...
• Francesco Gavazzo
  An Algebraic Approach to Formal System MetatheoryMore Information...
• Nathaniel Glover Jan Hoffmann
  LFPL: Revisited and MechanizedMore Information...
• Daniel Gratzer Jonathan Weinberger Ulrik Buchholtz
  The ∞-Category of ∞-Categories in Simplicial Type Theory [Distinguished Paper]More Information...
• Roland Guttenberg Eren Keskin Roland Meyer
  PVASS Reachability Is Decidable [Distinguished Paper]More Information...
• Maximilian Hadek Tomáš Jakl Jakub Opršal
  A Categorical Perspective on Constraint Satisfaction: The Wonderland of AdjunctionsMore Information...
• Perry Hart Owen Milner
  Classifying 2-Groups in Homotopy Type TheoryMore Information...
• Chris Heunen Robin Kaarsgaard Louis Lemonnier
  One Rig to Control Them AllMore Information...
• Kengo Hirata Takeshi Tsukada
  Causality in Pure Quantum Computation with Quantum ControlMore Information...
• Xu Huang Carlo Angiuli
  Fat Cell Structures and Generalized Algebraic TheoriesMore Information...
• Tom de Jong Nicolai Kraus Aref Mohammadzadeh Fredrik Nordvall Forsberg
  Generalized Decidability via Brouwer TreesMore Information...
• Jean Christoph Jung Jędrzej Kołodziejski Frank Wolter
  Computation and Size of Interpolants for Hybrid Modal LogicsMore Information...
• Piotr Kawałek Jacek Krzaczkowski
  Complexity Classes Arising from Circuits over Finite Algebraic StructuresMore Information...
• Olivier Laurent
  The Logic of Intersection SubtypingMore Information...
• Titouan Leclercq Étienne Miquey
  Oracles Just for Fan: A Robust Computational Interpretation of the Fan TheoremMore Information...
• Karoliina Lehtinen Keya Prakash Michał Skrzypczak
  Checking History Determinism for Parity Automata Is in NPMore Information...
• Fabian Lenke Stefan Milius Henning Urbat
  A Unified Treatment of the Substitution Tensor for Presheaves, Nominal Sets, Renaming Sets, and so onMore Information...
• Axel Ljungström Loïc Pujet
  Cellular Methods in Homotopy Type TheoryMore Information...
• James C. A. Main Mickael Randour
  Mixing Any Cocktail with Limited Ingredients: On the Structure of Payoff Sets in Multi-Objective POMDPs and Its Impact on Randomised StrategiesMore Information...
• Richard Mandel Corto Mascle Georg Zetzsche
  The Complexity of Downward Closures of Indexed LanguagesMore Information...
• Markus de Medeiros Puming Liu Kwing Hei Li Alejandro Aguirre Lars Birkedal Joseph Tassarotti
  Verifying Exact Samplers for Continuous Distributions with a Discrete Program LogicMore Information...
• Olga Medrano Martín del Campo
  Local Combinatorial Analogues for Bounded VC DimensionMore Information...
• Paul-André Melliès Vincent Moreau
  A Cartesian Closed Fibration of Higher-Order Regular LanguagesMore Information...
• Daniel Misselbeck-Wessel
  From Co-Coverages to Radicals in Complete LatticesMore Information...
• Nikolas Mählmann Sebastian Siebertz
  Existential Positive Transductions of Sparse Graphs [Distinguished Paper]More Information...
• Daniel Neuen Tim Seppelt
  Distinguishing Graphs by Counting Homomorphisms from Sparse GraphsMore Information...
• Benedikt Peterseim Milan Lopuhaä-Zwakenberg
  Fixed-Parameter Tractable Inference for Discrete Probabilistic Programs, via String Diagram AlgebraisationMore Information...
• Cécilia Pradic Ian Price
  Problems with Fixpoints of Polynomials of PolynomialsMore Information...
• Subin Pulari Akhil S
  Randomness Extraction Fails for Finite-State DimensionMore Information...
• Ken Sakayori Davide Sangiorgi Simon Castellan Pierre Clairambault
  Wiring the π-Calculus to Denotational Semantics [Distinguished Paper]More Information...
• Ignasi Sau Nicole Schirrmacher Sebastian Siebertz Giannos Stamoulis Dimitrios M. Thilikos Alexandre Vigny
  Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph ClassesMore Information...
• Niels C. Vooijs David Fernández-Duque
  Axiomatizability of Alexandrov Dynamic Topological LogicMore Information...
• Jingjie Yang Mikołaj Bojańczyk Bartek Klin
  The Finite Length Property of the Rado Graph and FriendsMore Information...
• Haoxuan Yin Andrzej S. Murawski C.-H. Luke Ong
  Contextual MetaML: Syntax and Full AbstractionMore Information...
• Safa Zouari
  Forgetting Event Order in Higher-Dimensional AutomataMore Information...

Organizers

General Chair Igor Walukiewicz University of Bordeaux Program Chair Claudia Faggian CNRS, Université Paris Cité Joost-Pieter Katoen RWTH Aachen University and University of Twente Conference Chair Bernardo Toninho Técnico Lisboa and INESC-ID Publicity Chair Sam Staton University of Oxford Workshops Chair Valentin Blot Inria and Nantes Université

Program Committee: Parosh Abdulla (Uppsala University); Andreas Abel (Gothenburg University); S. Akshay (IIT Bombay); Thorsten Altenkirch (University of Nottingham); Maria Paola Bonacina (Università degli Studi di Verona); Luis Caires (Técnico Lisboa); Pablo Castro (University of Rio Cuarto); Anupam Das (University of Birmingham); Laure Daviaud (University of East-Anglia); Anuj Dawar (University of Cambridge); Yuxin Deng (East China Normal University); Farzaneh Derakhshan (Illinois Tech); Jan Dreier (TU Vienna); Marco Gaboardi (Boston University); Fabio Gadducci (University of Pisa); Dan Ghica (Huawei Central Software Institute and University of Birmingham); Jean Goubault-Larrecq (ENS Paris Saclay); Martin Grohe (RWTH Aachen University); Ichiro Hasuo (NII Tokyo); Steven Holtzen (Northeastern University); Justin Hsu (Cornell University); Marie Kerjean (CNRS, Université Sorbonne Paris Nord); Delia Kesner (Université Paris Cité); Sandra Kiefer (University of Oxford); Eun Jung Kim (KAIST); Aleks Kissinger (University of Oxford); Laura Kovács (TU Wien); Shankara Narayanan Krishna (IIT Bombay); Antonín Kučera (Masaryk University); Orna Kupferman (Hebrew University); Sławomir Lasota (University of Warsaw); Ranko Lazić (University of Warwick); Christoph Matheja (University of Oldenburg); Koko Muroya (Ochanomizu University); Anca Muscholl (Université de Bordeaux); Daniel Neuen (Max-Planck-Institut Informatics); Paige Randall North (Utrecht University); Hugo Paquet (Inria, École Normale Supérieure); Nir Piterman (University of Gothenburg); Ramyaa Ramyaa (New Mexico Tech); Jurriaan Rot (Radboud University); Davide Sangiorgi (University of Bologna); Pascal Schweitzer (TU Darmstadt); Mahsa Shirmohammadi (CNRS, Université Paris Cité); Pawel Sobocinski (TalTech); Lidia Tendera (University of Opole); Benoît Valiron (CentraleSupélec); Jana Wagemaker (Radboud University); Thorsten Wißmann (University of Erlangen); James Worrell (University of Oxford); Mingsheng Ying (University of Technology Sydney); Georg Zetzsche (Max Planck Institute for Software Systems); Martin Zimmermann (Aalborg University)