[1]王勇,黄志球,韦良芬,等.基于组合故障频繁树的最小失效诱因模式定位方法[J].东南大学学报(自然科学版),2018,48(2):253-259.[doi:10.3969/j.issn.1001-0505.2018.02.010]
 Wang Yong,Huang Zhiqiu,Wei Liangfen,et al.Locating minimal failure-causing schema based on combinatorial fault frequent tree[J].Journal of Southeast University (Natural Science Edition),2018,48(2):253-259.[doi:10.3969/j.issn.1001-0505.2018.02.010]
点击复制

基于组合故障频繁树的最小失效诱因模式定位方法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
48
期数:
2018年第2期
页码:
253-259
栏目:
计算机科学与工程
出版日期:
2018-03-20

文章信息/Info

Title:
Locating minimal failure-causing schema based on combinatorial fault frequent tree
作者:
王勇12黄志球1韦良芬3李勇1
1南京航空航天大学计算机科学技术学院, 南京 210016; 2安徽工程大学计算机与信息学院, 芜湖 241000; 3安徽三联学院计算机工程系, 合肥 230601
Author(s):
Wang Yong12 Huang Zhiqiu1 Wei Liangfen3 Li Yong 1
1College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
2College of Computer and Information, Anhui Polytechnic University, Wuhu 241000, China
3Department of Computer Engineering, Anhui Sanlian University, Hefei 230601, China
关键词:
组合测试 故障定位 组合故障频繁树 最小失效诱因模式
Keywords:
combinatorial testing fault localization combinatorial fault frequent tree minimal failure-causing schema
分类号:
TP311
DOI:
10.3969/j.issn.1001-0505.2018.02.010
摘要:
针对定位实际软件中最小失效诱因模式可能受到屏蔽效应影响的问题,提出了一种基于组合故障频繁树的最小失效诱因模式定位方法及其迭代框架.该方法首先依据组合测试用例集及测试结果构建组合故障频繁树,然后从组合故障频繁树中抽取频繁参数值组合作为可疑失效诱因模式,并根据其可疑得分进行排序.基于给出的失效诱因模式迭代定位框架,反复迭代直到满足某一个停止准则为止.利用仿真实验对存在和不存在掩蔽效应影响的2种情形进行有效性验证.实验结果表明,在这2种情形下所提方法均能定位最小失效诱因模式,有效减少附加测试用例的数目.
Abstract:
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.

参考文献/References:

[1] Nie C, Leung H. A survey of combinatorial testing[J]. ACM Computing Surveys, 2011, 43(2): 1-29. DOI:10.1145/1883612.1883618.
[2] 严俊, 张健. 组合测试:原理与方法[J]. 软件学报, 2009, 20(6): 1393-1405. DOI:10.3724/SP.J.1001.2009.03497.
Yan Jun, Zhang Jian. Combinatorial testing: Principles and methods[J]. Journal of Software, 2009, 20(6): 1393-1405. DOI:10.3724/SP.J.1001.2009.03497. (in Chinese)
[3] Ghandehari L S G, Lei Y, Xie T, et al. Identifying failure-inducing combinations in a combinatorial test set[C]//2012 IEEE Fifth International Conference on Software Testing, Verification and Validation. Montreal, Canada, 2012: 370-379. DOI:10.1109/icst.2012.117.
[4] Nie C, Leung H. The minimal failure-causing schema of combinatorial testing[J]. ACM Transactions on Software Engineering and Methodology, 2011, 20(4): 1-38. DOI:10.1145/2000799.2000801.
[5] Zhang Z, Zhang J. Characterizing failure-causing parameter interactions by adaptive testing[C]//Proceedings of the 2011 International Symposium on Software Testing and Analysis. Toronto, Canada, 2011: 331-341. DOI:10.1145/2001420.2001460.
[6] Niu X, Nie C, Lei Y, et al. Identifying failure-inducing combinations using tuple relationship[C]//2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops. Luxembourg, Luxembourg, 2013: 271-280. DOI:10.1109/icstw.2013.38.
[7] Dumlu E, Yilmaz C, Cohen M B, et al. Feedback driven adaptive combinatorial testing[C]//Proceedings of the 2011 International Symposium on Software Testing and Analysis. Toronto, Canada, 2011: 243-253. DOI:10.1145/2001420.2001450.
[8] Yilmaz C, Fouche S, Cohen M B, et al. Moving forward with combinatorial interaction testing[J]. Computer, 2014, 47(2): 37-45. 37-45. DOI:10.1109/mc.2013.408.
[9] Yilmaz C, Cohen M B, Porter A A. Covering arrays for efficient fault characterization in complex configuration spaces[J]. IEEE Transactions on Software Engineering, 2006, 32(1): 20-34. DOI:10.1109/tse.2006.8.
[10] Shakya K, Xie T, Li N, et al. Isolating failure-inducing combinations in combinatorial testing using test augmentation and classification[C]// 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation. Montreal, Canada, 2012: 620-623.DOI:10.1109/icst.2012.149.
[11] Ammann P, Offutt J. Introduction to software testing[M]. Cambridge,UK: Cambridge University Press, 2016:31-32.
[12] Han J, Pei J, Kamber M. Data mining: Concepts and techniques[M]. Amsterdam, the Netherlands: Elsevier, 2011:246-253.
[13] Ghandehari L S, Chandrasekaran J, Lei Y,et al. BEN: A combinatorial testing-based fault localization tool[C]//IEEE Eighth International Conference on Software Testing Verification and Validation Workshops. Graz, Australia, 2015:1-4.

相似文献/References:

[1]周吴杰,张德平,徐宝文.快速生成两两组合测试用例集算法[J].东南大学学报(自然科学版),2011,41(5):943.[doi:10.3969/j.issn.1001-0505.2011.05.010]
 Zhou Wujie,Zhang Deping,Xu Baowen.A new speedy generation algorithm for pairwise testing[J].Journal of Southeast University (Natural Science Edition),2011,41(2):943.[doi:10.3969/j.issn.1001-0505.2011.05.010]

备注/Memo

备注/Memo:
收稿日期: 2017-08-15.
作者简介: 王勇(1979—),男,博士生,副教授;黄志球(联系人),男,教授,博士生导师,zqhuang@nuaa.edu.cn.
基金项目: 国家高技术研究发展计划(863计划)资助项目(2015AA105303)、国家自然科学基金资助项目(61272083,61562087)、安徽省高校优秀青年人才支持计划重点资助项目(gxyqZD2016124)、安徽省高校自然科学基金重点资助项目(KJ2016A252)、安徽工程大学国家自然科学基金预研资助项目(2016yyzr10).
引用本文: 王勇,黄志球,韦良芬,等.基于组合故障频繁树的最小失效诱因模式定位方法[J].东南大学学报(自然科学版),2018,48(2):253-259. DOI:10.3969/j.issn.1001-0505.2018.02.010.
更新日期/Last Update: 2018-03-20