A generalized mathematical theory of structured programming (Q2265794): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Norman Fenton / rank
Normal rank
 
Property / author
 
Property / author: Norman Fenton / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90040-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050893918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic and graph theoretic characterizations of structured flowchart schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow diagrams, turing machines and languages with only two formation rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis and Structural Analysis of Abstract Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Programming With and Without go to Statements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantically meaningful characterization of reducible flowchart schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Graph Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to a Unified Theory of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of structured programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unravelling Unstructured Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the Church-Rosser Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing flow graph reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conversion of Unstructured Flow Diagrams to Structured Form / rank
 
Normal rank

Latest revision as of 17:11, 14 June 2024

scientific article
Language Label Description Also known as
English
A generalized mathematical theory of structured programming
scientific article

    Statements

    A generalized mathematical theory of structured programming (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    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.
    0 references
    0 references
    structured programming
    0 references
    top-down programming
    0 references
    program control structures
    0 references
    flowgraphs
    0 references
    0 references