Abstract: |
pGCL is both a programming language and a specification language that
incorporates both probabilistic and nondeterministic choice, in a unified
manner. Program verification is by refinement or annotation (or both), using
either Hoare triples, or weakest-precondition entailment, in the style of
GCL.
This package provides both a shallow embedding of the language
primitives, and an annotation and refinement framework. The generated
document includes a brief tutorial.
|
BibTeX: |
@article{pGCL-AFP,
author = {David Cock},
title = {pGCL for Isabelle},
journal = {Archive of Formal Proofs},
month = jul,
year = 2014,
note = {\url{http://isa-afp.org/entries/pGCL.shtml},
Formal proof development},
ISSN = {2150-914x},
}
|