|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
657
|
Advanced Compiler Design and Implementation
– Muchnick
- 1997
|
|
549
|
High-Performance Compilers for Parallel Computing
– Wolfe
|
|
415
|
Points-to analysis in almost linear time
– Steensgaard
- 1996
|
|
339
|
Effective context-sensitive pointer analysis for C programs
– Wilson, Lam
- 1995
|
|
329
|
Context-sensitive interprocedural points-to analysis in the presence of function pointers
– Enami, Ghiya, et al.
- 1994
|
|
318
|
Analysis of pointers and structures
– Chase, Wegman, et al.
- 1990
|
|
301
|
A safe approximate algorithm for interprocedural pointer aliasing
– Landi, Ryder
- 1992
|
|
284
|
Constant propagation with conditional branches
– Wegman, Zadeck
- 1991
|
|
249
|
Solving shape-analysis problems in languages with destructive updating
– Sagiv, Reps, et al.
- 1998
|
|
216
|
Two approaches to interprocedural data flow analysis
– Sharir, Pnueli
- 1981
|
|
179
|
Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects
– Choi, Burke, et al.
- 1993
|
|
155
|
Detecting conflicts between structure accesses
– Larus, Hilfinger
- 1988
|
|
152
|
Is it a Tree, a DAG, or a Cyclic Graph? A shape analysis for heap-directed pointers in C
– Ghiya, Hendren
- 1996
|
|
135
|
Detecting parallelism in C programs with recursive data structures
– Ghiya, Hendren, et al.
- 1998
|
|
133
|
The program dependence web: a representation supporting control, data-, and demand-driven interpretation of imperative languages
– Ottenstein, Ballance, et al.
- 1990
|
|
129
|
Dependence analysis for pointer variables
– HORWITZ, PFEIFFER, et al.
|
|
122
|
Context-insensitive alias analysis reconsidered
– Ruf
- 1995
|
|
114
|
Interprocedural modification side effect analysis with pointer aliasing
– Landi, Ryder, et al.
- 1993
|
|
111
|
Pointer-induced aliasing: A problem classification
– Landi, Ryder
- 1991
|
|
108
|
The Superthreaded Architecture: Thread Pipelining with Run-Time Data Dependence Checking and Control Speculation
– Tsai, Yew
- 1996
|
|
97
|
Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs
– Hendren, Hummel, et al.
- 1992
|
|
90
|
Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form
– Gerlek, Stoltz, et al.
- 1995
|
|
83
|
Beyond induction variables
– Wolfe
- 1992
|
|
65
|
Connection analysis: A practical interprocedural heap analysis for C
– Ghiya, Hendren
- 1995
|
|
65
|
Gated SSA-based demand-driven symbolic analysis for parallelizing compilers
– Tu, Padua
- 1995
|
|
62
|
Interprocedural def-use associations for C systems with single level pointers
– Pande, Landi, et al.
- 1994
|
|
61
|
A general data dependence test for dynamic, pointer-based data structures
– Hummel, Hendren, et al.
- 1994
|
|
59
|
Combining Analyses, Combining Optimizations
– Click
- 1995
|
|
59
|
Points-to analysis by type inference of pro-grams with structures and unions
– Steensgaard
- 1996
|
|
58
|
Pointer Analysis for Programs with Structures and Casting
– Yong, Horwitz, et al.
- 1999
|
|
57
|
Interprocedural Symbolic Analysis
– HAVLAK
- 1994
|
|
54
|
Efficient computation of interprocedural definition-use chains
– Harrold, Soffa
- 1994
|
|
53
|
Interprocedural Aliasing in the Presence of Pointers
– Landi
- 1992
|
|
44
|
An approach for exploring code improving transformations
– Whitfield, Soffa
- 1997
|
|
43
|
Array SSA form and its use in parallelization
– Knobe, Sarkar
- 1998
|
|
43
|
Program decomposition for pointer aliasing: A step towards practical analyses
– Zhang, Ryder, et al.
- 1996
|
|
39
|
A control-flow normalization algorithm and its complexity
– Ammarguellat
- 1992
|
|
39
|
Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors
– Larus
- 1989
|
|
26
|
Assesing the effects of flow-sensitivity on pointer alias analyses
– Hind, Pioli
- 1998
|
|
24
|
On the efficient engineering of ambitious program analysis
– Choi, Cytron, et al.
- 1993
|
|
23
|
Efficiently accommodating may-alias information in ssa form
– Cytron, Gershbein
- 1993
|
|
23
|
Abstract description of pointer data structures: An approach for improving the analysis and optimization of imperative programs
– Hummel, Hendren, et al.
- 1993
|
|
23
|
Partitioning dataflow analyses using types
– Ruf
- 1997
|
|
20
|
A language for conveying the aliasing properties of dynamic, pointer-based data structures
– Hummel, Hendren, et al.
- 1994
|
|
19
|
Interprocedural constant propagation using dependence graphs and a data-flow model
– Binkley
- 1994
|
|
19
|
A new algorithm for scalar register promotion based on ssa form
– Sastry, Ju
- 1998
|
|
19
|
Experiments with combined analysis for pointer aliasing
– Zhang, Ryder, et al.
- 1998
|
|
17
|
Sparse functional stores for imperative programs
– Steensgaard
- 1995
|
|
15
|
Using static single assignment form to improve flow-insensitive pointer analysis
– Hasti, Horwitz
- 1998
|
|
