Basic Compositions of Actions and Their Proof Rules

  • Suad Alagić
  • Michael A. Arbib
Part of the Texts and Monographs in Computer Science book series (MCS)


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.”


Basic Composition Integer Variable Exit Point Conditional Statement Logical Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag, New York Inc. 1978

Authors and Affiliations

  • Suad Alagić
    • 1
  • Michael A. Arbib
    • 2
  1. 1.Department of Informatics, Faculty of Electrical EngineeringUniversity of SarajevoSarajevoYugoslavia
  2. 2.Department of Computer and Information ScienceUniversity of MassachusettsAmherstUSA

Personalised recommendations