MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Aiming Low is Harder: Inductive Lower Bounds in Probabilistic Program Verification

Marcel Hark
RWTH Aachen
Talk
AG 1, AG 2, AG 3, INET, AG 4, AG 5, SWS, RG1, MMCI  
AG Audience
English

Date, Time and Location

Tuesday, 20 August 2019
16:00
60 Minutes
E1 5
630
Saarbrücken

Abstract

Expected outcomes of probabilistic programs can be described

by least fixed points of certain continuous functions.
Whereas upper bounds are already well studied and simple
to infer in general, there is no widely-applicable rule for
determining lower bounds. In this talk, we will present the
first inductive rule for the inference of lower bounds on
expected outcomes of probabilistic programs by connecting
the results from fixed point theory with the Optional Stopping Theorem.

Contact

Jennifer Müller
2900
--email hidden
passcode not visible
logged in users only

Jennifer Müller, 08/16/2019 13:00 -- Created document.