On the detection of unstructuredness in flowgraphs
From MaRDI portal
Publication:1098619
DOI10.1016/0020-0190(87)90131-1zbMath0637.68023OpenAlexW2008088013MaRDI QIDQ1098619
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90131-1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of structured programs
- Theory of program structures: Schemes, semantics, verification
- Flowchart Schemata and the Problem of Nomenclature
- Short Notes: Towards a Single Criterion for Identifying Program Unstructuredness
- Synthesis and Structural Analysis of Abstract Programs
- Grammar Characterization of Flowgraphs
- Unravelling Unstructured Programs
- Automatic Structuring of Programs
- Generating structured flow diagrams: the nature of unstructuredness
- A Complexity Measure
- Conversion of Unstructured Flow Diagrams to Structured Form
- Restructuring Pascal Programs Containing Goto Statements
- Flow diagrams, turing machines and languages with only two formation rules
- Syntax-directed documentation for PL360
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: On the detection of unstructuredness in flowgraphs
