Program

10:30	Marcin Jurdzinski and Ranko Lazic Succinct progress measures for solving parity games ( abstract )
10:55	Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi and Dominik Wojtczak Parity Objectives in Countable MDPs ( abstract )
11:20	Martin Zimmermann Games with Costs and Delays ( abstract )

10:30-12:10 Session 3B

Chair:

Dusko Pavlovic

Location: V1.01

10:30	Chris Heunen, Ohad Kammar, Sam Staton and Hongseok Yang A Convenient Category for Higher-Order Probability Theory ( abstract )
10:55	Aleks Kissinger and Sander Uijlen A categorical semantics for causal structure ( abstract )
11:20	Taichi Uemura Fibred Fibration Categories ( abstract )
11:45	Martin Hofmann and Jérémy Ledent A cartesian closed category for higher-order model checking ( abstract )

12:10-13:40 Session : Lunch

Lunch

13:40-15:20 Session 4A

Chair:

Cristian Riveros

Location: M1.01

13:40	Michael Blondin and Christoph Haase Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States ( abstract )
14:05	Wojciech Czerwiński and Sławomir Lasota Regular Separability of One Counter Automata ( abstract )
14:30	Thomas Place and Marc Zeitoun Separation for Dot-Depth Two ( abstract )
14:55	Paul-André Melliès Higher-order parity automata ( abstract )

13:40-15:20 Session 4B

Chair:

Paul Blain Levy

Location: V1.01

13:40	Radu Mardare, Prakash Panangaden and Gordon Plotkin On Axiomatizability of the Quantitative Algebras ( abstract )
14:05	Emmanuel Jeandel Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra ( abstract )
14:30	Natsuki Urabe, Masaki Hara and Ichiro Hasuo Categorical Liveness Checking by Corecursive Algebras ( abstract )
14:55	Yoshiki Nakamura Partial Derivatives on Graphs for Kleene Allegories ( abstract )

15:20-15:50 Session : Coffee Break

15:50-17:55 Session 5A

Chair:

Emmanuel Filiot

Location: M1.01

15:50	Ugo Dal Lago, Ryo Tanaka and Akira Yoshimizu The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens ( abstract )
16:15	Gérard Cécé Foundation for a Series of Efficient Simulation Algorithms ( abstract )
16:40	Javier Esparza, Anca Muscholl and Igor Walukiewicz Static Analysis of Deterministic Negotiations ( abstract )
17:05	Paolo Baldan, Andrea Corradini and Fabio Gadducci Domains and Event Structures for Fusions ( abstract )
17:30	Rob van Glabbeek Lean and Full Congruence Formats for Recursion ( abstract )

15:50-17:55 Session 5B

Chair:

Phokion Kolaitis

Location: V1.01

15:50	Marcelo Arenas, Martín Muñoz and Cristian Riveros Descriptive Complexity for Counting Complexity Classes ( abstract )
16:15	Martin Grohe and Wied Pakusa The Descriptive Complexity of Solving Linear Equation Systems and its Applications ( abstract )
16:40	Faried Abu Zaid, Anuj Dawar, Erich Grädel and Wied Pakusa Definability of Summation Problems for Abelian Groups and Semigroups ( abstract )
17:05	Berit Grußien Capturing Polynomial Time using Modular Decomposition ( abstract )
17:30	Anuj Dawar and Pengming Wang Definability of Semidefinite Programming and Lasserre Lower Bounds for CSPs ( abstract )

18:00-20:00 Session : Welcome Reception

Welcome Reception

Wednesday, June 21st

View this program: with abstracts session overview talk overview

09:00-10:00 Session 6: Invited Talk

Chair:

Samson Abramsky

Location: M1.01

09:00

Luke Ong

Quantitative semantics of the lambda calculus: some generalisations of the relational model ( abstract )

10:00-10:30 Session : Coffee Break

10:30-12:10 Session 7A

Chair:

Jean-François Raskin

Location: M1.01

10:30	Piotr Hofman, Jérôme Leroux and Patrick Totzke Linear Combinations of Unordered Data Vectors ( abstract )
10:55	Simon Halfon, Philippe Schnoebelen and Georg Zetzsche Decidability, complexity, and expressiveness of first-order logic over the subword ordering ( abstract )
11:20	Yu-Fang Chen, Ondrej Lengal, Tony Tan and Zhilin Wu Register automata with linear arithmetic ( abstract )
11:45	Michael Benedikt, Timothy Duff, Aditya Sharad and James Worrell Polynomial Automata: Zeroness and Applications ( abstract )

10:30-12:10 Session 7B

Chair:

Damien Pous

Location: V1.01

10:30	Amina Doumane Constructive completeness for the linear-time mu-calculus ( abstract )
10:55	Takeshi Tsukada, Kazuyuki Asada and Luke Ong Generalised Species of Rigid Resource Terms ( abstract )
11:20	Pierre Vial Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem ( abstract )
11:45	Federico Aschieri, Agata Ciabattoni and Francesco Genco Gödel Logic: From Natural Deduction to Parallel Computation ( abstract )

