Unravelling Unstructured Programs

DOI10.1093/COMJNL/25.3.379MaRDI QIDQ3942367zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(5)

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

This page was built for publication: Unravelling Unstructured Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3942367)