%0 Journal Article
%T A New Approach to Pointer Analysis for Assignments
%A HUANG Bo
%A ZANG Binyu
%A LI Jing
%A ZHU Chuanqi
%A <br>黄波
%A 臧斌宇
%J 计算机科学技术学报
%D 2001
%I 
%X Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are classified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data.
%K pointer analysis
%K pointer assignment
%K point-to information
%K recursive data structure<br>软件开发
%K C语言
%K 赋值
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=B824B2B81266F5EE9201F947153D01B3&yid=14E7EF987E4155E6&vid=7801E6FC5AE9020C&iid=38B194292C032A66&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=8