Picture 1 of 7
Stock photo
Picture 1 of 7
Stock photo
Cambridge Tracts in Theoretical Computer Science Ser.: Data Refinement : Model-Oriented Proof Methods and Their Comparison by Kai Engelhardt and Willem-Paul DeRoever (1998, Hardcover)
A
aussto-77 (933)
100% positive feedback
Price:
US $149.00
ApproximatelyRM 625.32
+ $19.19 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherCambridge University Press
ISBN-100521641705
ISBN-139780521641708
eBay Product ID (ePID)218247
Product Key Features
Number of Pages436 Pages
LanguageEnglish
Publication NameData Refinement : Model-Oriented Proof Methods and Their Comparison
SubjectProgramming Languages / General, Programming / General, Software Development & Engineering / General, Computer Simulation, General
Publication Year1998
TypeTextbook
Subject AreaComputers
AuthorKai Engelhardt, Willem-Paul Deroever
SeriesCambridge Tracts in Theoretical Computer Science Ser.
FormatHardcover
Dimensions
Item Height1.3 in
Item Weight29.2 Oz
Item Length9.3 in
Item Width6.3 in
Additional Product Features
Intended AudienceScholarly & Professional
LCCN98-024731
Dewey Edition21
ReviewsThe 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.
Series Volume NumberSeries Number 47
IllustratedYes
Dewey Decimal003.3
Table Of ContentPart 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.
SynopsisThe 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., This is a comprehensive and systematic account of the important and highly applicable method of data refinement. The authors concentrate on principles and begin with an explanation of the fundamental notions. Accessibility and comprehension are emphasized in order to guide newcomers to the area. The book is self-contained, going from advanced undergraduate level but taking the reader to the frontiers of the subject., 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 topics of Hoare Logic and the Refinement Calculus are introduced and a general theory of simulations is developed and related to them. Accessibility and comprehension are emphasized in order to guide newcomers to the area. The book's second part contains a detailed survey of important methods in this field, such as VDM, and the methods due to Abadi & Lamport, Hehner, Lynch and Reynolds, Back's refinement calculus and Z. All these methods are carefully analysed, and shown to be either imcomplete, 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 analyzed 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.
LC Classification NumberQA76.9.C65 R64 1998
Be the first to write a review
