计算机与现代化Issue(3)：12-16,5.DOI:10.3969/j.issn.1006-2475.2013.03.004
基于概率推演的动态程序切片优先度计算方法
Prioritizing Dynamic Program Slices Based on Probabilistic Inference
摘要
Abstract
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.关键词
动态切片/程序调试/概率推演/自动化程序分析/错误定位Key words
dynamic slicing/ debugging/ probabilistic inference/ automated program analysis/ fault localization分类
信息技术与安全科学引用本文复制引用
夏嘉斌..基于概率推演的动态程序切片优先度计算方法[J].计算机与现代化,2013,(3):12-16,5.基金项目
国家自然科学基金资助项目(60673120) （60673120）
