| Abstract |
|
A single method for normalizing the control-flow of programs to facilitate program transformations, program analysis, and automatic parallelization is presented. While previous methods result in programs whose control flowgraphs are reducible, programs normalized by this technique satisfy a stronger condition than reducibility and are therefore simpler in their syntax and structure than with previous methods. In particular, all control-flow cycles are normalized into single-entry, single-exit while loops and all GOTOs are eliminated. Furthermore, the method avoids problems of code replication that are characteristic of node-splitting techniques. This restructuring obviates the control dependence graph, since afterwards control dependence relations are manifest in the syntax tree of the program. Transformations that effect this normalization are presented, and the complexity of the method is studied.
|
 References
|
|
 Additional Information
|
Index Terms- control-flow normalization algorithm; complexity; automatic parallelization; control flowgraphs; control-flow cycles; GOTOs; node-splitting techniques; control dependence relations; syntax tree; computational complexity; graph theory; parallel algorithms; structured programming
Citation:
Z. Ammarguellat,
"A Control-Flow Normalization Algorithm and its Complexity,"
IEEE Transactions on Software Engineering,
vol. 18,
no. 3,
pp. 237-251,
Mar.,
1992
|
RSS Feed