一种利用指向组合优化依赖图构建的方法  

Using Points-to Combinations to Optimize Dependence Graph Construction

作　　者：张磊[1] 陶彬贤[1] 钱巨[1] 

机构地区：[1]南京航空航天大学计算机科学与技术学院,南京210016

出　　处：《计算机科学》2013年第1期139-143,共5页Computer Science

基　　金：国家自然科学基金(60903026)资助

摘　　要：指针的动态性使得程序分析中一个指针变量往往被认为有多个可能的指向目标,构成多个指向关系。现有的依赖图构建方法虽然较全面地考虑了指针的多指向性,但并未考虑指向关系之间的可组合性,因此精度上仍存在许多不足。为此,提出了一种利用无效指向组合优化依赖图构建的方法,新方法可以排除现有方法所不能识别的伪依赖,从而有效地提高依赖图的构建精度。The dynamic nature of pointers makes a pointer possibly points to many different locations in an execution in program analysis.The existing dependence graph construction algorithms have already taken these multiple points-to relations into consideration.However,they do not consider the combination of points-to relations.Many points-to relations are not combinable.Without excluding these invalid combinations,we may lose precision in dependence graph construction.To address the problem,this paper proposed an approach that uses the invalid combinations of points-to relations to optimize dependence graph construction.The approach can discard many false dependences which cannot be identified by the existing approaches,and thereby improve the precision of dependence graph construction.

关 键 词：依赖图 指针 组合 别名 程序切片 

分 类 号：TP311.5[自动化与计算机技术—计算机软件与理论]