12:10-13:40 Session : Lunch

Lunch

13:40-15:20 Session 8A

Chair:

Martin Grohe

Location: M1.01

13:40	Sandra Kiefer, Ilia Ponomarenko and Pascal Schweitzer The Weisfeiler-Leman dimension of planar graphs is at most 3 ( abstract )
14:05	Iddo Tzameret and Stephen Cook Uniform, Integral and Efficient Proofs for the Determinant Identities ( abstract )
14:30	Jan van den Heuvel, Stephan Kreutzer, Michał Pilipczuk, Roman Rabinovich, Sebastian Siebertz and Daniel A. Quiroz Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion ( abstract )
14:55	Marco Voigt A fine-grained hierarchy of hard problems in the separated fragment ( abstract )

13:40-15:20 Session 8B

Chair:

Martin Hofmann

Location: V1.01

13:40	Thierry Coquand, Bassel Mannaa and Fabian Ruch Stack Semantics of Type Theory ( abstract )
14:05	Eric Finster and Samuel Mimram A Type-Theoretical Definition of Weak omega-Categories ( abstract )
14:30	Ulrik Buchholtz and Egbert Rijke The real projective spaces in homotopy type theory ( abstract )
14:55	Andrej Dudenhefner and Jakob Rehof Typability in Bounded Dimension ( abstract )

15:20-15:50 Session : Coffee Break

15:50-17:30 Session 9A

Chair:

Martin Otto

Location: M1.01

15:50	André Hernich and Phokion Kolaitis Foundations of Information Integration under Bag Semantics ( abstract )
16:15	Hubie Chen and Stefan Mengel The Logic of Counting Query Answers ( abstract )
16:40	Florent Capelli Understanding the complexity of #SAT using knowledge compilation ( abstract )
17:05	Félix Baschenis, Olivier Gauwin, Anca Muscholl and Gabriele Puppis Untwisting two-way transducers in elementary time ( abstract )

15:50-17:30 Session 9B

Chair:

Samuel Mimram

Location: V1.01

15:50	Robert Furber, Dexter Kozen, Kim Larsen, Radu Mardare and Prakash Panangaden Unrestricted Stone Duality for Markov Processes ( abstract )
16:15	Mai Gehrke, Daniela Petrisan and Luca Reggio Quantifiers on languages and codensity monads ( abstract )
16:40	Matteo Mio, Robert Furber and Radu Mardare Riesz Modal Logic for Markov Processes ( abstract )
17:05	G. A. Kavvos Dual-Context Calculi for Modal Logic ( abstract )

Thursday, June 22nd

View this program: with abstracts session overview talk overview

09:00-10:00 Session 10: Invited Talk

Chair:

Kousha Etessami

Location: M1.01

09:00

Corina Pasareanu

Symbolic Execution and Probabilistic Reasoning ( abstract )

10:00-10:30 Session : Coffee Break

10:30-12:10 Session 11A

Chair:

Laurent Fribourg

Location: M1.01

10:30	Benjamin Kaminski and Joost-Pieter Katoen A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations ( abstract )
10:55	Rohit Chadha, A. Prasad Sistla and Mahesh Viswanathan Verification of randomized security protocols ( abstract )
11:20	Richard Mayr, Sven Schewe, Patrick Totzke and Dominik Wojtczak MDPs with Energy-Parity Objectives ( abstract )
11:45	Christoph Haase, Stefan Kiefer and Markus Lohrey Computing Quantiles in Markov Chains with Multi-Dimensional Costs ( abstract )

10:30-12:10 Session 11B

Chair:

Johann Makowsky

Location: V1.01

10:30	Abbas Edalat and Mehrdad Maleki Differentiation in Logical Form ( abstract )
10:55	Mathieu Hoyrup and Walid Gomaa On the extension of computable real functions ( abstract )
11:20	Florian Steinberg and Matthias Schröder Bounded time computation on metric spaces and Banach spaces ( abstract )
11:45	Venanzio Capretta and Jonathan Fowler The Continuity of Monadic Stream Functions ( abstract )

12:10-13:40 Session : Lunch

Lunch

13:40-15:20 Session 12A

Chair:

Christoph Haase

Location: M1.01

13:40	Andrei Bulatov Constraint Satisfaction Problems over semilattice block Mal'tsev algebras ( abstract )
14:05	Johan Thapper and Stanislav Živný The Limits of SDP Relaxations for General-Valued CSPs ( abstract )
14:30	Michał Wrona The Complexity of Minimal Inference Problem for Conservative Constraint Languages ( abstract )
14:55	Libor Barto, Michael Kompatscher, Miroslav Olsak, Trung Van Pham and Michael Pinsker The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent ( abstract )

