Structured Programming With and Without go to Statements

Authors:
C. C. Elgot
Affiliations:
Department of Mathematical Sciences, IBM Thomas J. Watson Research Center
Venue:
IEEE Transactions on Software Engineering
Year:
1976

Citing 0
Cited 2

Comparison of CMM Level 2 and eXtreme Programming

ECSQ '02 Proceedings of the 7th International Conference on Software Quality
A hoare calculus for the verification of synchronous languages

PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

While "Dijkstra flow-chart schemes" (built out of assignment statement schemes by means of composition, IF THEN and WHILEDO) are simple and perspicuous, they lack the descriptive power of flow-chart schemes (provided additional "variables" are not permitted). On the other hand, the analogous multiexit composition binary alternation-conditional iteration (CACI) schemes introduced below, which are virtually as simple and perspicuous as Dijkstra schemes, describe exactly the same computational processes as flow-chart schemes (without the aid of additional variables).