ACM '72 Proceedings of the ACM annual conference - Volume 2
The translation of ''go to'' programs to ''while'' programs
The translation of ''go to'' programs to ''while'' programs
Formal languages and their relation to automata
Formal languages and their relation to automata
A Control-Flow Normalization Algorithm and its Complexity
IEEE Transactions on Software Engineering
Interactive control restructuring
SETA2 Proceedings of the second international symposium on Environments and tools for Ada
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
Space and Time Hierarchies for Classes of Control Structures and Data Structures
Journal of the ACM (JACM)
An Algorithm for Structuring Flowgraphs
Journal of the ACM (JACM)
A Comparison of Multilevel break and next Statements
Journal of the ACM (JACM)
Structured Programming with go to Statements
ACM Computing Surveys (CSUR)
Jump Minimization in Linear Time
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
On the emulation of flowcharts by decision tables
Communications of the ACM
Communications of the ACM
Syntactic source to source transforms and program manipulation
Communications of the ACM
Structured programming in Cobol: an approach for application programmers
Communications of the ACM
A genealogy of control structures
Communications of the ACM
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
Optimal code for control structures
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Knowledge and Data Engineering
A place for assembler in structured programming
SIGCSE '77 Proceedings of the seventh SIGCSE technical symposium on Computer science education
On structuring flowcharts (Preliminary Version)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The complexity of control structures and data structures
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A method to expose the hidden structure of Fortran programs
ACM '74 Proceedings of the 1974 annual conference - Volume 1
A course in effective programming
SIGCSE '75 Proceedings of the fifth SIGCSE technical symposium on Computer science education
An algorithm for structuring programs (Extended Abstract)
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
A note on an expressiveness hierarchy for multi-exit iteration
Information Processing Letters
Journal of Systems and Software
ACM SIGPLAN Notices
Structured programming, programming teaching and the language Pascal
ACM SIGPLAN Notices
What is a flowchart loop and about structured programming
ACM SIGPLAN Notices
Can structured programs be efficient?
ACM SIGPLAN Notices
Using Hammock Graphs to Structure Programs
IEEE Transactions on Software Engineering
On extending Fortran control structures to facilitate structured programming
ACM SIGPLAN Notices
On readability of programs with loops
ACM SIGPLAN Notices
A case for teaching multi-exit loops to beginning programmers
ACM SIGPLAN Notices
The roots of structured programming
SIGCSE '78 Papers of the SIGCSE/CSA technical symposium on Computer science education
ACM SIGACT News
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Declarative techniques for model-driven business process integration
IBM Systems Journal
Ablego: a function outlining and partial inlining framework: Research Articles
Software—Practice & Experience
Structured programming with go to statements
Classics in software engineering
Krakatoa: decompilation in java (dose bytecode reveal source?)
COOTS'97 Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3
From UML Activities to TAAL - Towards Behaviour-Preserving Model Transformations
ECMDA-FA '08 Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications
The Böhm---Jacopini Theorem Is False, Propositionally
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Goto elimination in program algebra
Science of Computer Programming
PDL: a tool for software design
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
Measuring program complexity in a COBOL environment
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Queryll: Java database queries through bytecode rewriting
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Towards model structuring based on flow diagram decomposition
Proceedings of the 1st Workshop on Behaviour Modelling in Model-Driven Architecture
Automatic structuring of programs
IBM Journal of Research and Development
Analysis of structured programs
Journal of Computer and System Sciences
Queryll: Java database queries through bytecode rewriting
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
Staple, an experimental structured programming language
Computer Languages
SEC'13 Proceedings of the 22nd USENIX conference on Security
| Hi-index | 48.30 |
A well-formed program is defined as a program in which loops and if statements are properly nested and can be entered only at their beginning. A corresponding definition is given for a well-formed flowchart. It is shown that a program is well formed if and only if it can be written with if, repeat, and multi-level exit statements for sequence control. It is also shown that if, while, and repeat statements with single-level exit do not suffice. It is also shown that any flowchart can be converted to a well-formed flowchart by node splitting. Practical implications are discussed.