The Computer Journal 30 (4): 378-380 (1987) |
T.H. Tse 2
[free download from Oxford Journals | postprint with better formatting than the journal version]
ABSTRACT |
We introduce the concepts of fully embedded skeletons and partially overlapping skeletons in program flowgraphs. We show that only one simple criterion is necessary and sufficient for the identification of program unstructuredness. Namely, a program flowgraph is unstructured if and only if it contains partially overlapping skeletons. |
|
EVERY VISITOR COUNTS: |