检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:艾华 宋晓秋[1] 安恒 AI Hua;SONG Xiao-qiu;AN Heng(Institute 706, Second Academy of China Aerospace Science and Industry Corporation, Beijing 100854, China)
机构地区:[1]中国航天科工集团第二研究院706所,北京100854
出 处:《计算机工程与设计》2018年第12期3728-3733,共6页Computer Engineering and Design
摘 要:为解决最小三三组合测试用例集生成问题,在逐参数扩展策略的基础上进行简化,提出简单循环约减方法。将多种贪心策略融合应用到生成最小测试用例集的过程中,以全局测试用例集规模最小为目标,通过不断地水平直接扩展和垂直循环约减的方式,有效避免逐参数扩展策略陷入局部次优解的风险,在较大解空间内进行循环约减,提高方法全局寻优能力,得到全局近似最小测试用例集。通过Java程序实现,并与其它算法进行实验比较,验证了该方法的有效性。To solve the problem of generating the minimum three-way combinatorial test case set,a simple-cyclic-reduce algorithm based on simplified in-parameter-order expansion strategy was proposed.To match the goal of minimizing the global three-way combinatorial test case set,several greedy strategies were combined,in the process of generating the minimum three-way combinatorial test case set,risk of falling into local suboptimal solution of in-parameter-order strategy was avoided and capability of obtaining global optimization in a larger solution space was improved through continuous horizontal expansion and vertical cyclic reduction,thus the global approximate minimum three-way combinatorial test case set was obtained.The feasibility of the method was validated by practical program written in Java and comparison with other algorithms.
关 键 词:三三组合 测试用例集 逐参数扩展 组合测试 软件测试
分 类 号:TP311.56[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.51