Abstract
The paper describes a programming discipline, aiming at the systematic construction of programs from given global requirements. The crucial step in the approach is the conversion of the global requirements into sets of action clusters (sequences of program statements), which are then used as building blocks for the final program. The relation of the approach to proof techniques and to programming languages is discussed briefly.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Naur, P.,Proof of Algorithms by General Snapshots, BIT 6 (1966), 310–316.
Floyd, Robert W.,Assigning Meanings to Programs, Proc. of Symposia in Applied Mathematics, Vol. 19, American Mathematical Society, 1967.
Dijkstra, E. W.,A Constructive Approach to the Problem of Program Correctness, BIT 8 (1968), 174–186.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Naur, P. Programming by action clusters. BIT 9, 250–258 (1969). https://doi.org/10.1007/BF01946816
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01946816