Hark, M;
Kaminski, BL;
Giesl, J;
Katoen, J-P;
(2020)
Aiming Low Is Harder -- Induction for Lower Bounds in Probabilistic Program Verification.
Proceedings of the ACM on Programming Languages
, 4
(POPL)
, Article 37. 10.1145/3371105.
Preview |
Text
Kaminski_3371105.pdf - Published Version Download (477kB) | Preview |
Abstract
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.
| Type: | Article |
|---|---|
| Title: | Aiming Low Is Harder -- Induction for Lower Bounds in Probabilistic Program Verification |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1145/3371105 |
| Publisher version: | http://dx.doi.org/10.1145/3371105 |
| Language: | English |
| Additional information: | This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
| Keywords: | cs.LO, cs.LO, cs.PL |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10089704 |
Archive Staff Only
 |
View Item |
