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.
In another approach REF both random testing and abstract interpretation are used for the verification of C programs.
An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs
POPL: Annual Symposium on Principles of Programming Languages (2001) 93 - 101
Computer Science