Invited Speakers
Keynote Speakers
- Ezio Bartocci, TU Wien
- Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach
- Joost-Pieter Katoen, RWTH Aachen
- Programmatic Synthesis for Infinite MDPs Using Program Refinement
- Antonín Kučera, Masaryk University
- The Satisfiability and Validity Problems for Probabilistic CTL
- Ruzica Piskac, Yale University
- Proofs as Polynomials
Tutorial Speaker
- K. S. Thejaswini, IST Austria
-
Solving Parity and Rabin Games by Constructing Universal Trees
-
