Invited Speakers

Olivier Bournez, École Polytechnique, LIX
On the Computational Complexity of Solving Ordinary Differential Equations [abstract]

Maria Prandini, Politecnico di Milano
Reachability in Cyber-Physical Systems [abstract]

Marcin Jurdziński, University of Warwick
Universal Trees and Quasi-Polynomial Algorithms for Solving Parity Games [abstract]

Jérémie Chalopin, CNRS, Aix-Marseille Université, LIS
A Counterexample to Thiagarajan’s Conjecture on Regular Event Structures [abstract]

Tutorial Speaker

Marta Kwiatkowska, University of Oxford
Safety Verification for Deep Neural Networks with Provable Guarantees [abstract]