An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs

Details An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs

2007-01-30

arxiv.org/abs/cs/0701195v1

POPL: Annual Symposium on Principles of Programming Languages (2001) 93 - 101

Computer Science

Programming Languages

Scientific paper

10.1145/360204.360211

We introduce a new method, combination of random testing and abstract interpretation, for the analysis of programs featuring both probabilistic and non-probabilistic nondeterminism. After introducing "ordinary" testing, we show how to combine testing and abstract interpretation and give formulas linking the precision of the results to the number of iterations. We then discuss complexity and optimization issues and end with some experimental results.

Affiliated with

Also associated with

No associations

Rating

An Abstract Monte-Carlo Method for the Analysis of 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 Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-470294