A generalized mathematical theory of structured programming
From MaRDI portal
Publication:2265794
DOI10.1016/0304-3975(85)90040-4zbMath0559.68004OpenAlexW2050893918MaRDI QIDQ2265794
A. A. Kaposi, R. W. Whitty, 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
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of structured programs
- Testing flow graph reducibility
- A semantically meaningful characterization of reducible flowchart schemes
- Algebraic and graph theoretic characterizations of structured flowchart schemes
- Synthesis and Structural Analysis of Abstract Programs
- Unravelling Unstructured Programs
- Testing for the Church-Rosser Property
- Structured Programming With and Without go to Statements
- A Complexity Measure
- Conversion of Unstructured Flow Diagrams to Structured Form
- Flow diagrams, turing machines and languages with only two formation rules
- An Approach to a Unified Theory of Automata
- The theory of languages
- Flow Graph Reducibility
This page was built for publication: A generalized mathematical theory of structured programming