Skip Navigation

The Computer Journal 1987 30(4):378-380; doi:10.1093/comjnl/30.4.378
© 1987 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tse, T. H.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Notes

Towards a Single Criterion for Identifying Program Unstructuredness*

T. H. Tse

Centre of Computer Studies and Applications, University of Hong Kong, Pokfulam Road, Hong Kong

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.


Received September 1986. revised December 1986.

* Part of this research was done at the London School of Economics, University of London under a Commonwealth Academic Staff Scholarship. It was also supported in part by a University of Hong Kong Research Grant.

§ Centre of Computer Studies and Applications, University of Hong Kong, Pokfulam Road, Hong Kong


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.