Results 1  10
of
2,111
Problems and algorithms for covering arrays
, 2004
"... Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution. ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.
Covering arrays and intersecting codes
 JOURNAL OF COMBINATORIAL DESIGNS
, 1993
"... A tcovering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t. The case t = 2 was solved by Rkn ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
A tcovering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t. The case t = 2 was solved
Combinatorial aspects of covering arrays
 LE MATEMATICHE (CATANIA
, 2004
"... Covering arrays generalize orthogonal arrays by requiring that ttuples be covered, but not requiring that the appearance of ttuples be balanced. Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among fact ..."
Abstract

Cited by 35 (9 self)
 Add to MetaCart
Covering arrays generalize orthogonal arrays by requiring that ttuples be covered, but not requiring that the appearance of ttuples be balanced. Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among
Group construction of covering arrays
 Journal of Combinatorial Designs
"... This project will look at a construction of strength 3 covering arrays developed by Chateauneuf, Colburn and Kreher. This construction uses a subarray of a covering array and a group action on that subarray. 1 Introduction and Denitions Covering arrays are very interesting and useful designs that ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
This project will look at a construction of strength 3 covering arrays developed by Chateauneuf, Colburn and Kreher. This construction uses a subarray of a covering array and a group action on that subarray. 1 Introduction and Denitions Covering arrays are very interesting and useful designs
Cover array string reconstruction
"... Abstract. A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer array C is the minimalcover (resp. maximalcover) array of y if C[i] is the minimal (resp. maximal) length of cov ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer array C is the minimalcover (resp. maximalcover) array of y if C[i] is the minimal (resp. maximal) length
Covering Arrays of Strength Three
 Des. Codes Cryptogr
, 1998
"... A covering array of size N , degree k, order v and strength t is a k \Theta N array with entries from a set of v symbols such that in any t \Theta N subarray every t \Theta 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
A covering array of size N , degree k, order v and strength t is a k \Theta N array with entries from a set of v symbols such that in any t \Theta N subarray every t \Theta 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing
Mixed Covering Arrays on Graphs
"... Abstract. We give upper and lower bounds on the size of mixed covering arrays on graphs based on graph homomorphisms. We provide constructions for covering arrays on graphs based on basic graph operations. In particular, we construct optimal mixed covering arrays on trees, cycles and bipartite graph ..."
Abstract
 Add to MetaCart
Abstract. We give upper and lower bounds on the size of mixed covering arrays on graphs based on graph homomorphisms. We provide constructions for covering arrays on graphs based on basic graph operations. In particular, we construct optimal mixed covering arrays on trees, cycles and bipartite
Sequence covering arrays
, 2013
"... Sequential processes can encounter faults as a result of improper ordering of subsets of the events. In order to reveal faults caused by the relative ordering of t or fewer of v events, for some fixed t, a test suite must provide tests so that every ordering of every set of t or fewer events is exe ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
is exercised. Such a test suite is equivalent to a sequence covering array, a set of permutations on v events for which every subsequence of t or fewer events arises in at least one of the permutations. Equivalently it is a (different) set of permutations, a completely tscrambling set of permutations
NonIsomorphic Generation of Covering Arrays
, 2002
"... This paper presents an algorithm which finds all nonisomorphic covering arrays of a given size on a binary alphabet. The algorithm is an implementation of a backtracking procedure which generates all covering arrays (with the given parameters) and rejects noncanonical arrays. Important in this al ..."
Abstract
 Add to MetaCart
This paper presents an algorithm which finds all nonisomorphic covering arrays of a given size on a binary alphabet. The algorithm is an implementation of a backtracking procedure which generates all covering arrays (with the given parameters) and rejects noncanonical arrays. Important
Profiles of covering arrays of strength two
, 2013
"... Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays ..."
Abstract
 Add to MetaCart
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays
Results 1  10
of
2,111