Invited speakers
Automating Proof Rules for Probabilistic Programs
Over the last 15+ years, probabilistic programs have received much attention. By now, there exists a plethora of proof rules for quantifying, amongst others, the termination probability or expected runtimes of such programs. Those rules must be adapted and combined to enable the verification of feature-rich probabilistic programming languages. In this talk, I will discuss ongoing work on developing an intermediate verification infrastructure for automating proof rules for probabilistic programs.
Christoph Matheja
Professor in Computer Science
University of Oldenburg, Germany
DTU Technical University of Denmark, Denmark
Christoph Matheja is a Professor at the University of Oldenburg and an associate professor at the Technical University of Denmark. His research interests include deductive verification techniques and model checking of probabilistic and heap-manipulating systems.
Title TBD
Abstract TBD
Alessandro Abate
Professor in Computer Science
University of Oxford, UK
Bio TBD
Title TBD
Abstract TBD
Feng Lu
Associate Professor in Computer Science
University of Virginia, USA
Bio TBD