摘要
在组合覆盖测试模型的基础上提出:将所有的可用测试数据表示为一棵解空间树,利用回溯法对解空间树进行路径搜索来生成测试数据,然后使用贪心算法补充生成测试数据,以满足两两组合覆盖标准.并且实现了基于该方法的测试数据生成工具,所生成的测试数据集与同类工具相比具有一定的特点和优势.
Pairwise testing is practical and effective for various types of software systems,and it is a key problem to generate test data for the pairwise coverage criterion.This paper represents all feasible test data as a solution space tree based on the combinatorial testing model,and suggests a backtrack approach to search a subset of paths in the tree for pairwise testing data generation.Then some test data may be added into the test data suite by a greedy algorithm to cover all the uncovered pairs.The authors have implemented a test generation tool based on the approach,and the empirical results show that the approach has some merits compared with the related works.
作者
史亮
聂长海
徐宝文
SHI Liang;NIE Chang-Hai;Xu Bao-Wen(School of Computer Science and Engineering,Southeast University,Nanjing 210096;State Key Laboratory of Software Engineering,Wuhan University,Wuhan 430072)
出处
《计算机学报》
EI
CSCD
北大核心
2006年第6期849-857,共9页
Chinese Journal of Computers
基金
国家杰出青年科学基金(60425206)
国家自然科学基金(60403016
60373066)
江苏省自然科学基金(BK2005060)资助.
关键词
软件测试
组合覆盖
测试数据生成
算法
软件工程
software testing
combinatorial coverage
test data generation
algorithm
software engineering