Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Aiming Low is Harder: Inductive Lower Bounds in Probabilistic Program Verification
Speaker:Marcel Hark
coming from:RWTH Aachen
Speakers Bio:
Event Type:Talk
Visibility:D1, D2, D3, INET, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 20 August 2019
Duration:60 Minutes
Building:E1 5
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.

Name(s):Jennifer Müller
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Jennifer Müller, 08/16/2019 01:00 PM -- Created document.