Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time

Authors:
Richard Johnson;David Pearson;Keshav Pingali
Affiliations:
-;-;-
Venue:
Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time
Year:
1993

Citing 0
Cited 4

What's in a region?: or computing control dependence regions in near-linear time for reducible control flow

ACM Letters on Programming Languages and Systems (LOPLAS)
Value dependence graphs: representation without taxation

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The program structure tree: computing control regions in linear time

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Comparison and retrieval of process models using related cluster pairs

Computers in Industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many compilation problems require computing the control dependence equivalence relation which divides nodes in a control flow graph into equivalence classes such that nodes are in the same class if and only if they have the same set of control dependences. In this paper, we show that this relation can be computed in O(E) time by reducing it to a naturally stated graph problem: in a strongly connected component, divide nodes into equivalence classes such that every cycle passes through all or none of the nodes in an equivalence class. Our algorithm does not require the computation of the control dependence relation or of the postdominator relation -in fact, it runs faster in practice than the best algorithm for either of these problems. We also show that our algorithm can be used to determine the single entry single exit regions of a control flow graph in O(E) time.