13:40-15:20 Session 12B

Chair:

Radu Mardare

Location: V1.01

13:40	Pierre-Marie Pédrot and Nicolas Tabareau An Effectful Way to Eliminate Addiction to Dependence ( abstract )
14:05	Valentin Blot An interpretation of system F through bar recursion ( abstract )
14:30	Patrick Bahr, Hans Bugge Grathwohl and Rasmus Ejlers Møgelberg The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion ( abstract )
14:55	Vincent Rahli, Mark Bickford and Robert Constable Bar Induction: The Good, the Bad, and the Ugly ( abstract )

15:20-15:50 Session : Coffee Break

15:50-17:50 Session 13: Award Session and LICS Business Meeting

Award Session and LICS Business Meeting

Location: M1.01

19:30-22:30 Session : Conference Banquet

Conference Banquet

Friday, June 23rd

View this program: with abstracts session overview talk overview

09:00-10:00 Session 14: Invited Tutorial

Chair:

Prakash Panangaden

Location: M1.01

09:00

Thomas Colcombet

Logic and regular cost functions ( abstract )

10:00-10:30 Session : Coffee Break

10:30-12:10 Session 15A

Chair:

Emmanuel Jeandel

Location: M1.01

10:30	Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo Perez and Jean-Francois Raskin On Delay and Regret Determinization of Max-Plus Automata ( abstract )
10:55	Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi and Dominik Wojtczak On Strong Determinacy of Countable Stochastic Games ( abstract )
11:20	Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic and Sylvain Schmitz Perfect Half Space Games ( abstract )
11:45	Julien Cervelle and Gregory Lafitte On shift-invariant maximal filters and hormonal cellular automata ( abstract )

10:30-12:10 Session 15B

Chair:

Marcelo Arenas

Location: V1.01

10:30	Martin Grohe and Martin Ritzert Learning first-order definable concepts over structures of small degree ( abstract )
10:55	Miguel Romero Orth, Pablo Barceló and Moshe Vardi The Homomorphism Problem for Regular Graph Patterns ( abstract )
11:20	Dietrich Kuske and Nicole Schweikardt First-order logic with counting: At least, WEAK Hanf normal forms always exist and can be computed! ( abstract )
11:45	Samson Abramsky, Anuj Dawar and Pengming Wang The Pebbling Comonad in Finite Model Theory ( abstract )

12:10-13:40 Session : Lunch

Lunch

13:40-14:55 Session 16A

Chair:

Marcin Jurdzinski

Location: M1.01

13:40	Karin Quaas, Mahsa Shirmohammadi and James Worrell Revisiting Reachability in Timed Automata ( abstract )
14:05	Lorenzo Clemente, Slawomir Lasota, Ranko Lazic and Filip Mazowiecki Timed pushdown automata and branching vector addition systems ( abstract )
14:30	Bakh Khoussainov and Toru Takisaka Large scale geometries of infinite strings ( abstract )
14:55	Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin and Moshe Vardi Strategy Logic with Imperfect Information ( abstract )

13:40-15:20 Session 16B

Chair:

Aleks Kissinger

Location: V1.01

13:40	Dusko Pavlovic and Peter-Michael Seidel Quotients in monadic programming: Projective algebras are equivalent to coalgebras ( abstract )
14:05	Simone Bova and Fabio Mogavero Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries ( abstract )
14:30	Dimitri Surinx, Jan Van den Bussche and Dirk Van Gucht The primitivity of operators in the algebra of binary relations under conjunctions of containments ( abstract )
14:55	Michaël Cadilhac and Charles Paperman A Crevice on the Crane Beach: Finite-Degree Predicates ( abstract )

15:20-15:50 Session : Coffee Break

15:50-17:30 Session 17A

Chair:

Valentin Blot

Location: M1.01

15:50	Krzysztof Bar and Jamie Vicary Data structures for quasistrict higher categories ( abstract )
16:15	Jasmin Christian Blanchette, Fabian Meier, Andrei Popescu and Dmitriy Traytel Foundational Nonuniform (Co)datatypes for Higher-Order Logic ( abstract )
16:40	Ohad Kammar, Paul Blain Levy, Sean Moss and Sam Staton A monad for full ground reference cells ( abstract )
17:05	Ugo Dal Lago, Francesco Gavazzo and Paul Blain Levy Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method ( abstract )

15:50-17:30 Session 17B

Chair:

Patricia Johann

Location: V1.01

15:50	Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous and Alan Schmitt Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines ( abstract )
16:15	Bahareh Afshari and Graham Leigh Cut-free Completeness for Modal Mu-Calculus ( abstract )
16:40	Felix Canavoi and Martin Otto Common Knowledge and Multi-Scale Locality Analysis in Cayley Structures ( abstract )
17:05	Stefano Berardi and Makoto Tatsuta Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic ( abstract )

17:30-17:35 Session 18: Closing Remarks

Closing Remarks