文章基本信息

标题：Construction of Variable Strength Covering Array for Combinatorial Testing Using a Greedy Approach to Genetic Algorithm
本地全文：下载
作者：Priti Bansal ; Sangeeta Sabharwal ; Nitish Mittal 等
期刊名称：e-Informatica Software Engineering Journal
印刷版ISSN：1897-7979
电子版ISSN：2084-4840
出版年度：2015
卷号：9
期号：1
出版社：Wroclaw University of Technology
摘要：The limitation of time and budget usually prohibits exhaustive testing of interactions between comp onents in a component based software system. Combinatorial testing is a software testing technique that can be used to detect faults in a component based software system caused by the interactions of components in an e.ective and e.cient way. Most of the research in the field of combinatorial testing till now has focused on the construction of optimal covering array (CA) of fixed strength t which covers all t-way interactions among components. The size of CA increases with the increase in strength of testing t, which further increases the cost of testing. However, not all components require higher strength interaction testing. Hence, in a system with k components a technique is required to construct CA of fixed strength t which covers all t-way interactions among k components and all t i -way (where t i > t) interactions between a subset of k components. This is achieved using the variable strength covering array (VSCA). In this paper we propose a greedy based genetic algorithm (GA) to generate optimal VSCA. Experiments are conducted on several benchmark configurations to evaluate the e.ectiveness of the proposed approach.
关键词：combinatorial testing; variable strength covering array; genetic algorithm; ; greedy approach