scientific article; zbMATH DE number 4047034
This book introduces the reader, who should be familiar with the fundamentals of programming, to formal reasoning about programs. With the help of examples, the authors show that the process of constructing an efficient program is closely related to proof and analysis techniques. Chapter 1 introduces the basic concepts used to prove termination and partial correctness of iterative programs. In the next chapter, these concepts are applied to construction of some example programs. The same plan is followed in chapters 4 and 5 with respect to recursive programs. The discussion is not only restricted to typical programs (binary search, quicksort), but also includes some general principles. An informative example is the analysis of how time complexity depends on the decomposition of a problem into smaller ones. Chapters 3 and 6 are concerned with advanced topics and can be omitted at a first reading. The first presents the axiomatic approach to program verification, including some rules on pointers and procedure calls. The last chapter discusses translation of recursive programs into iterative ones. The authors explain the standard method of eliminating tail recursion; subsequently, they give insight into the general case and set importance to techniques that must also be used by compilers and run-time organization. At the end of each chapter, the readers find a small number of exercises and some hints for further reading.
- A calculus of refinements for program derivations
- scientific article; zbMATH DE number 4013991 (Why is no real title available?)
- Constructing correct software.
- scientific article; zbMATH DE number 3938521 (Why is no real title available?)
- scientific article; zbMATH DE number 977284 (Why is no real title available?)
- scientific article; zbMATH DE number 1042201 (Why is no real title available?)
- The correctness-by-construction approach to programming
- A Programmer's Companion to Algorithm Analysis
- scientific article; zbMATH DE number 7642012 (Why is no real title available?)
- Loop invariants in floating point algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783489)