Richard Johnson, David Pearson, Keshav Pingali  Home/Search
Context Related
| cornell.edu/pub/pidgin/Typ...94pldi.ps cornell.edu/Info/Projects/B...pldi94.ps cornell.edu/Publications...PLDI1994.pdf 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) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flow graph. We give a linear-time algorithm for finding SESE regions and for building the PST of arbitrary control flow graphs (including irreducible ones). Next, we establish a connection between SESE regions and control dependence equivalence classes, and show how to use the algorithm to find control regions in linear... (Update)
Cited by: More
Restructuring Programs By Tucking Statements Into Functions - Arun Lakhotia And (1998) (Correct)
Hardware Compilation of Application-Specific.. - Venkataramani.. (2006) (Correct)
HLS Support for Unconstrained Memory Accesses - Girish Venkataramani Tiberiu (Correct)
Similar documents (at the sentence level):
8.2%: Finding Regions Fast: Single Entry Single Exit and.. - Johnson, Pearson.. (1993) (Correct)
Active bibliography (related documents): More All
0.6: Quasi-Fully Dynamic Algorithms for Two-Connectivity.. - Korupolu, Ramachandran (1997) (Correct)
0.4: Dependence-Based Program Analysis - Johnson, Pingali (1993) (Correct)
0.3: Optimal Control Dependence Computation and the Roman Chariots .. - Pingali, Bilardi (1997) (Correct)
Similar documents based on text: More All
0.2: Efficient Computation of Interprocedural Control Dependence - Ezick, Bilardi, Pingali (Correct)
0.2: Checkpointing Shared Memory Programs at the.. - Bronevetsky, Marques, .. (2004) (Correct)
0.2: Application-level Checkpointing for Shared Memory.. - Bronevetsky, Marques.. (2004) (Correct)
Related documents from co-citation: More All
13: Dependence-based program analysis - Johnson, Pingali - 1993
13: Efficiently Computing Static Single Assignment Form and the Control Dependence G.. - Cytron, Ferrante et al. - 1991
11: Constant propagation with conditional branches (context) - Wegman, Zadeck - 1985
BibTeX entry: (Update)
R. Johnson, D. Pearson, and K. Pingali. The program structure tree: Computing control regions in linear time. In Proc. the SIGPLAN '94 Conference on Program Language Design and Implementation, June 1994. http://citeseer.ist.psu.edu/johnson94program.html More
@inproceedings{ johnson94program,
author = "Richard Johnson and David Pearson and Keshav Pingali",
title = "The Program Structure Tree: Computing Control Regions in Linear Time",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "171-185",
year = "1994",
url = "citeseer.ist.psu.edu/johnson94program.html" }
Citations (may not include all citations):415 Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1991
92 A fast algorithm for finding dominators in a flowgraph (context) - Lengauer, Tarjan - 1979
61 Dependencebased program analysis - Johnson, Pingali - 1993
55 A program data flow analysis procedure (context) - Allen, Cocke - 1976
55 A survey of data flow analysis techniques (context) - Kennedy - 1981
53 Automatic construction of sparse data flow evaluation graphs (context) - Choi, Cytron et al. - 1991
50 How to analyze large programs efficiently and informatively (context) - Dhamdhere, Rosen et al. - 1992
50 Elimination algorithms for data flow analysis (context) - Ryder, Paull - 1986
39 A fast and usually linear algorithm for global flow analysis (context) - Graham, Wegman - 1976
32 An efficient hybrid algorithm for incremental data flow anal.. (context) - andBarbara, Ryder - 1990
25 From control flow to dataflow - Beck, Johnson et al. - 1991
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
17 An efficient general iterative algorithm for data-flow analy.. (context) - Horwitz, Demers et al. - 1987
15 Efficiently computing OE-nodes on-the-fly (context) - Cytron, Ferrante - 1993
14 Region scheduling (context) - Gupta, Soffa - 1987
10 Finding regions fast: Single entry single exit and control r.. - Johnson, Pearson et al. - 1993
8 Computing OE-nodes in linear time using DJ-graphs (context) - Sreedhar, Gao - 1994
7 Parallelizing data flow analysis (context) - Gupta, Pollock et al. - 1990
5 Incremental data flow analysis in a structured program edito.. (context) - Zadeck - 1984
4 Distinguishing hammocks in a directed graph (context) - Kas'janov - 1975
2 Prime subprogram parsing of a program (context) - Tarjan, Valdes - 1980
2 or- computing control dependenceregions in linear time and s.. - Ball, region - 1992
1 Report STAN-CS (context) - Valdes, SeriesParallel et al. - 1978
1 Reordering-transformations that preserve control dependence (context) - Podgurski - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.cornell.edu.html): More
A Framework for Protocol Composition in Horus - van Renesse, Birman.. (1995) (Correct)
On the Area Bisectors of a Polygon - Böhringer, Donald, Halperin (1997) (Correct)
SimLab: Automatically Creating Physical Systems Simulators - Palmer, Cremer (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