A Caltech Library Service

Predicate Transformers and Higher Order Logic

Back, R. J. R. (1992) Predicate Transformers and Higher Order Logic. Computer Science Technical Reports, California Institute of Technology , Pasadena, CA. (Unpublished)

Postscript - Submitted Version
See Usage Policy.

PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reasoning about total correctness and refinement of programs. The notions of program variables and logical variables are explicated in the formalization. We show how to describe common program constructs, such as assignment statements, sequential and conditional composition, iteration, recursion, blocks and procedures with parameters, axe described as predicate transformers in this framework. We also describe some specification oriented constructs, such as assert statements, guards and nondeterministic assignments. The monotonicity of these constructs over the lattice of predicates is proved, as well as the monotonicity of the statement constructors with respect to the refinement ordering on predicate transformers.

Item Type:Report or Paper (Technical Report)
Additional Information:© 1992 California Institute of Technology.
Group:Computer Science Technical Reports
Other Numbering System:
Other Numbering System NameOther Numbering System ID
Computer Science Technical Reports92-24
Series Name:Computer Science Technical Reports
Record Number:CaltechCSTR:1992.cs-tr-92-24
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26767
Deposited By: Imported from CaltechCSTR
Deposited On:25 Apr 2001
Last Modified:03 Oct 2019 03:17

Repository Staff Only: item control page