A genealogy of control structures
Communications of the ACM
On the capabilities of while, repeat, and exit statements
Communications of the ACM
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Structured programming, programming teaching and the language Pascal
ACM SIGPLAN Notices
Classics in software engineering
Classics in software engineering
Structured programming: top-down approach
Classics in software engineering
Structured programming with go to statements
Classics in software engineering
A proof-checker for dynamic logic
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Partial evaluation of the reversible language janus
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
A hoare calculus for the verification of synchronous languages
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Hi-index | 0.03 |
In this paper we show that every flowchart program can be written without $underline{go to}$ statements by using $underline{while}$ statements. The main idea is to introduce new variables to preserve the values of certain variables at particular points in the program; or alternatively, to introduce special boolean variables to keep information about the course of the computation. The ''while'' programs produced yield the same final results as the original flowchart program but need not perform computations in exactly the same way. However, the new programs do preserve the ''topology'' of the original flowchart program, and are of the same order of efficiency. We also show that this cannot be done in general without adding variables.