Aiming low is harder: induction for lower bounds in probabilistic program verification

@article{Hark2020AimingLI,
  title={Aiming low is harder: induction for lower bounds in probabilistic program verification},
  author={M. Hark and Benjamin Lucien Kaminski and Jurgen Giesl and J. Katoen},
  journal={Proceedings of the ACM on Programming Languages},
  year={2020},
  volume={4},
  pages={1 - 28}
}
  • M. Hark, Benjamin Lucien Kaminski, +1 author J. Katoen
  • Published 2020
  • Computer Science
  • Proceedings of the ACM on Programming Languages
  • 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. 
    6 Citations

    Figures and Tables from this paper.

    References

    SHOWING 1-7 OF 7 REFERENCES
    Lower Runtime Bounds for Integer Programs
    • 36
    • Highly Influential
    • PDF
    Probability and Random Processes
    • A. Esmaili
    • Mathematics, Computer Science
    • Technometrics
    • 2005
    • 1,156
    • Highly Influential
    Probability and random processes
    • 2,714
    • Highly Influential
    • PDF
    Abstraction and refinement in probabilistic systems
    • 38
    • Highly Influential
    • PDF
    Abstraction, Refinement and Proof for Probabilistic Systems
    • 351
    • Highly Influential
    • PDF
    Synthesizing Probabilistic Invariants via Doob's Decomposition
    • 35
    • Highly Influential
    • PDF
    Weakest Precondition
    • In Proc. of the Annual Symposium on Logic in Computer Science (LICS)
    • 2016