VERIFICATION OF PROBABILISTIC PROGRAMS.

Micha Sharir*, Amir Pnueli, Sergiu Hart

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

44 Scopus citations

Abstract

A general method for proving properties of probabilistic programs is presented. This method generalizes the intermediate assertion method in that it extends a given assertion on the output distribution into an invariant assertion on all intermediate distributions, too. The proof method is shown to be sound and complete for programs which terminate with probability 1. A dual approach, based on the expected number of visits in each intermediate state, is also presented. All the methods are presented under the uniform framework which considers a probabilistic program as a discrete Markov process.

Original languageEnglish
Pages (from-to)292-314
Number of pages23
JournalSIAM Journal on Computing
Volume13
Issue number2
DOIs
StatePublished - 1984
Externally publishedYes

Fingerprint

Dive into the research topics of 'VERIFICATION OF PROBABILISTIC PROGRAMS.'. Together they form a unique fingerprint.

Cite this