activity
20142026
most citedAiming Low Is Harder -- Induction for Lower Bounds in Probabilistic Program Verification

47 citations · 183 across the 23 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

cs.LO2014

Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard

Benjamin Lucien Kaminski, Joost-Pieter Katoen

This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure ter…