CAJ | 학술논문

针对目前指针分析算法的程序中间表示形式不能充分表示程序的语法结构与语义,因而不适合应用于源代码-源代码级别的程序转换与分析的问题,提出了一种基于系统依赖图的过程间指针别名分析算法.改进了指针别名信息的表示方法,精确描述数组元素和指针数组元素的别名.以系统依赖图作为程序的中间表示形式,在每个过程调用节点,根据是否为递归调用,分别采用改进的Banning算法和函数内联的方法处理因参数传递引起的别名信息.实验结果表明,该方法的准确性高于Wilson算法和Emami算法,且指针分析结果可直接应用于源代码级别的程序分析与转换中.
침대목전지침분석산법적정서중간표시형식불능충분표시정서적어법결구여어의,인이불괄합응용우원대마-원대마급별적정서전환여분석적문제,제출료일충기우계통의뢰도적과정간지침별명분석산법.개진료지침별명신식적표시방법,정학묘술수조원소화지침수조원소적별명.이계통의뢰도작위정서적중간표시형식,재매개과정조용절점,근거시부위체귀조용,분별채용개진적Banning산법화함수내련적방법처리인삼수전체인기적별명신식.실험결과표명,해방법적준학성고우Wilson산법화Emami산법,차지침분석결과가직접응용우원대마급별적정서분석여전환중.
Existing pointer analysis algorithms usually adopt a lower-level intermediate representation which can not sufficiently represent the syntactical structure and semanteme of programs, which makes them difficult apply to source-to-source program transformation or analysis. To solve this problem, a flow-sensitive and context-sensitive pointer analysis algorithm based on system dependence graph is presented. An improved representation of alias information is proposed to describe the subscript details of elements in arrays, especially in pointer arrays. Then an iterative alias analysis for each procedure is performed on the system dependence graph of the program. An improved Banning algorithm or an inlining method is used to analyze the alias information respectively at each calling node according to a rule whether it's an iterative call. Test results show that the precision of this approach is higher than those of Wilson's and Emami's approaches. The pointer analyzing results can be directly applied to source-to-source program transformation and analysis.