A generalised mathematical theory of structured programming

AbstractGraph 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 characterisation of D-structuredness, and provides an extension of this characterisation in the case when the notion of structuredness is generalised