Unravelling unstructured programs

Oulsnam G. (1982) Unravelling unstructured programs. Computer Journal, 25 3: 379-387. doi:10.1093/comjnl/25.3.379


Author Oulsnam G.
Title Unravelling unstructured programs
Journal name Computer Journal   Check publisher's open access policy
ISSN 0010-4620
Publication date 1982
Sub-type Article (original research)
DOI 10.1093/comjnl/25.3.379
Volume 25
Issue 3
Start page 379
End page 387
Total pages 9
Subject 1312 Molecular Biology
2613 Statistics and Probability
2605 Computational Mathematics
3303 Development
2308 Management, Monitoring, Policy and Law
3317 Demography
1700 Computer Science
Abstract A method is presented for converting unstructured program schemas to strictly equivalent structured form. The predicates of the original schema are left intact with structuring being achieved by the duplication of the original decision nodes without the introduction of compound predicate expressions, or, where possible, by function duplication alone. It is shown that structured schemas must have at least as many decision nodes as the original unstructured schema, and must have more when the original schema contains branches out of alternation constructs. The structuring method allows the complete avoidance of function duplication, but only at the expense of decision node duplication. It is shown that structured schemas always require an increase in space-time requirements, and it is suggested that this increase can be used as a complexity measure for the original schema.
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Unknown

Document type: Journal Article
Sub-type: Article (original research)
Collection: Scopus Import
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 33 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 14 Jun 2016, 04:07:16 EST by System User