Control Computations and the Design of Loop Control Structures
- 1 March 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-4 (2) , 81-89
- https://doi.org/10.1109/tse.1978.231478
Abstract
The control computation for a loop in a program is that part of the program concerned with the initialization, incrementation, and testing of the variables that determine the flow of control into, through, and out of the loop. The elements of loop control computations are idenified and their role in structuring our understanding of loops is analyzed. It is argued, through examples drawn from a Pascal compiler, that the intelligibility of a loop is closely tied to the accessibility and intelligibility of the loop control computation. It is further argued, from an analysis of all the loops in this compiler, that most loop control computations fail in a few standard patterns, mostly concerned with the sequential processing of elements of data structures. In light of these results, common loop control statements are critiqued. It appears that better loop control structures than the while, repeat-until, and similar statement structures are possible and desirable, and some proposals for better structures are given.Keywords
This publication has 7 references indexed in Scilit:
- Abstraction and verification in AlphardCommunications of the ACM, 1977
- Report on the programming language EuclidACM SIGPLAN Notices, 1977
- Abstraction mechanisms in CLUPublished by Association for Computing Machinery (ACM) ,1977
- GypsyPublished by Association for Computing Machinery (ACM) ,1977
- A genealogy of control structuresCommunications of the ACM, 1975
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- The Synthesis of Algorithmic SystemsJournal of the ACM, 1967