
Data Refinement
Model-Oriented Proof Methods and their Comparison
Cambridge University Press
Published on 3. December 1998
Book
Hardback
436 pages
978-0-521-64170-8 (ISBN)
Description
The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The book's second part contains a detailed survey of important methods in this field, which are carefully analysed, and shown to be either incomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analysed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation.
Reviews / Votes
"The presentation of the theory is backed up by some substantial examples...and this together with the extensive historical notes makes the book an extremely useful reference manual and graduate text."More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises; 18 Halftones, unspecified
Dimensions
Height: 235 mm
Width: 157 mm
Thickness: 30 mm
Weight
854 gr
ISBN-13
978-0-521-64170-8 (9780521641708)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Author
Christian-Albrechts Universitaet zu Kiel, Germany
University of Technology, Sydney
Content
Part I. Theory: 1. Introduction to data refinement; 2. Simulation as a proof method for data refinement; 3. Relations and recursion; 4. Properties of simulation; 5. Notation and semantics; 6. A Hoare logic; 7. Simulation and Hoare logic; 8. An extension to total correctness; 9. Simulation and total correctness; 10. Refinement calculus; Part II. Applications: 11. Reynolds' method; 12. VDM; 13. Z, Hehner's method and Back's refinement calculus; 14. Refinement methods due to Abadi & Lamport and Lynch. Appendix A. An introduction to Hoare logic; Appendix B. A primer on ordinals and transfinite induction; Appendix C. Notational convention; Appendix D. Precedences; Bibliography; Index.