Complete removal of redundant expressions

ACM SIGPLAN Notices

Volumn 39, Issue 4, 2004, Pages 596-597

  Bodík, Rastislav ^a,b   Gupta, Rajiv ^c   Soffa, Mary Lou ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c University of Arizona   (United States)

^d University of Pittsburgh   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENERALIZATION; LOOP-INVARIANT CODE MOTION; PARTIAL REDUNDANCY ELIMINATION (PRE);

ALGORITHMS; CODES (SYMBOLS); DATA FLOW ANALYSIS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; REDUNDANCY;

COMPUTER SCIENCE;

EID: 3142711709     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/989393.989453     Document Type: Conference Paper

References (6)

1. R. Bodik. Path-Sensitive Value-Flow Optimizations. PhD thesis, University of Pittsburgh, November 1999.
2. R. Bodik and R. Gupta. Partial dead code elimination using slicing transformations. In ACM SIGPLAN PLDI'97, pages 159-170, June 1997.
3. R. Bodik, R. Gupta, and V. Sarkar. ABCD: eliminating array bounds checks on demand. In ACM SIGPLAN PLDI'00, pages 321-333, June 2000.
4. R. Bodik, R. Gupta, and M.L. Soffa. Load-reuse analysis: Design and evaluation. In ACM SIGPLAN PLDI'99, pages 64-76, May 1999.
5. R.Nigel Horspool and H.C. Ho. Partial redundancy elimination based on a cost-benefit analysis. In Proceedings of 8th Israeli Conference on Computer Systems and Software Engineering, 1997.
6. D. Melski. Interprocedural Path Profiling and the Interprocedural Express-lane Transformation. PhD thesis, University of Wisconsin-Madison, 2002.