ACM Home Page
Please provide us with feedback. Feedback
Evaluating the impact of context-sensitivity on Andersen's algorithm for Java programs
Full text PdfPdf (317 KB)
Source Workshop on Program Analysis for Software Tools and Engineering archive
Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering table of contents
Lisbon, Portugal
SESSION: Static analysis table of contents
Pages: 6 - 12  
Year of Publication: 2005
ISBN:1-59593-239-9
Also published in ...
Authors
Donglin Liang  University of Minnesota, Minneapolis, MN
Maikel Pennings  Georgia Institute of Technology, Atlanta, GA
Mary Jean Harrold  Georgia Institute of Technology, Atlanta, GA
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 41,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1108792.1108797
What is a DOI?

ABSTRACT

Program analysis and program optimization of Java programs require reference information that estimates the instances of classes that may be accessed through dereferences. Recent work has presented several approaches for adapting Andersen's algorithm [1]---the most precise flow-insensitive and context-insensitive points-to analysis algorithm developed for C--- for analyzing Java programs (e.g., [5, 9, 12]). Studies in our previous work [6] indicate that this algorithm may compute very imprecise reference information for Java programs.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, University of Copenhagen, May 1994.
 
2
S. Guyer and C. Lin. Client-driven pointer analysis. In Static Analysis Symposium, 2003.
3
4
5
6
7
8
9
10
 
11
M. Sharir and A. Pnueli. Two approaches to interprocedural data-flow analysis. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Application, pages 189--223. 1981.
 
12
M. Streckenbach and G. Snelting. Points-to for java: A general framework and an empirical comparison. Technical report, University Passau, Nov. 2000.
13
14


Collaborative Colleagues:
Donglin Liang: colleagues
Maikel Pennings: colleagues
Mary Jean Harrold: colleagues