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 issimplein 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.

@article{paperbot542,
  title = {Aiming low is harder: induction for lower bounds in probabilistic program verification},
  author = {Marcel Hark and Benjamin Lucien Kaminski and Jürgen Giesl and Joost-Pieter Katoen},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {4},
  number = {POPL},
  year = {2019},
  doi = {10.1145/3371105}
}