两两组合测试用例生成的遍历搜索算法  

Ergodic searching algorithm for pairwise testing case generation in combinatorial testing

作　　者：宋晓秋[1] 梁凡[1] SONG Xiao-qiu;LIANG Fan(Institute 706,Second Academy of China Aerospace Science and Industry Corporation,Beijing 100854,China)

机构地区：[1]中国航天科工集团第二研究院706所,北京100854

出　　处：《计算机工程与设计》2019年第2期433-437,共5页Computer Engineering and Design

摘　　要：给出两两组合测试用例生成的遍历搜索算法ES(a,b)。通过对组合空间的遍历搜索,考虑当前测试用例和后续测试用例能尽可能多地覆盖未覆盖的组合,通过综合当前因素的权重a和后续因素的权重b生成两两组合的测试用例。对比实验结果表明,ES(a,b)算法具有较强的测试用例优化能力,其算法生成的测试用例个数优于AETG算法及其改进算法。The ergodic searching algorithm ES(a,b)for pairwise test case generation in combinatorial testing was given.Making not only current test cases but subsequent test cases can cover uncovered pairwise elements as much as possible was taken into consideration when searching the pairwise set,and pairwise test cases were generated by synthesizing both the weight of current element a and the weight of the subsequent element b.Experimental contrast results verify that ES(a,b)algorithm has good optimizing ability for test cases,the number of test cases generated using ES(a,b)algorithm is less than that generated using AETG algorithm and its improved algorithm.

关 键 词：组合测试 两两组合 测试用例 覆盖 算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]