Semantic Characterization of Flow Diagrams and Their Decomposability

Structured Programming has raised much attention to the problem of program schemata (flow diagrams) decomposability. In fact, the possibi lity of writing a program, in a top-down fashion, i.e. by successive refiniments of its parts, and the possibility of considering a program as consisting of subprograms, depend also on the possibility of identi fying within a flow diagram some elementary control structures which constitute its components.

[1]  Corrado Böhm,et al.  Flow diagrams, turing machines and languages with only two formation rules , 1966, CACM.

[2]  J. M. Cadiou,et al.  Recursive definitions of partial functions and their computations , 1972, Proving Assertions About Programs.

[3]  Robert W. Floyd,et al.  Notes on Avoiding "go to" Statements , 1971, Information Processing Letters.

[4]  S. Rao Kosaraju,et al.  Analysis of structured programs , 1973, STOC.

[5]  Tadao Kasami,et al.  On the capabilities of while, repeat, and exit statements , 1973, Commun. ACM.

[6]  Dana S. Scott,et al.  The lattice of flow diagrams , 1971, Symposium on Semantics of Algorithmic Languages.

[7]  William A. Wulf,et al.  Programming without the Goto , 1971, IFIP Congress.