B.G. Ryder and M. C. Paull, Elimination algorithms for data flow analysis, ACM Computing Surveys 18 (1986), no. 3, 277-315. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Symbolic Data Flow Analysis for Detecting - Deadlocks In Ada (Correct)
Symbolic Reaching Definitions Analysis of Ada Programs - Blieberger, Burgstaller (1998) (1 citation) (Correct)
On Edge Addition Rewrite Systems and their Relevance to Program.. - Aßmann (1994) (3 citations) (Correct)
Automatic Generation Of Data-Flow Analyzers: A Tool For Building.. - Tjiang (1993) (5 citations) (Correct)
Bidirectional Data Flow Analysis : Myths and Reality - Khedker, Dhamdhere (Correct)
Yet Another Ensemble of Abstract Interpreter, Higher-Order.. - Yi (2001) (Correct)
A Novel Probabilistic Data Flow Framework - Mehofer, Scholz (1 citation) (Correct)
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) (Correct)
Analysis of Loops - Florian Martin Martin (1998) (2 citations) (Correct)
Compiler Support for Machine-Independent Parallelization of.. - von Hanxleden (1994) (7 citations) (Correct)
The Program Structure Tree: Computing Control Regions in.. - Johnson, Pearson, Pingali (1994) (33 citations) (Correct)
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) (Correct)
Symbolic Data Flow Analysis for Detecting Deadlocks.. - Blieberger.. (2000) (5 citations) (Correct)
Refactoring Object-Oriented Frameworks - Opdyke (1992) (124 citations) (Correct)
Path-Sensitive Value-Flow Optimizations - Bodík (1998) (Correct)
Space-Efficient Closure Representations - Shao, Appel (1994) (40 citations) (Correct)
Making Graphs Reducible with Controlled Node Splitting - Janssen, Corporaal (1997) (4 citations) (Correct)
Efficient Computation of Fixpoints that Arise in.. - Chen.. (1 citation) (Correct)
Syntax-Directed Construction of Program Dependence Graphs - Harrold, Rothermel (1996) (Correct)
Controlled Node Splitting - Janssen, Corporaal (1996) (4 citations) (Correct)
Un Cadre Générique De Définition.. - Gouranton (1997) (Correct)
Tree-Based Code Optimization - Mcconnell (1993) (3 citations) (Correct)
On Edge Addition Rewrite Systems And their Relevance to Program.. - Aßmann (1995) (3 citations) (Correct)
Automatic Parallelization Of Prolog Programs - Sehr (1992) (8 citations) (Correct)
A new framework for exhaustive and incremental data flow.. - Sreedhar, Gao, Lee (1995) (11 citations) (Correct)
Compiling Standard ML For Efficient Execution On Modern Machines - Shao (1994) (14 citations) (Correct)
A Control-Flow Normalization Algorithm and Its Complexity - Ammarguellat (1992) (31 citations) (Correct)
Automatic Generation and Management of Program Analyses - Yi (1993) (1 citation) (Correct)
Efficient Computation of Fixpoints that Arise in Complex.. - Chen, Harrison III (1 citation) (Correct)
Detecting Redundant Accesses to Array Data (Extended Version) - Granston, Veidenbaum (1992) (Correct)
Program Dependence Graphs for the Rest of Us - Ballance, al. (1993) (8 citations) (Correct)
Combining Flow and Dependence Analyses to Expose Redundant .. - Granston, Veidenbaum (1995) (1 citation) (Correct)
Complete Removal of Redundant Expressions - Bodik, Gupta, Soffa (1998) (11 citations) (Correct)
Z1: A Data Flow Analyzer Generator - Yi, Harrison (Correct)
Efficient data flow analysis using DJ-graphs: Elimination.. - Sreedhar, Gao, Lee (1995) (Correct)
Array Data-flow Analysis for Imperative Recursive Programs - Cohen, Collard, Griebl (1996) (3 citations) (Correct)
Program Dependence Graphs for the Rest of Us - Ballance, Maccabe (1992) (8 citations) (Correct)
Give-N-Take - A Balanced Code Placement Framework - von Hanxleden, Kennedy (1994) (3 citations) (Correct)
Data Flow Frequency Analysis - Ramalingam (1996) (23 citations) (Correct)
A Framework-Based Environment for Object-Oriented.. - Ballance, Giancola.. (1993) (3 citations) (Correct)
An Elimination-Based Approach to Incremental Data Flow Analysis - Sreedhar, Gao (1995) (Correct)
A Position Paper on Compile-time Program Analysis - Ryder (1996) (1 citation) Self-citation (Ryder) (Correct)
A Comprehensive Approach to Parallel Data Flow Analysis - Lee, Ryder (1992) (1 citation) Self-citation (Ryder) (Correct)
Incremental Analysis of MOD Problem for C - Yur, Ryder (1995) Self-citation (Ryder) (Correct)
Defining Flow Sensitivity in Data Flow Problems - Marlowe, Ryder, Burke (1995) (5 citations) Self-citation (Ryder) (Correct)
Lattice Frameworks for Multisource and Bidirectional Data Flow.. - Masticola (1995) (16 citations) Self-citation (Ryder) (Correct)
Lower And Upper Bounds For Incremental Algorithms - Berman (1992) (2 citations) Self-citation (Paull) (Correct)
Incremental Analysis of MOD Problem for C - Yur, Ryder (1995) Self-citation (Ryder) (Correct)
Region Analysis: A Parallel Elimination Method for Data Flow.. - Yong-Fong Lee (1995) (2 citations) Self-citation (Ryder) (Correct)
Differences in Algorithmic Parallelism in Control Flow and.. - Vincent Sgro (1994) Self-citation (Ryder) (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