基于集合覆盖的Wp方法测试集约简方法  

Approach for Reduction Test Suite of Wp Method Based on Set Covering Problem

作　　者：崔玲[1,2] 张建标[1,2,3] 公备[1,2] 吴丽影[1] 

机构地区：[1]北京工业大学计算机学院,北京100124 [2]北京工业大学可信计算北京市重点实验室,北京100124 [3]北京工业大学信息安全等级保护关键技术国家工程实验室,北京100124

出　　处：《北京工业大学学报》2016年第9期1332-1337,共6页Journal of Beijing University of Technology

基　　金：国家自然科学基金资助项目(61501007)

摘　　要：为了提高测试效率,提出一种基于集合覆盖的测试集约简方法.该方法对有限状态机(finite state machine,FSM)模型中经典的测试生成算法Wp方法(部分W方法)所生成的测试集进行冗余约简.通过分析Wp方法的特点,找出测试序列之间包含关系的规律,删除冗余的测试用例.理论分析和实验结果表明:该方法能够有效约简测试集,并且不改变故障检测能力.To improve the test efficiency,a reduction method of test sets reduction based on set covering was presented. Redundancy reduction on the test set generated by Wp( part of W) method was carried out,which was a classical test generation algorithm in FSM( finite state machine) model. By analyzing the characteristics of Wp method,the regularity of the inclusion relations between test sequences was found,and then redundant test cases were deleted. Theoretical analysis and experimental results show that the method can effectively reduce the original test set and has the same error detection capabilities as the test set before.

关 键 词：有限状态机(FSM) Wp方法 集合覆盖 约简 

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