Affiliation:
1. RWTH Aachen University, Germany
2. University College London, UK
3. ETH Zurich, Switzerland
Abstract
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 evaluated in the final states reached after termination of
C
on σ (also called the weakest preexpectation wp[
C
](
f
)) is also expressible in our syntax.
As a consequence, we obtain a
relatively complete verification system
for reasoning about expected values and probabilities in the sense of Cook: Apart from proving a single inequality between two functions given by syntactic expressions in our language, given
f
,
g
, and
C
, we can check whether
g
≼ wp[
C
](
f
).
Funder
European Research Council
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference54 articles.
1. Fifty years of Hoare’s logic
2. Quantitative separation logic: a logic for reasoning about probabilistic pointer programs
3. Joseph Bertrand. 1849. Traité d'Arithmétique. Libraire de L. Hachette et Cie. Joseph Bertrand. 1849. Traité d'Arithmétique. Libraire de L. Hachette et Cie.
4. Proving Positive Almost-Sure Termination
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献