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 条
[11]  
CHOW F, 1984, P SIGPLAN 84 S COMPI, P222
[12]  
COOPER K, 1997, P ACM SIGPLAN 97 C P, P308
[13]  
CORMEN TH, 1992, INTRO ALGORITHMS
[14]   EFFICIENTLY COMPUTING STATIC SINGLE ASSIGNMENT FORM AND THE CONTROL DEPENDENCE GRAPH [J].
CYTRON, R ;
FERRANTE, J ;
ROSEN, BK ;
WEGMAN, MN ;
ZADECK, FK .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1991, 13 (04) :451-490
[15]  
DEUTSCH A, 1994, PLDI, P230
[16]  
DIWAN A, 1998, P ACM SIGPLAN 98 C P, P106
[17]  
EMAMI M, 1994, P ACM SIGPLAN 94 C P, P242
[18]  
FAHNDRICH M, 1998, P 1998 ACM SIGPLAN C, P85
[19]  
Ghiya R., 1998, P 25 ANN ACM SIGPLAN, P121
[20]  
HASTI R, 1998, P ACM SIGPLAN 98 C P, P97