Willem-Paul de Roever, Kai Engelhardt
Data Refinement
Model-Oriented Proof Methods and Their Comparison
Willem-Paul de Roever, Kai Engelhardt
Data Refinement
Model-Oriented Proof Methods and Their Comparison
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
Graduate text in formal methods in computer science.
Andere Kunden interessierten sich auch für
Aaron W. PowellBlender 2.5 Lighting and Rendering40,99 €
Gaurav VermaAutodesk CFD 2018 Black Book52,99 €
Jaime Kelly3D Character Rigging in Blender24,99 €
Mina PêcheuxBecome a Unity Shaders Guru50,99 €
Julian H. LinderThe Intuitive Engineer16,99 €
Kal HadiArticulate Storyline 360: The Essentials36,99 €
Peter SchirmerComputer Simulation of General and Flag Officer Management27,99 €-
-
-
Produktdetails
- Produktdetails
- Verlag: Cambridge University Press
- Seitenzahl: 436
- Erscheinungstermin: 1. November 2008
- Englisch
- Abmessung: 229mm x 152mm x 26mm
- Gewicht: 704g
- ISBN-13: 9780521103503
- ISBN-10: 0521103509
- Artikelnr.: 25686198
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
- Verlag: Cambridge University Press
- Seitenzahl: 436
- Erscheinungstermin: 1. November 2008
- Englisch
- Abmessung: 229mm x 152mm x 26mm
- Gewicht: 704g
- ISBN-13: 9780521103503
- ISBN-10: 0521103509
- Artikelnr.: 25686198
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
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.
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.
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.
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.







