中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
热门
Generating combinatorial test suite using combinatorial optimization

文献类型:期刊论文

作者Zhang, Zhiqiang (1) ; Yan, Jun (3) ; Zhao, Yong (5) ; Zhang, Jian (1)
刊名Journal of Systems and Software
出版日期2014
卷号98页码:191-207
关键词Combinatorial testing Test generation Combinatorial optimization
ISSN号1641212
通讯作者Zhang, Zhiqiang
中文摘要Combinatorial testing (CT) is an effective technique to test software with multiple configurable parameters. It is used to detect interaction faults caused by the combination effect of parameters. CT test generation aims at generating covering arrays that cover all t-way parameter combinations, where t is a given covering strength. In practical CT usage scenarios, there are usually constraints between parameters, and the performance of existing constraint-handling methods degrades fast when the number of constraints increases. The contributions of this paper are (1) we propose a new one-test-at-a-time algorithm for CT test generation, which uses pseudo-Boolean optimization to generate each new test case; (2) we have found that pursuing the maximum coverage for each test case is uneconomic, and a possible balance point is to keep the approximation ratio in [0.8,0.9]; (3) we propose a new self-adaptive mechanism to stop the optimization process at a proper time when generating each test case; (4) extensive experimental results show that our algorithm works fine on existing benchmarks, and the constraint-handling ability is better than existing approaches when the number of constraints is large; and (5) we propose a method to translate shielding parameters (a common type of constraints) into normal constraints.
英文摘要Combinatorial testing (CT) is an effective technique to test software with multiple configurable parameters. It is used to detect interaction faults caused by the combination effect of parameters. CT test generation aims at generating covering arrays that cover all t-way parameter combinations, where t is a given covering strength. In practical CT usage scenarios, there are usually constraints between parameters, and the performance of existing constraint-handling methods degrades fast when the number of constraints increases. The contributions of this paper are (1) we propose a new one-test-at-a-time algorithm for CT test generation, which uses pseudo-Boolean optimization to generate each new test case; (2) we have found that pursuing the maximum coverage for each test case is uneconomic, and a possible balance point is to keep the approximation ratio in [0.8,0.9]; (3) we propose a new self-adaptive mechanism to stop the optimization process at a proper time when generating each test case; (4) extensive experimental results show that our algorithm works fine on existing benchmarks, and the constraint-handling ability is better than existing approaches when the number of constraints is large; and (5) we propose a method to translate shielding parameters (a common type of constraints) into normal constraints.
收录类别SCI ; EI
语种英语
WOS记录号WOS:000344421900012
公开日期2014-12-16
源URL[http://ir.iscas.ac.cn/handle/311060/16791]  
专题软件研究所_软件所图书馆_期刊论文
推荐引用方式
GB/T 7714
Zhang, Zhiqiang ,Yan, Jun ,Zhao, Yong ,et al. Generating combinatorial test suite using combinatorial optimization[J]. Journal of Systems and Software,2014,98:191-207.
APA Zhang, Zhiqiang ,Yan, Jun ,Zhao, Yong ,&Zhang, Jian .(2014).Generating combinatorial test suite using combinatorial optimization.Journal of Systems and Software,98,191-207.
MLA Zhang, Zhiqiang ,et al."Generating combinatorial test suite using combinatorial optimization".Journal of Systems and Software 98(2014):191-207.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。