Conference Program

[printable version]

All talks will be held in the Gates Hall auditorium (G01).

Thursday June 12
8:30-9:30 Tutorial: Prakash Panangaden
Labelled Markov Processes
9:30-10:10 Radu Mardare, Bingtian Xue, Kim Guldstrand Larsen and Samy Jaziri
Adequacy and Complete Axiomatization for Timed Modal Logic
10:40-11:40 Plenary: Dexter Kozen
11:40-12:20 Jiri Adámek, Stefan Milius, Robert Myers and Henning Urbat
On Continuous Nondeterminism and State Minimality
12:20-13:00 Liang-Ting Chen and Achim Jung
On a Categorical Framework for Coalgebraic Modal Logic
14:30-15:30 Tutorial: Josée Desharnais
Logical Characterization of Bisimulation for Labelled Markov Processes
15:30-16:10 Tetsuya Sato
Identifying All Preorders on the Subdistribution Monad
16:40-17:20 Maciej Piróg and Jeremy Gibbons
The Coinductive Resumption Monad
17:20-18:00 Danel Ahman and Tarmo Uustalu
Coalgebraic Update Lenses
18:00-19:30 Reception - Gates Hall Atrium
Friday June 13
Special Session on Quantum Computing
8:30-9:30 Plenary: Elham Kashefi
9:30-10:10 Bart Jacobs
Quantum Predicates and Instruments
10:40-11:20 Mark Hillery
Quantum Property Testing of Boolean Functions
11:20-12:00 Mathys Rennela
Towards a Quantum Domain Theory: Order-Enrichment and Fixpoints in W*-Algebras
14:00-14:40 Azalea Raad, Philippa Gardner, Adam Wright and Mark Wheelhouse
Abstract Local Reasoning for Concurrent Libraries: Mind the Gap
14:40-15:20 Stephen Brookes
On Grainless Footprint Semantics for Shared-Memory Programs
15:20-16:20 Plenary: Alexandra Silva
The Generalized Powerset Construction: Applications to Semantics and Concurrency
17:00-21:00Excursion and Conference Dinner
Saturday June 14
9:10-10:10 Tutorial: Radu Mardare
Proof Systems for Markovian Logics: Completeness and Dualities
10:40-11:40 Plenary: Nick Benton
11:40-12:20 Dariusz Biernacki and Sergueï Lenglet
Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus
12:20-13:00 Marc Lasson
Canonicity of Groupoid Laws using Parametricity Theory
Special Session on Probabilistic Computing
14:30-15:30 Plenary: Andy Gordon
Probabilistic Programming in Tabular
15:30-16:10 Daniel M. Roy
Conditional Independence, Computability, and Measurability
16:40-17:20 Chung-chieh Shan
Conditioning and Density, Mathematically and Computationally
17:20-18:00 Dexter Kozen, Radu Mardare and Prakash Panangaden
A Metric Analog of Stone Duality for Markov Processes
18:00-18:40 Jean Goubault-Larrecq and Achim Jung
QRB, QFS, and the Probabilistic Powerdomain
Sunday June 15
8:30-9:30 Tutorial: Doina Precup
Approximate Dynamic Programming and Learning Methods for Markov Decision Processes
9:30-10:10 Simon Castellan, Jonathan Hayman, Glynn Winskel and Marc Lasson
Strategies as Concurrent Processes
10:40-11:20 Giulio Manzonetto and Domenico Ruoppolo
Relational Graph Models, Taylor Expansion and Extensionality
11:20-12:00 Robin Cockett and Pieter Hofstra
The Total Maps of Turing Categories
12:00-13:00 Plenary: Prakash Panangaden
Probabilistic Concurrent Constraint Programming