程序不变量驱动的组合测试用例约简方法  

Reduction algorithm based on invariant for pairwise test sets

作　　者：孙家泽[1] 

机构地区：[1]西安邮电学院计算机学院,陕西西安710121

出　　处：《西安邮电学院学报》2012年第2期71-74,79,共5页Journal of Xi'an Institute of Posts and Telecommunications

基　　金：国家自然科学基金资助项目(61050003);陕西省科技攻关计划资助项目(2009K08-26)

摘　　要：针对组合测试用例约简问题,提出一种基于程序不变量的两两覆盖组合测试用例约简方法。首先用组合测试用例生成算法对被测程序一次生成一个组合测试用例,然后根据该组合测试用例提取被测程序的程序不变量来决定该测试用例的取舍。典型案例实验表明该方法能有效地对组合测试用例集进行约简,可降低测试用例的数量,提高测试用例的质量。A novel test suite reduction algorithm based on program invariant for pair wise test sets is presented to solve the problem of test suite reduction.Firstly a combinatorial test case is generated with the strategy of ＂one test at a time＂,then program invariant is abstracted through running the new test case to decided the test case is selected or not.The imitate results manifest that the novel test suite reduction algorithm is an effective algorithm for pair wise test sets reduction,which reduces the number of the test cases and enhances the quality of the test sets.

关 键 词：程序不变量 测试用例约简 组合测试 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]