Conversion of Unstructured Flow Diagrams to Structured Form
From MaRDI portal
Cited in
(7)- On the detection of unstructuredness in flowgraphs
- Automatically replacing indices into parallel arrays with pointers to records
- Program structures: Some new characterisations
- Condition/decision duality and the internal logic of extensive restriction categories
- A generalized mathematical theory of structured programming
- Dijkstra graphs
- The Böhm–Jacopini Theorem Is False, Propositionally
This page was built for publication: Conversion of Unstructured Flow Diagrams to Structured Form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4151717)