On structuring flowcharts (Preliminary Version)

Authors:
S. Rao Kosaraju
Affiliations:
-
Venue:
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Year:
1976

Citing 3
Cited 1

The Expression of Algorithms by Charts

Journal of the ACM (JACM)
On the capabilities of while, repeat, and exit statements

Communications of the ACM
Graphs and Hypergraphs

Graphs and Hypergraphs

Structured flowcharts for multiprocessing

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cooper's syntactic transformations for structuring flowcharts are studied. After exhibiting major problems with these transformations, a modified set of transformations are proposed. It is proved that a flowchart G is transformable into a D-chart if and only if for every 3 connected circuits C1, C2 and C3 in G, there exists a vertex v on C1+C2+C3 such that for every i, Ci passes through v or every path from Ci to the OUT of the flowchart passes through v.