Refinement Calculus, Lattices and Higher Order Logic

Back, R.J.R. (1992) Refinement Calculus, Lattices and Higher Order Logic. Technical Report. California Institute of Technology. [CaltechCSTR:1992.cs-tr-92-22]

Full text available as:

	Postscript - Requires a viewer, such as GhostView
	Other (Adobe PDF (829KB))

Abstract

We show how to describe refinement calculus in a lattice theoretic framework. The predicate transformer lattice is built by pointwise extensions from the truth value lattice. A simple but very powerful statement language characterizes the monotonic predicate transformer lattice. We show how to formalize the calculus in higher order logic. We also show how to express data refinement in this framework. A theorem of data refinement with stuttering is proved, to illustrate the algebraic nature of reasoning in this framework.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	110
Deposited By:	Caltech Library System
Deposited On:	25 April 2001
Record Number:	CaltechCSTR:1992.cs-tr-92-22
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1992.cs-tr-92-22
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record