期刊文献+

过程间循环路径剖析方法 被引量:1

A New Method for Profiling Inter-Procedural Paths with Loops
下载PDF
导出
摘要 该文在过程内剖析技术的基础上提出了一种新的过程间路径剖析方法PIP,能够精确地编码过程间路径和方法级执行序列.为了有效地处理方法间多态等复杂调用,文中提出了一种新的剖析模型PCCG(Polymorphic Cluster Call Graph),能够精确描述多态信息,并且支持以"方法集簇"的方式对多个被调用方法统一处理,简化调用结构,减少剖析耗费.基于PCCG模型,PIP方法能够精确地进行过程间路径剖析,并可采用多种方法集簇策略来优化剖析效率.理论分析和实验结果表明,PIP方法具有较高的精确性和循环处理能力,且各种集簇策略能够适应不同的应用情况,有效地提升效率. This paper presents a novel method (called PIP) for profiling inter procedural paths with loops, which extends previous work on intra-procedural profiling. PIP can be used to uniquely encode inter-procedural flows and method sequences, based on an inter-procedural con- trol flow model, PCCG (Polymorphic Cluster Call Graph). PCCG can deal with polymorphism, support clustering of procedures for better analysis, and improve efficiency. Theoretical analysis and experimental results show that different clustering strategies of PCCG achieve different levels of efficiency under different situations. Suggestion on how to choose a proper clustering strategy is derived from the empirical study. Compared with existing work, PIP can accurately profile more paths, and is more practical for programs with loops.
出处 《计算机学报》 EI CSCD 北大核心 2013年第11期2224-2235,共12页 Chinese Journal of Computers
基金 江苏省自然科学基金(BK20130633) 国家自然科学基金(60973149) 中国科学院计算机科学国家重点实验室开放基金(SYSKF1110) 教育部博士点基金(20100092110022) 江苏省高校科研成果产业化推进项目(JHB2011-3)资助~~
关键词 路径剖析 过程间路径 多态 动态分析 软件测试 path profiling inter-procedural paths~ polymorphism dynamic analysis software testing
  • 相关文献

参考文献11

  • 1Ball T, Larus J R. Efficient path profiling//Proceedings of the 29th Annual ACM/IEEE International Symposium on Microarchitecture (MICRO). Paris, France, 1996:46-57.
  • 2Joshi R, Bond M D, Zilles C B. Targeted path profiling: Lower overhead path profiling for staged dynamic optimiza tion systems//Proceedings of the International Symposium on Code Generation and Optimization (CGO). Palo Alto, USA, 2004:239-250.
  • 3Bond M D, McKinley K S. Practical path profiling for dynamic optimizers//Proceedings of the International Sympo- sium on Code Generation and Optimization (CGO). San Jose, USA, 2005:205-216.
  • 4Apiwattanapong T, Harrold M J. Selective path profiling// Proceedings of the Workshop on Program Analysis for Soft ware Tools and Engineering (PASTE). Charleston, USA, 2002:35-42.
  • 5Vaswani K, Nori A V, Chilimbi T M. Preferential path pro- filing= Compactly numbering interesting paths//Proceedings of the 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). Nice, France, 2007:351-362.
  • 6Ball T, Larus J R. Programs follow paths. Microsoft Research: Technical Report MSR-TR-99 01, 1999.
  • 7Roy S, Srikant Y N. Profiling k iteration paths: A generali zation of the Ball Larus profiling algorithm//Proceedings of the 2009 International Symposium on Code Generation and Optimization (CGO). Seattle, USA, 2009:70-80.
  • 8Melski D, Reps T W. Interprocedural path profiling//Pro- ceedings of the 8th International Conference on Compiler Construction, Held as Part of the European Joint Confer- ences on the Theory and Practice of Software (ETAPS). Amsterdam, Netherlands, 1999: 47-69.
  • 9Tallam S, Zhang X, Gupta R. Extending path profiling across loop backedges and procedure boundaries//Proeeed- ings of the International Symposium on Code Generation and Optimization (CGO). Palo Alto, USA, 20041 251-264.
  • 10Li B, Wang L, Leung H. Profiling all paths: A new profiling technique for both cyclic and acyclic paths. The Journal of Systems & Software (JSS), 2012, 85:1558-1576.

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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