See this document in CiteSeerX!

Compaction Algorithm for Precise Modular Context-Sensitive Points-to Analysis  (Make Corrections)  (1 citation)
Hong-Seok Kim, Erik M. Nystrom, Ronald D. Barnes, Wen-mei W. Hwu



  Home/Search   Context   Related

 
View or download:
uiuc.edu/IMPACT/ft...mpact0303.ipa.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  uiuc.edu/IMPACT/people/...nystrom (more)
(Enter author homepages)

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

Abstract: Points-to analysis is a critical component of optimization and software engineering tools. A higher degree of precision in this analysis can significantly benefit such tools if it can be provided with a reasonably bounded analysis cost. The focus of this work is to enable a fully context-sensitive modular points-to analysis under the flow-insensitive and inclusionbased intraprocedural setting. Such a modular approach reduces the interprocedural problem to a series of intraprocedural ones. The... (Update)

Cited by:   More
Scalable, Precise Context-Sensitive Top-Down Process for - Modular Points-To Analysis   (Correct)

Active bibliography (related documents):   More   All
0.3:   Checking Programmer-Specified Non-Aliasing - Foster, Aiken (2001)   (Correct)
0.2:   Polymorphic versus Monomorphic Flow-insensitive.. - Foster, Fähndrich, Aiken (2000)   (Correct)
0.2:   Polymorphic versus Monomorphic Flow-insensitive.. - Foster, Fähndrich, Aiken (2000)   (Correct)

Similar documents based on text:   More   All
0.4:   An Architectural Framework for Run-Time Optimization - Merten, Trick, Barnes.. (2001)   (Correct)
0.4:   A Hardware Mechanism for Dynamic Extraction and.. - Merten, Trick.. (2000)   (Correct)
0.3:   Code Reordering and Speculation Support for Dynamic.. - Nystrom, Barnes.. (2001)   (Correct)

BibTeX entry:   (Update)

Hong-Seok Kim, Erik. M. Nystrom, Ronald D. Barnes, and Wen-mei W. Hwu. Compaction algorithm for precise modular context-sensitive points-to analysis. Submitted to CC2004. Also available on the authors' website as a techical report. http://citeseer.ist.psu.edu/710603.html   More

@misc{ kim-compaction,
  author = "H. Kim and E. Nystrom and R. Barnes and W. Hwu",
  title = "Compaction algorithm for precise modular context-sensitive points-to analysis",
  text = "Hong-Seok Kim, Erik. M. Nystrom, Ronald D. Barnes, and Wen-mei W. Hwu.
    Compaction algorithm for precise modular context-sensitive points-to analysis.
    Submitted to CC2004. Also available on the authors' website as a techical
    report.",
  url = "citeseer.ist.psu.edu/710603.html" }
Citations (may not include all citations):
154   Escape Analysis for Java - Choi, Gupta et al. - 1999
119   Compositional Pointer and Escape Analysis for Java Programs - Whaley, Rinard - 1999
119   Detecting equality of variables in programs (context) - Alpern, Wegman et al. - 1988
114   Fast and accurate flow-insensitive points-to analysis - Susan - 1997
101   Context-insensitive alias analysis reconsidered - Ruf - 1995
70   Points-to Analysis in Almost Linear Time - Steensgaard - 1996
69   Unification-based pointer analysis with directional assignme.. - Das - 2000
67   Componential set-based analysis - Flanagan, Felleisen - 1997
67   Escape Analysis for Object Oriented Languages (context) - Blanchet - 1999
63   Removing Unnecessary Synchronization in Java - Bogda, Holzle - 1999
62   Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
44   cient contextsensitive pointer analysis for c programs (context) - Wilson, Lam - 1995
39   Modular interprocedural pointer analysis using access paths:.. - Cheng, mei et al. - 2000
36   An nlogn algorithm for minimizing the states of a finite aut.. (context) - Hopcroft - 1971
34   Projection merging: Reducing redundancies in inclusion const.. - Su, Fahndrich et al. - 2000
34   Relevant context inference (context) - Chatterjee, Ryder et al. - 1999
33   Polymorphic versus monomorphic flowinsensitive points-to ana.. - rey, Foster et al. - 2001
28   Simplifying subtyping constraints: A theory - Pottier - 2001
20   Estimating the impact of scalable pointer analysis on optimi.. - Das, Liblit et al. - 2001
19   Minimal typings in atomic subtyping - Rehof - 1997
18   Optimal representation of polymorphic types with subtyping - Aiken, Wimmers et al. - 1997
13   Partial online cycle elimination in inclusion constraint gra.. - Fahndrich, Foster et al. - 1998
6   ects of flow-sensitivity on pointer alias analyses (context) - Hind, Pioli - 1998
2   Fast Escape Analysis and Stack Allocation for Java Programs (context) - Gay, Steensgaard - 1998
1   Static Analysis for Elimination Unnecessary Synchronization .. (context) - Aldrich, Chambers et al. - 1999
1   Lecture Notes in Computer Science (context) - Gustavsson, Svenningsson - 2053

Documents on the same site (http://www.crhc.uiuc.edu/IMPACT/people/current/nystrom.html):   More
Effective Cluster Assignment for Modulo Scheduling - Nystrom, Eichenberger (1998)   (Correct)
Characterization of Repeating Data Access Patterns in.. - Erik Nystrom Roy (2001)   (Correct)
Scalable, Precise Context-Sensitive Top-Down Process for - Modular Points-To Analysis   (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