摘要
针对Mod-dejavoo算法中有害边的相关问题进行研究。通过比较程序变更前后的控制流图,分析Java语言的特点,指出有害边出现的位置和规律及其不唯一性。在原有Mod-dejavoo算法的基础上提出一种确定有害边位置和数量的方法,从而生成回归测试集。该研究能为测试集筛选提供一种新方法。
This paper studies on the dangerous edge that presents in the Mod-dejavoo algorithm.It points out that the location and the role of the dangerous edge,by comparing the control-flow graphs around the program changed,analysing the characteristics of Java.It also points out the dangerous edge does not occur uniquely.It proposes a method to find the location and quantity based on the Mod-dejavoo algorithm,which generates regression test set effectively.The research provides test set screening with a new method.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第10期38-40,43,共4页
Computer Engineering
基金
上海市科委基金资助项目(09220503000)
上海市教委科研创新基金资助重点项目(0922135)