Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation

被引:55
作者
Cheng, BC
Hwu, WMW
机构
[1] Univ Illinois, Dept Comp Sci, Chicago, IL 60680 USA
[2] Univ Illinois, Dept Elect & Comp Engn, Chicago, IL 60680 USA
关键词
D O I
10.1145/358438.349311
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper we present a modular interprocedural pointer analysis algorithm based on access-paths for C programs. We argue that access paths can reduce the overhead of representing context-sensitive transfer functions and effectively distinguish non-recursive heap objects. And when the modular analysis paradigm is used together with other techniques to handle type casts and function pointers, we are able: to handle significant programs like those in the SPECcint92 and SPECcint95 suites. We have implemented the algorithm and tested it on a Pentium II 450 PC running Linux. The observed resource consumption and performance improvement are very encouraging.
引用
收藏
页码:57 / 69
页数:13
相关论文
共 41 条
[1]  
Aho Alfred V., 1986, ADDISON WESLEY SERIE
[2]  
ALLEN R, 1988, P ACM SIGPLAN 1988 C, P241
[3]  
Andersen L. O., 1994, PhD thesis
[4]   Load-reuse analysis:: Design and evaluation [J].
Bodík, R ;
Gupta, R ;
Soffa, ML .
ACM SIGPLAN NOTICES, 1999, 34 (05) :64-76
[5]  
BURKE M, 1995, LECT NOTES COMPUTER, V892, P234
[6]  
CHASE DR, 1990, P SIGPLAN 90 C PROGR, P296
[7]  
CHATTERJEE R, 1999, P 26 ACM SIGPLAN SIG, P133
[8]  
CHENG B, 1997, THESIS U ILLINOIS UR
[9]  
CHENG B, 2000, THESIS U ILLINOIS UR
[10]  
CHOI JD, 1993, P 20 ACM SIGPLAN SIG, P232