Abstract
We define a propositional programming language for probabilistic program schemes and study the equational properties of the programs thus arising.
Preview
Unable to display preview. Download preview PDF.
References
Y. Feldman and D. Harel, "A Probabilistic Dynamic Logic", Proceedings of the 14th STOC, (1982) pp.181–195.
Y. Feldman, "A Decidable Propositional Probabilistic Dynamic Logic", Proceedings of the 15th STOC (1983) pp 298–309.
D. Kozen, "Semantics of Probabilistic Programs", 20th IEEE-FOCS (1979) pp 101–114. Also JCSS vol 22 (1981) pp 328–350.
D. Kozen, "A Probabilistic PDL", 15th ACM-STOC 1983, pp. 291–297.
R. Parikh, "Propositional Logics of Programs: A Survey", Logic of Programs Ed. E. Engeler, Springer LNCS 125, pp 102–144
J. Reif, "Logics for Probabilistic Programming", 12th ACM-STOC (1980) pp 8–13
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parikh, R., Mahoney, A. (1984). A theory of probabilistic programs. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_376
Download citation
DOI: https://doi.org/10.1007/3-540-12896-4_376
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12896-0
Online ISBN: 978-3-540-38775-6
eBook Packages: Springer Book Archive