| 000 | 01219camuu2200313 a 4500 | |
| 001 | 000045426918 | |
| 005 | 20080314145204 | |
| 008 | 980512s1998 enka b 001 0 eng | |
| 010 | ▼a 98024731 | |
| 020 | ▼a 0521641705 (hardback) | |
| 020 | ▼a 9780521641708 | |
| 035 | ▼a (KERIS)REF000004851466 | |
| 040 | ▼a DLC ▼c DLC ▼d DLC ▼d 211009 | |
| 050 | 0 0 | ▼a QA76.9.C65 ▼b R64 1998 |
| 082 | 0 0 | ▼a 003.3 ▼2 22 |
| 090 | ▼a 003.3 ▼b R719d | |
| 100 | 1 | ▼a Roever, W.-P. de , ▼d 1943-. |
| 245 | 1 0 | ▼a Data refinement : ▼b model-oriented proof methods and their comparison / ▼c Willem-Paul de Roever, Kai Engelhardt ; with the assistance of Karl-Heinz Buth ... [et al.]. |
| 260 | ▼a Cambridge, UK ; ▼a New York, NY : ▼b Cambridge University Press , ▼c 1998 ▼g (2008 printing) | |
| 300 | ▼a xi, 423 p. : ▼b ill. ; ▼c 24 cm. | |
| 440 | 0 | ▼a Cambridge tracts in theoretical computer science ; ▼v 47 |
| 504 | ▼a Includes bibliographical references (p. 404-418) and index. | |
| 650 | 0 | ▼a Computer simulation. |
| 650 | 0 | ▼a Data structures (Computer science) |
| 650 | 0 | ▼a Computer programs ▼x Verification. |
| 700 | 1 | ▼a Engelhardt, Kai , ▼d 1966- |
| 700 | 1 | ▼a Buth, Karl-Heinz |
| 945 | ▼a KINS |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 003.3 R719d | 등록번호 121166157 (3회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
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.
정보제공 :
목차
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.
정보제공 :