Communications of the ACM
Program development by stepwise refinement
Communications of the ACM
Communications of the ACM
BLISS: a language for systems programming
Communications of the ACM
Letters to the editor: go to statement considered harmful
Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
Reflections on a systems programming language
Proceedings of the SIGPLAN symposium on Languages for system implementation
An algebraic description of programs with assertions, verification and simulation
Proceedings of ACM conference on Proving assertions about programs
Inductive methods for proving properties of programs
Proceedings of ACM conference on Proving assertions about programs
Termination of algorithms
A program verifier
ACM SIGPLAN Notices
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
A fast and usually linear algorithm for global flow analysis
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A method to expose the hidden structure of Fortran programs
ACM '74 Proceedings of the 1974 annual conference - Volume 1
LINUS: A structured language for instructional use
SIGCSE '74 Proceedings of the fourth SIGCSE technical symposium on Computer science education
A generative nested-sequential basis for general-purpose programming languages
ACM SIGPLAN Notices - Abstracts in programming language-related research
Issues in programming language design: an overview
ACM SIGPLAN Notices - Special issue on programming language design
LINUS: an experiment in language preprocessing
ACM SIGPLAN Notices
The roots of structured programming
SIGCSE '78 Papers of the SIGCSE/CSA technical symposium on Computer science education
A top-down view of software engineering
ACM SIGSOFT Software Engineering Notes
Issues in programming language design: an overview
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Better manpower utilization using automatic restructuring
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
| Hi-index | 0.00 |
It has been proposed, by E. W. Dijkstra and others, that the goto statement in programming langauge is a principal culprit in programs which are difficult to understand, modify, and debug. More correctly, the argument is that it is possible to use the goto to synthesize program structures with these undesirable properties. Not all uses of the goto are to be considered harmful; however, it is further argued that the "good" uses of the goto fall into one of a small number of specific cases which may be handled by specific language constructs. This paper summarizes the arguments in favor of eliminating the goto statement and some of the theoretical and practical implications of the proposal.