Abstract
In Chapter 1, we established the following method of top-down design of an algorithm to solve a given problem:
“Decompose the overall problem into precisely specified subproblems, and prove that if each subproblem is solved correctly and these solutions are fitted together in a specified way then the original problem will be solved correctly. Repeat the process of “decompose and prove correctness of the decomposition” for the subproblems; and keep repeating this process until reaching subproblems so simple that their solution can be expressed in a few lines of a programming language.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag, New York Inc.
About this chapter
Cite this chapter
Alagić, S., Arbib, M.A. (1978). Basic Compositions of Actions and Their Proof Rules. In: The Design of Well-Structured and Correct Programs. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6272-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6272-5_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6274-9
Online ISBN: 978-1-4612-6272-5
eBook Packages: Springer Book Archive