A Control-Flow Normalization Algorithm and Its Complexity (1992)
Cached
Download Links
- [polaris.cs.uiuc.edu]
- [www.csrd.uiuc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Transactions on Software Engineering |
| Citations: | 38 - 0 self |
BibTeX
@ARTICLE{Ammarguellat92acontrol-flow,
author = {Zahira Ammarguellat},
title = {A Control-Flow Normalization Algorithm and Its Complexity},
journal = {IEEE Transactions on Software Engineering},
year = {1992},
volume = {18},
pages = {237--251}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a simple method for normalizing the control-flow of programs to facilitate program transformations, program analysis, and automatic parallelization. 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 goto's 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. In this paper we present transformations that effect this normalization, and study the complexity of the method. Index Terms: Continuations, control-flow, elimination algorithms, normalization,...
