Unravelling Unstructured Programs

DOI10.1093/comjnl/25.3.379zbMath0483.68010OpenAlexW2011847110MaRDI QIDQ3942367

G. Oulsnam

Publication date: 1982

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/25.3.379

zbMATH Keywords

complexity measuredecision nodesavoidance of function duplicationdecision node duplicationstructured schemas

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

On the detection of unstructuredness in flowgraphs ⋮ Dijkstra graphs ⋮ The Böhm–Jacopini Theorem Is False, Propositionally ⋮ Program structures: Some new characterisations ⋮ A generalized mathematical theory of structured programming