Computer Science – Logic in Computer Science
Scientific paper
2010-06-26
EPTCS 28, 2010, pp. 34-47
Computer Science
Logic in Computer Science
Scientific paper
10.4204/EPTCS.28.3
The weakest pre-expectation calculus has been proved to be a mature theory to analyze quantitative properties of probabilistic and nondeterministic programs. We present an automatic method for proving quantitative linear properties on any denumerable state space using iterative backwards fixed point calculation in the general framework of abstract interpretation. In order to accomplish this task we present the technique of random variable abstraction (RVA) and we also postulate a sufficient condition to achieve exact fixed point computation in the abstract domain. The feasibility of our approach is shown with two examples, one obtaining the expected running time of a probabilistic program, and the other the expected gain of a gambling strategy. Our method works on general guarded probabilistic and nondeterministic transition systems instead of plain pGCL programs, allowing us to easily model a wide range of systems including distributed ones and unstructured programs. We present the operational and weakest precondition semantics for this programs and prove its equivalence.
Barsotti Damián
Wolovick Nicolás
No associations
LandOfFree
Automatic Probabilistic Program Verification through Random Variable Abstraction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Automatic Probabilistic Program Verification through Random Variable Abstraction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic Probabilistic Program Verification through Random Variable Abstraction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-525562