期刊文献+

基于概率推演的动态程序切片优先度计算方法

Prioritizing Dynamic Program Slices Based on Probabilistic Inference
下载PDF
导出
摘要 为了提高程序调试的效率,本文提出一种基于概率推演自动计算动态程序切片中每条语句的正确概率并赋予优先度的方法。首先从程序运行过程抽取其相应的动态依赖关系图;然后根据依赖关系转化成贝叶斯网络;最后在该网络上运行概率推演并统计,得到程序静态语句的正确概率。使用具有优先度的动态程序切片结果可进一步提高调试人员定位缺陷和分析故障的效率。实验表明本方法平均可将实际错误排名在切片结果的前20.2%。 In order to increase the productivity of the debugging process,this paper proposes a novel strategy for prioritizing dynamic program slices by automatically calculating the probability of correctness of each statement based on the dynamic slices.First,a runtime dependence graph of the observed program outcome is extracted.The next step is the transformation from the dependence network to a Bayesian network.Finally,run a probabilistic inference for the likelihood of correctness of the execution instances and estimates the corresponding correctness of the static statements.Programmers can administer a guided bug locating process using this ranking of correctness belief.The results shows that on average our tool rank the faults to 20.2% of the dynamic slices.
作者 夏嘉斌
出处 《计算机与现代化》 2013年第3期12-16,共5页 Computer and Modernization
基金 国家自然科学基金资助项目(60673120)
关键词 动态切片 程序调试 概率推演 自动化程序分析 错误定位 dynamic slicing debugging probabilistic inference automated program analysis fault localization
  • 相关文献

参考文献16

  • 1Agrawal H, Horgan J R. Dynamic program slicing[C]//Pro- ceedings of the ACM SIGPLAN 1990 Conference on Program- ming Language Design and Implementation. 1990:246-256.
  • 2Zhang X, He H, Gupta N, et al. Experimental evaluation of using dynamic slices for fault location[ C ]/! Proceedings of the Sixth International Symposium on Automated Analy- sis-driven Debugging. 2005:33-42.
  • 3Korel B, Rilling J. Dynamic program slicing methods [ J ]. Information and Software Technology, 1998,40 ( 11-12 ) : 647-659.
  • 4Zhang X, Gupta N, Gupta R. Pruning dynamic slices with confidence[ C]/! Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Imple- mentation. 2006:169-180.
  • 5Zhang X, Gupta R. Wholeexecution traces [ C ]// Pro- ceedings of the 37th Annum IEEE/ACM International Sym- posium on Microarchitecture. 2004 : 105-116.
  • 6Minka T P. Expectation propagation for approximate Bayesian inference [C]// Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence. 2001:362-369.
  • 7Winn J, Bishop C. Variational message passing[J]. Jour- nal of Machine Learning Research, 2005,6 : 661-694.
  • 8Minka T P, Winn J, Guiver J, et al. Infer. NET 2.4, Mi- crosoft Research Cambridge [ EB/OL ]. http://research. microsoft, com/infemet, 2012-10-31.
  • 9Hammer C, Snelting G. An improved slicer for Java[ C]//Proceedings of the 5th ACM SIGPLAN-SIGSOFI' Workshop on Program Analysis for Software Tools and Engineering. 2004 : 17-22.
  • 10Software-artifact Infrastructure Repository [ EB/OL]. ht- tp ://sir. unl. edu/portal/index, php, 2012-10-31.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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