Richard Johnson, David Pearson, Keshav Pingali  Home/Search
Context Related
| cornell.edu/pub/pidgin/Typ...regions.ps cornell.edu/pub/pidgin/Typ...cdequiv.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cornell.edu (more) From: cornell.edu (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Context of citations to this paper: More
.... CFG node a, let bottom(a) be the postdominator of the smallest SESE region containing a; bottom(a) can be found for all nodes in O(E) time [JPP93] A join is symptomatic of looping or unstructured control iff it is not a SESE bottom. End analysis associates with each branch...
...regions as graph blocks. The term hammocks is sometimes used for this, but the use of this terminology is inconsistent, as pointed out in [21]. Often analysis in compilers is in terms of basic blocks, these are also graph blocks but tend to be speci ed as not containing cycles...
Cited by: More
Maintaining Dynamic Graph Properties - Deterministically Moreno Marzolla (Correct)
The Static Single Information Form - Ananian (1999) (Correct)
Imperative Program Transformation By Rewriting - Lacey, de Moor (2001) (Correct)
Similar documents (at the sentence level):
10.9%: The Program Structure Tree: Computing Control Regions in.. - Johnson, Pearson, Pingali (1994) (Correct)
Active bibliography (related documents): More All
0.3: Dependence-Based Program Analysis - Johnson, Pingali (1993) (Correct)
0.2: Range Searching Over Tree Cross Products - Buchsbaum, Goodrich, Westbrook (2000) (Correct)
0.2: Minimizing Diameters of Dynamic Trees - Alstrup, Holm, de Lichtenberg.. (1998) (Correct)
Similar documents based on text: More All
0.2: and the Roman Chariots Problem - Keshav Pingali Cornell (1997) (Correct)
0.2: Optimal Control Dependence Computation and the Roman Chariots .. - Pingali, Bilardi (1997) (Correct)
0.2: AFramework for Generalized Control Dependence - Gianfranco Bilardi Keshav (1996) (Correct)
Related documents from co-citation: More All
6: Dependence-based program analysis - Johnson, Pingali - 1993
4: Region scheduling (context) - Gupta, Soffa - 1987
3: Detecting equality of variables in programs (context) - Alpern, Wegman et al. - 1988
BibTeX entry: (Update)
R. Johnson, D. Pearson, and K. Pingali, "Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time." To appear in Proc. Sigplan'94 PLDI. http://citeseer.ist.psu.edu/johnson93finding.html More
@techreport{ johnson93finding,
author = "Richard C. Johnson and David Pearson and Keshav Pingali",
title = "Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time",
number = "TR93-1365",
pages = "18",
year = "1993",
url = "citeseer.ist.psu.edu/johnson93finding.html" }
Citations (may not include all citations):61 Dependence-based program analysis - Johnson, Pingali - 1993
25 The program dependency graph and its uses in optimization (context) - Ferrante, Ottenstein et al. - 1987
21 Compact representations for control dependence (context) - Cytron, Ferrante et al. - 1990
14 Region scheduling (context) - Gupta, Soffa - 1987
5 Fully Dynamic Graph Algorithms and their Data Structures (context) - Rauch - 1992
4 Distinguishing hammocks in a directed graph (context) - Kas'janov - 1975
2 or- computing control dependence regions in linear time and .. - Ball, region - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cs.cornell.edu.html): More
Comparing Images Using the Hausdorff Distance - Huttenlocher, Klanderman.. (1993) (Correct)
Program Mobile Robots in Scheme - Rees, Donald (1992) (Correct)
Documents Are Not Just for Printing - Raman Center (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC