A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Relatively Complete Verification of Probabilistic Programs
[article]
2022
arXiv
pre-print
We study a syntax for specifying quantitative "assertions" - functions mapping program states to numbers - for probabilistic program verification. We prove that our syntax is expressive in the following sense: Given any probabilistic program C, if a function f is expressible in our syntax, then the function mapping each initial state σ to the expected value of f evaluated in the final states reached after termination of C on σ (also called the weakest preexpectation wp [C](f)) is also
arXiv:2010.14548v2
fatcat:w2yolfpg4fc4zk4mieomwfznoe