Published January 1, 1992
| Submitted
Technical Report
Open
Refinement Calculus, Lattices and Higher Order Logic
- Creators
- Back, R. J. R.
Chicago
An error occurred while generating the citation.
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.
Additional Information
© 1992 California Institute of Technology. I would like to thank Robert Barta, Ulla Binau, Marcel van de Groot, Peter Hofstee, Rustan Leino, Carroll Morgan, Jan van de Snepscheut and Joakim von Wright for very helpful discussions on the topics treated here.Attached Files
Submitted - 92-22.pdf
Submitted - 92-22.ps
Files
92-22.pdf
Additional details
- Eprint ID
- 26761
- Resolver ID
- CaltechCSTR:1992.cs-tr-92-22
- Created
-
2001-04-25Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Reports
- Other Numbering System Name
- Computer Science Technical Reports
- Other Numbering System Identifier
- 92-22