Abstract
As explained in Chapter 1, Dijkstra’s guarded-command language, which we call GCL, was introduced as an intellectual framework for rigorous reasoning about imperative sequential programs; one of its novelties was that it contained explicit “demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL, we provide a means with which also probabilistic programs can be rigorously developed and reasoned about
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
McIver, A., Morgan, C. (2006). Developing and Reasoning About Probabilistic Programs in pGCL . In: Cavalcanti, A., Sampaio, A., Woodcock, J. (eds) Refinement Techniques in Software Engineering. PSSE 2004. Lecture Notes in Computer Science, vol 3167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889229_4
Download citation
DOI: https://doi.org/10.1007/11889229_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46253-8
Online ISBN: 978-3-540-46254-5
eBook Packages: Computer ScienceComputer Science (R0)