A variable strength interaction testing of components

Cohen, Myra B.; Gibbons, Peter B.; Mugridge, Warwick B.; Colbourn, Charles J.; Collofello, James

doi:10.1109/cmpsac.2003.1245373

Cited by 74 publications

(105 citation statements)

References 7 publications

Supporting

Mentioning

105

Contrasting

Order By: Relevance

“…We use a notation similar to that of [4,6] to make the comparison easier. CA(t,v i xi ) means there are x i parameters, each with v i values, and t is the testing (or interaction) strength.…”

Section: # Input and Variables Given π = (P I S C)mentioning

confidence: 99%

“…For example, in case 9, in addition to pairwise interactions between each pair of variables, a 3-way interaction among variables V 0 ,V 1 and V 2 is also required. The data in this group is from Cohen et al [4] (average of ten runs) where variable strength is restricted to disjoint sets. 1 For the second group, only the SA algorithm is available for comparison.…”

Section: # Input and Variables Given π = (P I S C)mentioning

confidence: 99%

“…In most of this work the focus has been to construct a CIT sample using a model that has a single interaction strength across all parameters of the problem. Two primary algorithm types have been used for CIT sample generation -greedy methods [3,8,17] and meta-heuristic search [4,5]. Other techniques use direct or recursive mathematical constructions (see [15] for a survey).…”

Section: Related Workmentioning

confidence: 99%

“…1 For the second group, only the SA algorithm is available for comparison. We use the benchmarks that were created to measure it [4]. In case 7 through 9, where there are a small number of parameters -less than 10-our approach sometimes generates a solution comparable in size to that of SA, in less than 1 second.…”

Section: # Input and Variables Given π = (P I S C)mentioning

confidence: 99%

“…for the closure check, which only needs to be performed on those interactions which have new solutions, and only at the end of each partition processing. (5,6), (4,6), (0,7), (2,3), (2,8), (1,5,8 (4,20), (15,19), (8,20), (7,14 Many tools [3,4,5,17] are available to generate t-wise CIT samples, where t is fixed between all parameter interactions, and is usually equal to 2 or 3. Some of these are also able to handle certain types of constraints expressed as "exclusions": specific value combinations that must not occur in the sample.…”

Section: # Input and Variables Given π = (P I S C)mentioning

confidence: 99%

See 4 more Smart Citations

Interaction Coverage Meets Path Coverage by SMT Constraint Solving

Grieskamp

Wei

et al. 2009

Testing of Software and Communication Systems

View full text Add to dashboard Cite

Abstract. We present a novel approach for generating interaction combinations based on SMT constraint resolution. Our approach can generate maximal interaction coverage in the presence of general constraints as supported by the underlying solver. It supports seeding with general predicates, which allows us to combine it with path exploration such that both interaction and path coverage goals can be met. Our approach is motivated by the application to behavioral model-based testing in the Spec Explorer tool, where parameter combinations must be generated such that all path conditions of a model action have at least one combination which enables the path. It is applied in a large-scale project for model-based quality assurance of interoperability documentation at Microsoft.

show abstract

Section: # Input and Variables Given π = (P I S C)mentioning

confidence: 99%

Section: # Input and Variables Given π = (P I S C)mentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: # Input and Variables Given π = (P I S C)mentioning

confidence: 99%

Section: # Input and Variables Given π = (P I S C)mentioning

confidence: 99%

See 3 more Smart Citations

Interaction Coverage Meets Path Coverage by SMT Constraint Solving

Grieskamp

Wei

et al. 2009

Testing of Software and Communication Systems

View full text Add to dashboard Cite

show abstract

Products of mixed covering arrays of strength two

Colbourn

Martirosyan

Mullen

et al. 2005

J of Combinatorial Designs

107

View full text Add to dashboard Cite

A covering array CAðN; t; k; v vÞ is an N Â k array such that every N Â t subarray contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. The particular case when t ¼ 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple ''cut-and-paste'' construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t ¼ 2 is derived.

show abstract

Variable strength covering arrays

Raaphorst

Moura

Stevens

2018

J of Combinatorial Designs

View full text Add to dashboard Cite

Recently, covering arrays have been the subject of considerable research attention as they hold both theoretical interest and practical importance due to their applications to testing. In this thesis, we perform the first comprehensive study of a generalization of covering arrays called variable strength covering arrays, where we dictate the interactions to be covered in the array by modeling them as facets of an abstract simplicial complex.We outline the necessary background in the theory of hypergraphs, combinatorial testing, and design theory that is relevant to the study of variable strength covering arrays. We then approach questions that arise in variable strength covering arrays in a number of ways. We demonstrate their connections to hypergraph homomorphisms, and explore the properties of a particular family of abstract simplicial complexes, the qualitative independence hypergraphs. These hypergraphs are tightly linked to variable strength covering arrays, and we determine and identify several of their important properties and subhypergraphs.We give a detailed study of constructions for variable strength covering arrays, and provide several operations and divide-and-conquer techniques that can be used in building them. In addition, we give a construction using linear feedback shift registers from primitive polynomials of degree 3 over arbitrary finite fields to find variable strength covering arrays, which we extend to strength-3 covering arrays whose sizes are smaller than many of the best known sizes of covering arrays.We then give an algorithm for creating variable strength covering arrays over arbitrary abstract simplicial complexes, which builds the arrays one row at a time, using a density concept to guarantee that the size of the resultant array is asymptotic in the logarithm of the number of facets in the abstact simplicial complex. This algorithm is of immediate practical importance, as it can be used to create test suites for combinatorial testing.Finally, we use the Lovász Local Lemma to nonconstructively determine upper bounds on the sizes of arrays for a number of different families of hypergraphs. We lay out a framework that can be used for many hypergraphs, and then discuss possible strategies that can be taken in asymmetric problems.ii Acknowledgements This thesis certainly could not have been completed without the help of many people.Firstly and most importantly, I would like to extend my immeasurable thanks to both of my supervisors, Lucia Moura and Brett Stevens. As a lowly undergraduate student many years ago, I had the extreme fortune of being chosen to serve as a teaching assistant to work with Lucia Moura. I could never have predicted that that was to be the first step on a long and rewarding journey into academia. Through all the opportunities she gave me, I caught her infectious enthusiasm for research and had my eyes opened to the wonderful fields of design theory and covering arrays. Without her endless patience and compassion with my quirkiness, this thesis would never...

show abstract

A variable strength interaction testing of components

Abstract: Abstract

Cited by 74 publications

References 7 publications

Interaction Coverage Meets Path Coverage by SMT Constraint Solving

Interaction Coverage Meets Path Coverage by SMT Constraint Solving

Products of mixed covering arrays of strength two

Variable strength covering arrays

Contact Info

Product

Resources

About