Developing and Reasoning About Probabilistic Programs in pGCL

  • Annabelle McIver
  • Carroll Morgan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3167)


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


Outer Loop Probabilistic Choice Probabilistic Program Loop Body Probabilistic Semantic 
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.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Annabelle McIver
    • 1
  • Carroll Morgan
    • 2
  1. 1.Department of Computer ScienceMacquarie UniversityAustralia
  2. 2.Department of Computer Science and EngineeringUniversity of New South WalesAustralia

Personalised recommendations