Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification

04/01/2019
by   Marcel Hark, et al.
0

We present a new inductive proof rule for reasoning about lower bounds on weakest preexpectations, i.e., expected values of random variables after execution of a probabilistic loop. Our rule is simple in the sense that the semantics of the loop needs to be applied to a candidate lower bound only a finite number of times in order to verify that the candidate is indeed a lower bound. We do not require finding the limit of a sequence as many previous rules did. Furthermore, and also in contrast to existing rules, we do not require the random variables to be bounded.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset