首页 | 本学科首页   官方微博 | 高级检索  
     

上下文敏感的纵向传播算法
引用本文:邓朝日,张玉萍,陈 雄,等.上下文敏感的纵向传播算法[J].计算机工程,2014(2):62-66.
作者姓名:邓朝日  张玉萍  陈 雄  
作者单位:上海师范大学信息与机电工程学院,上海200234
基金项目:上海市教委创新基金资助项目(11ZZl24)
摘    要:通过基于包含的指针分析在线优化技术中的纵向传播方法,改进基于调用图上下文敏感指针分析的环消除技术,提出一种上下文敏感的纵向传播算法。初始化约束图,在约束图中进行环探测及其合并,执行差异传播并循环处理复杂约束,直到一次调用纵向传播例程后图中所有结点指向集不变为止,从而得到图中各结点到其指向集的映射。应用CIL工具的实验结果表明,该算法能有效地对源程序进行上下文敏感的指针分析,与环消除技术相比,在分析大规模程序时具有更高的时间效率。

关 键 词:在线优化  纵向传播  调用图  上下文敏感指针分析  环消除  约束图

Context-sensitive Deep Propagation Algorithm
DENG Zhao-ri,ZHANG Yu-ping,CHEN Xiong,LIANG Chen.Context-sensitive Deep Propagation Algorithm[J].Computer Engineering,2014(2):62-66.
Authors:DENG Zhao-ri  ZHANG Yu-ping  CHEN Xiong  LIANG Chen
Affiliation:(College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China)
Abstract:Through using Deep Propagation(DP) algorithm, which is the techniques of inclusion based pointer analysis on-line optimization technology, to optimize the technology of cycle elimination based on invocation graph context-sensitive pointer analysis, and then puts forward a new context-sensitive DP algorithm. It initializes constraint graph, explores and merges ring, executes difference propagation and circulates processing complex constraints in the diagram, until all the point-to set of all nodes no longer change after executive vertical transmission routines for once, then gets mapping of each node in the graph to the point-to set. Using the CIL tool for experiment, results show that the proposed algorithm has higher time efficiency when analyzing the same large scale program compared with cycle elimination technology.
Keywords:on-line optimization  Deep Propagation(DP)  invocation graph  context-sensitive pointer analysis  cycle elimination  constraint graph
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号