Path-Sensitive, Value-Flow Optimizations of Programs

Path-Sensitive, Value-Flow Optimizations of Programs (1999)

Cached

Download Links

by Rastislav Bodík

Citations:

BibTeX

@MISC{Bodík99path-sensitive,value-flow,
    author = {Rastislav Bodík},
    title = {Path-Sensitive, Value-Flow Optimizations of Programs},
    year = {1999}
}

Bookmark

OpenURL

Abstract

Citations

749	Efficiently computing static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991
255	Optimally Profiling and Tracing Programs - Ball, Larus - 1994
231	Efficient path profiling - Ball, Larus - 1996
210	Zadeck. Detecting equality of variables in programs - Alpern, Wegman, et al. - 1988
205	Continuous profiling: Where have all the cycles gone - Anderson, Berc, et al. - 1997
203	IMPACT: An architectural framework for multiple-instruction-issue processors - Chang, Mahlke, et al. - 1991
198	An efficient method of computing static single assignment form - Cytron, Ferrante, et al.
192	Improving Register Allocation for Subscripted Variables - CALLAHAN, CARR, et al. - 1990
189	Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling - Ammons, Ball, et al. - 1997
181	Memory dependence prediction using store sets - Chrysos, Emer - 1998
180	Compiler optimizations for improving data locality - Carr, McKinley, et al. - 1994
127	A Methodology for Procedure Cloning - Cooper, Hall, et al. - 1993
123	The Program Dependence Web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages - Ballance, Maccabe, et al. - 1990
112	Interprocedural side-effect analysis in linear time - Cooper, Kennedy
109	Profile-Guided Automatic Inline Expansion for C Programs - Chang, Mahlke, et al. - 1992
92	e ective dynamic compilation - Fast - 1996
91	Improving the ratio of memory operations to floating-point operations in loops - Carr, Kennedy - 1994
84	Effective partial redundancy elimination - Briggs, Cooper - 1994
81	Interprocedural constant propagation - Callahan, Cooper, et al. - 1986
80	Improving data-flow analysis with path profiles - Ammons, Larus - 2004
66	M.L.: Interprocedural conditional branch elimination - Bodik, Gupta, et al. - 1997
65	A new algorithm for partial redundancy elimination based on SSA form - Chow, Chan, et al. - 1997
64	Complete removal of redundant expressions - Bodík, Gupta, et al. - 1998
59	Global Common Subexpression Elimination - Cocke - 1970
54	Aggressive inlining - Ayers, Gottlieb, et al.
54	Scalar replacement in the presence of conditional control flow - Carr, Kennedy - 1994
49	Transparent dynamic optimization: The design and implementation of Dynamo. Hewlett Packard Laboratories - Bala, Duesterwald, et al. - 1999
39	Load-Reuse Analysis: Design and Evaluation - Bodik, Gupta, et al. - 1999
33	M.L.: ‘Refining data flow information using infeasible paths - BODIK, GUPTA, et al. - 1997
30	Partial dead code elimination using slicing transformations - Bodik, Gupta - 1997
26	Scalable Cross-Module Optimization - Andrew, Jong, et al. - 1998
21	Array Data-Flow Analysis for Load-Store Optimizations in Superscalar Architectures - Bod'ik, Gupta - 1995
21	Abstract intrepretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints - COUSOT, COUSOT - 1977
20	Global code motion/global value numbering - Click - 1995
10	Consel and François Noël. A general approach for run-time specialization and its application to C - Charles - 1996
6	Automatic inlining - Carini - 1995
4	Mooly Sagiv. Edge profiling versus path profiling: The showdown - Ball, Mataga - 1998
3	Aggressive inlining. SIGPLAN Notices - Ayers, Gottlieb, et al. - 1997
3	Register promotion by partial redundancy elimination of loads and stores - Chow, Kennedy, et al. - 1998