Download now Free registration required
The authors present a methodology and implementation for verifying ANSI-C programs that exhibit probabilistic behaviour, such as failures or randomisation. They use abstraction-refinement techniques that represent probabilistic programs as Markov decision processes and their abstractions as stochastic two-player games. They techniques target quantitative properties of software such as "The maximum probability of file-transfer failure" or "The minimum expected number of loop iterations" and the abstractions they construct yield lower and upper bounds on these properties, which then guide the refinement process.
- Format: PDF
- Size: 523.2 KB