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.
Key wordsProgramming algorithms proof correctness programming language
Unable to display preview. Download preview PDF.
- 1.Naur, P.,Proof of Algorithms by General Snapshots, BIT 6 (1966), 310–316.Google Scholar
- 2.Floyd, Robert W.,Assigning Meanings to Programs, Proc. of Symposia in Applied Mathematics, Vol. 19, American Mathematical Society, 1967.Google Scholar
- 3.Dijkstra, E. W.,A Constructive Approach to the Problem of Program Correctness, BIT 8 (1968), 174–186.Google Scholar