Please use this identifier to cite or link to this item:
Title: Covering Arrays of Strength Four and Software Testing
Dept. of Mathematics
Keywords: Covering arrays
Group action
Software testing
Issue Date: Jun-2015
Publisher: Springer Nature
Citation: Mathematics and Computing, 391–398.
Abstract: A covering array t− CA (n,k,g), of size n, strength t, degree k, and order g, is a k×n array on g symbols such that every t×n subarray contains every t×1 column on g symbols at least once. Covering arrays have been studied for their applications on software testing, hardware testing, drug screening, and in areas where interactions of multiple parameters are to be tested. We define the coverage measure μt(A) of an array A by the ratio between the number of distinct t-tuples contained in the column vectors of A and the total number of t-tuples given by (kt)gt. Given fixed values of t, k, g, and n, our objective is to construct an array A of size atmost n having largest possible coverage measure. This problem is called covering arrays with budget constrains. In this article, we present an algebraic construction method for strength four covering arrays with budget constraints.
Appears in Collections:BOOK CHAPTERS

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.