An expectation transformer approach to predicate abstraction and data independence for probabilistic programs

Details An expectation transformer approach to predicate abstraction and data independence for probabilistic programs An expectation transformer approach to predicate abstraction and data independence for probabilistic programs

2010-06-26

arxiv.org/abs/1006.5102v1

EPTCS 28, 2010, pp. 129-143

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.28.9

In this paper we revisit the well-known technique of predicate abstraction to characterise performance attributes of system models incorporating probability. We recast the theory using expectation transformers, and identify transformer properties which correspond to abstractions that yield nevertheless exact bound on the performance of infinite state probabilistic systems. In addition, we extend the developed technique to the special case of "data independent" programs incorporating probability. Finally, we demonstrate the subtleness of the extended technique by using the PRISM model checking tool to analyse an infinite state protocol, obtaining exact bounds on its performance.

Affiliated with

Also associated with

No associations

Rating

An expectation transformer approach to predicate abstraction and data independence for probabilistic programs 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 An expectation transformer approach to predicate abstraction and data independence for probabilistic programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An expectation transformer approach to predicate abstraction and data independence for probabilistic programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-525579