基于组合故障频繁树的最小失效诱因模式定位方法  

Locating minimal failure-causing schema based on combinatorial fault frequent tree

作　　者：王勇[1,2] 黄志球 韦良芬[3] 李勇[1] Wang Yong;Huang Zhiqiu;Wei Liangfen;Li Yong(College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China;College of Computer and Information,Anhui Polytechnic University,Wuhu 241000,China;Department of Computer Engineering,Anhui Sanlian University,Hefei 230601,China)

机构地区：[1]南京航空航天大学计算机科学技术学院,南京210016 [2]安徽工程大学计算机与信息学院,芜湖241000 [3]安徽三联学院计算机工程系,合肥230601

出　　处：《东南大学学报（自然科学版）》2018年第2期253-259,共7页Journal of Southeast University：Natural Science Edition

基　　金：国家高技术研究发展计划(863计划)资助项目(2015AA105303);国家自然科学基金资助项目(61272083;61562087);安徽省高校优秀青年人才支持计划重点资助项目(gxyq ZD2016124);安徽省高校自然科学基金重点资助项目(KJ2016A252);安徽工程大学国家自然科学基金预研资助项目(2016yyzr10)

摘　　要：针对定位实际软件中最小失效诱因模式可能受到屏蔽效应影响的问题,提出了一种基于组合故障频繁树的最小失效诱因模式定位方法及其迭代框架.该方法首先依据组合测试用例集及测试结果构建组合故障频繁树,然后从组合故障频繁树中抽取频繁参数值组合作为可疑失效诱因模式,并根据其可疑得分进行排序.基于给出的失效诱因模式迭代定位框架,反复迭代直到满足某一个停止准则为止.利用仿真实验对存在和不存在掩蔽效应影响的2种情形进行有效性验证.实验结果表明,在这2种情形下所提方法均能定位最小失效诱因模式,有效减少附加测试用例的数目.To solve the problem that a minimal failure-causing schema(MFS)in actual software may be influenced by masking effects,a locating MFS technique based on the combinatorial fault frequent tree(CFF-tree)and the corresponding iterative framework are proposed.First,a CFF-tree is constructed based on the combination test suite and the test results.Then,the frequent parameter combination of the tree is extracted as the MFS and ranked according to the suspiciousness score.Based on the locating MFS iterative framework,the process repeats until a stop criterion is satisfied.The simulation experiments are carried out to validate the effectiveness of the method in the two cases with and without masking effects.The experimental results show that in these two cases the proposed method can locate MFS and effectively reduce the number of the additional test cases.

关 键 词：组合测试 故障定位 组合故障频繁树 最小失效诱因模式 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]