改进的基于包含约束的指针分析法  

Improved Inclusion-Based Pointer Analysis

作　　者：崔应霞[1] 李龙澍[1] 姚晟[1] 

机构地区：[1]安徽大学计算机科学与技术学院,合肥230039

出　　处：《华东理工大学学报（自然科学版）》2010年第4期563-567,共5页Journal of East China University of Science and Technology

基　　金：安徽省自然科学基金(090412054);安徽省科技攻关计划重大科技专项(08010201002);安徽省教育厅重点项目(KJ2009A001Z)

摘　　要：针对基于包含约束的指针分析法存在的主要问题是包含约束语言的限制性和约束图的简化,提出了一个基于包含约束语言的指针分析算法。首先对包含约束语言进行扩展,使其不再局限于几个基本形式,并进一步给出约束传播规则;然后一次性构建约束图,图中不再存在复杂边,整个分析过程由动态转化为静态;最后,提出一个算法对简化的约束图进行分析,得到指针信息。实验结果表明,该算法能够精确地分析出一个指针的任何级别脱引用的指向信息。The main issues of inclusion-based pointer analysis are the limitation of inclusion constraints language limitation and the simplification of constraint graph. Aiming the above shortcoming, this paper proposes a pointer analysis algorithm based on inclusion constraint language. Firstly, the language of inclusion constraints is extended such that it is no longer confined to several basic forms, and the rules of constraint propagation are given. Then, a constraint graph is constructed at a time, in which there are not the complex edges and the whole process of analysis is changed into static from dynamic. Finally, an algorithm is given to analyze the simplified constraint graph such that the pointer＇s information is obtained. Experiment results show that the new algorithm can accurately analyze any level of de-referenced points-to information of a pointer.

关 键 词：包含约束语言 约束传播规则 约束图简化 静态分析 

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