Computer program construction
Author(s)
Bibliographic Information
Computer program construction
Oxford University Press, 1994
Available at / 8 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 369-373) and index
Description and Table of Contents
Description
This book presents a comprehensive treatment of the process of constructing computer programs through stepwise resolutions of relational equations. Unlike other books that take a logic-based approach to the topic, the authors derive constructive solutions to these equations by means of programming heuristics, three classes of which are presented in detail; sequence heuristics, iteration heuristics, and generalization heuristics. The authors are the leaders in this field and their experience is wonderfully showcased in this definitive introduction to the subject.
Table of Contents
- Preface
- 1. Sets and relations
- 2. Program specifications
- 3. Breaking text into lines
- 4. Program correctness
- 5. Program construction
- 6. A construction exercise: Justifying text
- 7
- 8. Heuristics for generalization
- 9. An exercise in inductive decomposition
- 10. The weakest prespecification problem
- 11. The initialization problem
- 12. Exercises in sequential decomposition
- 13. The demonic sequential specifications
- 14. Programming from composite specifications
- 15. An exercise in construction yb parts: Upsort
- Summary
- Appendices
by "Nielsen BookData"
