© 1987 by British Computer Society
The Identification of Program Unstructuredness: A Formal Approach*
Centre of Computer Studies and Applications, University of Hong Kong, Pokfulam Road, Hong Kong
Received 1 April 1986; revised 1 July 1986
Quite a number of papers have discussed the problems of identifying unstructured programs and turning them into structured programs. Most of the papers, however, are based on intuitive arguments rather than on formal proofs. The identification of program unstructuredness has remained a difficult task. In this paper we formally study the properties of skeletons, modules, branches, iteration exits and entry nodes in program flowgraphs. We prove that two simple conditions are sufficient and necessary for the identification of unstructuredness.
* Part of this research was done at the London School of Economics, University of London under a Commonwealth Academic Staff Scholarship.