### 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.

### License

BSD License

### Topics

- Computer science/Programming languages/Language definitions

### Session pGCL

- Misc
- Expectations
- Transformers
- Induction
- Embedding
- Healthiness
- Continuity
- LoopInduction
- Sublinearity
- WellDefined
- Algebra
- StructuredReasoning
- Automation
- Determinism
- Loops
- Termination
- pGCL
- Primitives
- LoopExamples
- Monty

## Cite

×

pGCL-AFP

    @article{pGCL-AFP,
      author  = {David Cock},
      title   = {pGCL for Isabelle},
      journal = {Archive of Formal Proofs},
      month   = {July},
      year    = {2014},
      note    = {\url{https://isa-afp.org/entries/pGCL.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Aug 28, 2014 : Isabelle2014
- Jul 13, 2014 : Isabelle2013-2