期刊文献+

上下文敏感的纵向传播算法 被引量:1

Context-sensitive Deep Propagation Algorithm
下载PDF
导出
摘要 通过基于包含的指针分析在线优化技术中的纵向传播方法,改进基于调用图上下文敏感指针分析的环消除技术,提出一种上下文敏感的纵向传播算法。初始化约束图,在约束图中进行环探测及其合并,执行差异传播并循环处理复杂约束,直到一次调用纵向传播例程后图中所有结点指向集不变为止,从而得到图中各结点到其指向集的映射。应用CIL工具的实验结果表明,该算法能有效地对源程序进行上下文敏感的指针分析,与环消除技术相比,在分析大规模程序时具有更高的时间效率。 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.
出处 《计算机工程》 CAS CSCD 2014年第2期62-66,共5页 Computer Engineering
基金 上海市教委创新基金资助项目(11ZZ124)
关键词 在线优化 纵向传播 调用图 上下文敏感指针分析 环消除 约束图 on-line optimization Deep Propagation(DP) invocation graph context-sensitive pointer analysis cycle elimination constraint graph
  • 相关文献

参考文献1

二级参考文献60

  • 1张明军,罗军.缓冲区溢出静态分析中的指针分析算法[J].计算机工程,2005,31(18):41-43. 被引量:4
  • 2张威,卢庆龄,李梅,宫云战.基于指针分析的内存泄露故障测试方法研究[J].计算机应用研究,2006,23(10):22-24. 被引量:7
  • 3Hind M. Pointer analysis:Haven't we solved this problem yet?//Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program Analysis for Software Tools and Engineering. Snowbird, Utah, USA, 2001:54-61.
  • 4Hind M, Pioli A. Which pointer analysis should I use?//Proceedings of the 2000 ACM SIGSOFT International Symposi um on Software Testing and Analysis. Portland, Oregon USA, 2000:113-123.
  • 5Ryder B G. Dimensions of precision in reference analysis of object-oriented programming languages//Proceedings of the 12th International Conference on Compiler Construction. Warsaw, Poland, 2003:126-137.
  • 6Tarjan R. Depth-first search and linear graph algorithm. SIAM Journal on Computing, 1972, 1(2) : 146-160.
  • 7Nuutila E, Soisalon-Soininen E. On finding the strongly connected components in a directed graph. Information Processing Letters, 1993, 49(1) : 9-14.
  • 8Faihndrich M, Foster J S, Su Z, Aiken A. Partial online cycle elimination in inclusion constraint graphs. ACM SIGPLAN Notices, 1998, 33(5): 85-96.
  • 9Su Z, Fahndrich M, Aiken A. Projection merging, Reducing redundancies in inclusion constraint graphs//Proceedings of the 2000 Symposium on Principles of Programming Languages, Boston, Massachusetts, 2000:81-95.
  • 10Heintze N, Tardieu O. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. ACM SIGPLAN Notices, 2001, 36(5): 254-263.

共引文献9

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部