A generalized mathematical theory of structured programming

DOI10.1016/0304-3975(85)90040-4MaRDI QIDQ2265794zbMATH OpenOpenAlexFDO

Authors R. W. Whitty, A. A. Kaposi, Norman Fenton

Publication date 1985

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(85)90040-4

zbMATH Keywords

flowgraphsprogram control structuresstructured programmingtop-down programming

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Review text

Graph theory is used to model program control structures rigorously as flowgraphs. Formal methods are defined which allow the classification and reconstruction of flowgraphs in terms of an arbitrary set of primitives. The criterion of classification sheds new light on a classical graph- theoretic characterization of D-structuredness, and provides an extension of this characterization in the case when the notion of structuredness is generalized.

Recommendations

• Program structures: Some new characterisations
• scientific article; zbMATH DE number 3913694
• scientific article; zbMATH DE number 3963179
• scientific article; zbMATH DE number 1923047
• Dijkstra graphs

Cites work

• A Complexity Measure
• A semantically meaningful characterization of reducible flowchart schemes
• Algebraic and graph theoretic characterizations of structured flowchart schemes
• An Approach to a Unified Theory of Automata
• Analysis of structured programs
• Conversion of Unstructured Flow Diagrams to Structured Form
• Flow diagrams, turing machines and languages with only two formation rules
• Flow Graph Reducibility
• scientific article; zbMATH DE number 3908451 (Why is no real title available?)
• scientific article; zbMATH DE number 33213 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• Structured Programming With and Without go to Statements
• Synthesis and Structural Analysis of Abstract Programs
• Testing flow graph reducibility
• Testing for the Church-Rosser Property
• The theory of languages
• Unravelling Unstructured Programs

Cited in

(24)

• Program structures: Some new characterisations
• A heuristic for finding embedded network structure in mathematical programmes
• The multiresolution analysis of flow graphs
• Dijkstra graphs
• On relations between wp-graphs and data structures
• Quasi-structured programs
• Control flow graphs and code coverage
• A uniform approach to control flow graphs of programs
• scientific article; zbMATH DE number 3913694 (Why is no real title available?)
• Properties of a special type of subgraph in an oriented graph
• scientific article; zbMATH DE number 4007715 (Why is no real title available?)
• Short Notes: Towards a Single Criterion for Identifying Program Unstructuredness
• scientific article; zbMATH DE number 1193639 (Why is no real title available?)
• scientific article; zbMATH DE number 48697 (Why is no real title available?)
• scientific article; zbMATH DE number 168428 (Why is no real title available?)
• Programming and automating mathematics in the Tarski-Kleene hierarchy
• scientific article; zbMATH DE number 1008446 (Why is no real title available?)
• scientific article; zbMATH DE number 1535458 (Why is no real title available?)
• Using attributed flow graph parsing to recognize clichés in programs
• scientific article; zbMATH DE number 6315451 (Why is no real title available?)
• A method of organizing a computing process in operational systems
• Program correctness and matricial iteration theories
• The gamma model and its discipline of programming
• Generalized structured programs and loop trees

This page was built for publication: A generalized mathematical theory of structured programming

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