|
285
|
A unified approach to global program optimization
– Gary A. Kildall
- 1973
|
|
749
|
Efficiently computing static single assignment form and the control dependence graph
– Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck
- 1991
|
|
72
|
A fast and usually linear algorithm for global flow analysis
– Susan L Graham, Mark Wegman
- 1976
|
|
359
|
Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers
– Maryam Emami, Rakesh Ghiya, Laurie J. Hendren
- 1994
|
|
274
|
Flow Analysis of Computer Programs
– Matthew S Hecht
- 1977
|
|
172
|
Global optimization by suppression of partial redundancies
– E Morel, C Renvoise
- 1979
|
|
165
|
Global value numbers and redundant computations
– B K Rosen, M N Wegman, F K Zadeck
- 1988
|
|
295
|
Constant propagation with conditional branches
– Mark N. Wegman, F. Kenneth Zadeck
- 1991
|
|
112
|
Interprocedural side-effect analysis in linear time
– K D Cooper, K Kennedy
|
|
126
|
An efficient way to find the side effects of procedure calls and the aliases of variables
– J P Banning
|
|
152
|
Detecting conflicts between structure accesses
– J R Larus, P N Hilfinger
- 1988
|
|
41
|
Constructing the Procedure Call Multigraph
– C Callahan, A Carle, M Hall, K Kennedy
- 1990
|
|
54
|
Constructing the call graph of a program
– B G Ryder
- 1979
|
|
360
|
Analysis of pointers and structures
– D R Chase, M Wegman, F K Zadeck
- 1990
|
|
56
|
A survey of data flow analysis techniques
– Ken Kennedy
- 1981
|
|
77
|
An Interval-Based Approach to Exhaustive and Incremental Interprocedural Data Flow Analysis
– Michael Burke
- 1987
|
|
112
|
A precise inter-procedural data flow algorithm
– Eugene M Myers
- 1981
|
|
84
|
Effective Partial Redundancy Elimination
– Preston Briggs, Keith D. Cooper
- 1994
|
|
38
|
A solution to a problem with morel and renvoise's "global optimization by suppression of partial redudancies
– K H Drechsler, M P Stadel
- 1988
|
