Abstract. Following earlier models, we lift standard deterministic and nondeterministic semantics of imperative programs to probabilistic semantics. This semantics allows for random external inputs of known or unknown probability and random number generators. We then propose a method of analysis of programs according to this semantics, in the general framework of abstract interpretation. This method lifts an "ordinary" abstract lattice, for non-probabilistic programs, to one suitable for probabilistic programs. Our construction is highly generic. We discuss the influence of certain parameters on the precision of the analysis, basing ourselves on experimental results.
We use the framework of abstract interpretation of probabilistic programs defined in our earlier work REF .
Abstract interpretation of probabilistic semantics
In Seventh International Static Analysis Symposium (SAS’00), number 1824 in Lecture Notes in Computer Science
Computer Science