most citedA Deductive Verification Infrastructure for Probabilistic Programs (Extended Version)

22 citations · 22 across the 3 of their papers we have counts for

collaborators

1 paper

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…