Towards a Single Criterion for Identifying Program Unstructuredness
暂无分享,去创建一个
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.
[1] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[2] T. H. Tse. The Identification of Program Unstructuredness: A Formal Approach , 1987, Comput. J..