Part of the Lecture Notes in Computer Science book series (LNCS, volume 164)
A theory of probabilistic programs
We define a propositional programming language for probabilistic program schemes and study the equational properties of the programs thus arising.
KeywordsRecursive Call Dynamic Logic Probabilistic Program Propositional Dynamic Logic Finite Model Property
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [FH]Y. Feldman and D. Harel, "A Probabilistic Dynamic Logic", Proceedings of the 14th STOC, (1982) pp.181–195.Google Scholar
- [F]Y. Feldman, "A Decidable Propositional Probabilistic Dynamic Logic", Proceedings of the 15th STOC (1983) pp 298–309.Google Scholar
- [K1]D. Kozen, "Semantics of Probabilistic Programs", 20th IEEE-FOCS (1979) pp 101–114. Also JCSS vol 22 (1981) pp 328–350.Google Scholar
- [K2]D. Kozen, "A Probabilistic PDL", 15th ACM-STOC 1983, pp. 291–297.Google Scholar
- [P]R. Parikh, "Propositional Logics of Programs: A Survey", Logic of Programs Ed. E. Engeler, Springer LNCS 125, pp 102–144Google Scholar
- [R]J. Reif, "Logics for Probabilistic Programming", 12th ACM-STOC (1980) pp 8–13Google Scholar
© Springer-Verlag Berlin Heidelberg 1984