File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: The identification of program unstructuredness: A formal approach

TitleThe identification of program unstructuredness: A formal approach
Authors
Tse, TH
Issue Date1987
PublisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/
Citation
Computer Journal, 1987, v. 30 n. 6, p. 507-511 How to Cite?
DOI: http://dx.doi.org/10.1093/comjnl/30.6.507
AbstractQuite 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. © 1987 The British Computer Society.
Persistent Identifierhttp://hdl.handle.net/10722/152225
ISSN
0010-4620
2023 Impact Factor: 1.5
2023 SCImago Journal Rankings: 0.520
ISI Accession Number ID
WOS:A1987L316600005

 

DC FieldValueLanguage
dc.contributor.authorTse, THen_HK
dc.date.accessioned2012-06-26T06:36:37Z-
dc.date.available2012-06-26T06:36:37Z-
dc.date.issued1987en_HK
dc.identifier.citationComputer Journal, 1987, v. 30 n. 6, p. 507-511en_HK
dc.identifier.issn0010-4620en_HK
dc.identifier.urihttp://hdl.handle.net/10722/152225-
dc.description.abstractQuite 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. © 1987 The British Computer Society.en_HK
dc.languageengen_US
dc.publisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/en_HK
dc.relation.ispartofComputer Journalen_HK
dc.titleThe identification of program unstructuredness: A formal approachen_HK
dc.typeArticleen_HK
dc.identifier.emailTse, TH: thtse@cs.hku.hken_HK
dc.identifier.authorityTse, TH=rp00546en_HK
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1093/comjnl/30.6.507en_HK
dc.identifier.scopuseid_2-s2.0-0023594637en_HK
dc.identifier.volume30en_HK
dc.identifier.issue6en_HK
dc.identifier.spage507en_HK
dc.identifier.epage511en_HK
dc.identifier.isiWOS:A1987L316600005-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridTse, TH=7005496974en_HK
dc.identifier.issnl0010-4620-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats