Paper at POPL 2020

The paper entitled “Aiming Low Is Harder: Induction for Lower Bounds in Probabilistic Program Verification” by Marcel Hark, J├╝rgen Giesl, Benjamin Kaminski and Joost-Pieter Katoen has been accepted for the 47th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2020). The paper tackles the problem of finding lower bounds of expected values / run-times of the output of probabilistic unbounded loops by establishing a tight connection between expectation transformers and stochastic processes.