2006 | OriginalPaper | Buchkapitel
Developing and Reasoning About Probabilistic Programs in pGCL
verfasst von : Annabelle McIver, Carroll Morgan
Erschienen in: Refinement Techniques in Software Engineering
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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