POPL 2020 (series) / Research Papers /
Aiming Low Is Harder: Induction for Lower Bounds in Probabilistic Program Verification
Fri 24 Jan 2020 12:07 - 12:30 at Ile de France III (IDF III) - Probabilistic Reasoning and Verification Chair(s): Arthur Azevedo de Amorim
We present a new inductive rule for verifying lower bounds on expected values of random variables after execution of probabilistic loops as well as on their expected runtimes. Our rule is simple in the sense that loop body semantics need to be applied only finitely often in order to verify that the candidates are indeed lower bounds. In particular, it is not necessary to find the limit of a sequence as in many previous rules.
| Slides_Aiming_Low_is_Harder (Talk_Hark_Marcel.pdf) | 1.1MiB |
Fri 24 JanDisplayed time zone: Saskatchewan, Central America change
Fri 24 Jan
Displayed time zone: Saskatchewan, Central America change
11:45 - 12:30 | Probabilistic Reasoning and VerificationResearch Papers at Ile de France III (IDF III) Chair(s): Arthur Azevedo de Amorim Carnegie Mellon University, USA | ||
11:45 22mTalk | Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time Research Papers Peixin Wang Shanghai Jiao Tong University, Hongfei Fu Shanghai Jiao Tong University, Krishnendu Chatterjee IST Austria, Yuxin Deng East China Normal University, Ming Xu East China Normal University Link to publication DOI Media Attached | ||
12:07 22mTalk | Aiming Low Is Harder: Induction for Lower Bounds in Probabilistic Program Verification Research Papers Marcel Hark RWTH Aachen University, Germany, Benjamin Lucien Kaminski RWTH Aachen University, Germany, Jürgen Giesl RWTH Aachen University, Joost-Pieter Katoen RWTH Aachen University Link to publication DOI Media Attached File Attached | ||