An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs
<|reference_start|>An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs: 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.<|reference_end|>
@article{monniaux2007an,
    title={An Abstract Monte-Carlo Method for the Analysis of Probabilistic
  Programs},
    author={David Monniaux (LIENS)},
    journal={POPL: Annual Symposium on Principles of Programming Languages
  (2001) 93 - 101},
    year={2007},
    doi={10.1145/360204.360211},
    archivePrefix={arXiv},
    eprint={cs/0701195},
    primaryClass={cs.PL cs.PF}
}