See this document in CiteSeerX!

Speculative Alias Analysis for Executable Code (2002)  (Make Corrections)  
Manel Fernández, Roger Espasa



  Home/Search   Context   Related

 
View or download:
ac.upc.es/pub/repo...CDAC200227.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  people.ac.upc.es/mfernand/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Optimizations performed at link time or directly applied to nal program executables have received increased attention in recent years. Such low-level optimizations can bene t greatly from pointer alias information. However, as almost all existing alias analyses are formulated in terms of source language constructs, they turn out to be of limited utility at the machine code level, thus making the problem of memory disambiguation one of the weak points of object code modi cation. (Update)

Active bibliography (related documents):   More   All
1.0:   Speculative Alias Analysis for Executable Code - Manel Fernandez And (2002)   (Correct)
0.7:   Profile Guided Compiler Optimizations - Gupta, Mehofer, Zhang (2002)   (Correct)
0.6:   Timestamped Whole Program Path Representation and its.. - Zhang, Gupta (2001)   (Correct)

Similar documents based on text:   More   All
0.5:   Dixie: A Retargetable Binary Instrumentation Tool - Fernández, Espasa (1999)   (Correct)
0.3:   Load Redundancy Elimination on Executable Code - Fern'andez, Espasa, Debray   (Correct)
0.3:   Microprocessor Simulators: - Fundamentals Techniques And   (Correct)

BibTeX entry:   (Update)

@misc{ ndez-speculative,
  author = "Manel Fernández and Roger Espasa",
  title = "Speculative Alias Analysis for Executable Code",
  url = "citeseer.ist.psu.edu/604340.html" }
Citations (may not include all citations):
1399   Compilers principles (context) - Aho, Sethi et al. - 1986
292   Advanced Compiler Design and Implementation (context) - Muchnick - 1997
107   Technical Report CS-TR (context) - Burger, Austin et al. - 1997
89   A practical system for intermodule code optimization at link.. - Srivastava, Wall - 1992
72   Dynamic memory disambiguation using the memory con ict bu er - Gallagher, Chen et al. - 1994
49   Type-based alias analysis - Diwan, McKinley et al. - 1998
39   Modular interprocedural pointer analysis using access paths:.. - Cheng, mei et al. - 2000
37   alto: A link-time optimizer for the Compaq Alpha - Muth, Debray et al. - 2001
33   Speculative disambiguation: A compilation technique for dyna.. (context) - Huang, Slavenburg et al. - 1994
33   Alias analysis of executable code - Debray, Muth et al. - 1998
28   Ecient context-sensitive pointer analysis for C programs (context) - Wilson, Lam - 1995
23   A practical framework for demand-driven interprocedural data.. - Duesterwald, Gupta et al. - 1997
21   Pro le guided code positioning (context) - Pettis, Hansen - 1990
20   Spike optimizer AlphaNT executable - Lowney, An et al. - 1997
14   Hot cold optimization large WindowNT application - Lowney, optimization et al. - 1996
13   the importance of points-to analysis and other memory disamb.. (context) - Ghiya, Lavery et al. - 2001
12   Fast and accurate ow-insensitive points-to analysis (context) - Shapiro, Horwitz - 1997
9   Run-time detection and recovery from incorrectly reordered m.. (context) - Moudgill, Moreno - 2085
9   Data dependence analysis of assembly code - Amme, Braun et al. - 1998
6   The Intel IA-64 compiler code generator (context) - Bharadwaj, Chen et al. - 2000
6   Improving data- ow analysis with path pro les (context) - Ammons, Larus - 1998
6   Value pro ling (context) - Calder, Feller et al. - 1997
5   Pro le-guided automatic inline expansion for C programs (context) - Chang, Mahlke et al. - 1992
4   Dynamic kernel code optimization (context) - Tamches, Miller - 2001
4   Data- ow analysis of program fragments (context) - Rountev, Ryder et al. - 1999
3   Edge pro ling versus path pro ling: The showdown (context) - Ball, Mataga et al. - 1998
3   Interprocedural data ow analysis in an executable optimizer (context) - Goodwin - 1997
3   Path pro le guided partial redundancy elimination using spec.. (context) - Gupta, Berson et al. - 1998
2   Alto: A Platform for Object Code Modi cation (context) - Muth - 1999
2   The store-load address table and speculative register promot.. (context) - Posti, Greene et al. - 2000
2   Path-sensitive value- ow analysis (context) - Bod, Anik - 1998
1   Memory pro ling for directing data speculative optimizations.. (context) - Connors - 1997
1   Pro le guided load marking for memory renaming (context) - Reinman, Calder et al. - 1998

Documents on the same site (http://people.ac.upc.es/mfernand/):
Load Redundancy Elimination on Executable Code - Fernández, Espasa, Debray   (Correct)
Speculative Alias Analysis for Executable Code - Fernández, Espasa   (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