Improved quality of protocol testing through techniques of experimental design

Burroughs, K.; Erickson, Robert

doi:10.1109/icc.1994.368821

Cited by 43 publications

(30 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Except for a few instances ( [2], [3], [4], [5], [6] [9], [10]), the results have not generally been applied to the testing of software. Areas where these techniques are often used to detect interactions are in chemical, biological, and medical research.…”

Section: Applying Statistical Experimental Design To Software Testingmentioning

confidence: 99%

“…R(n 2 -n,n,n,d) has n 2 -n rows and n x d columns. Figure 2 shows an example of an orthogonal array 0 (9,4,3), and shows a corresponding basic array B (8,4,3,1) and reduced array R (6,3,3,1).…”

Section: Building Blocks For Covering Arraysmentioning

confidence: 99%

“…Notation for large array construction 0(9,4,3) I 0(9,4,3) I 0(9,4,3) 1(9,1) R (6,3,3,4) N(6,3,l) Table 2 indicates that three copies of 0 (9,4,3), and then 1(9,1) are to be concatenated horizontally. Below the three copies of 0 (9,4,3), the array R (6,3,3,4) is to be concatenated vertically, and below the array 1(9,1), the array N(6,3,1) is to be concatenated. The resulting large array has 13 columns and 15 rows.…”

Section: Building Blocks For Covering Arraysmentioning

confidence: 99%

“…Suppose we want to construct a covering array for twelve parameters, each of which has three values. As a first stage, start by horizontally concatenating three copies of 0 (9,4,3) (see Table 2). This results in an array with twelve parameters, and three values for each.…”

Section: Constructing Larger Covering Arraysmentioning

confidence: 99%

“…Consider the first column of the first copy of 0 (9,4,3). Because of the orthogonal array construction, pair-wise coverage is achieved with the remaining three columns in that first copy of 0 (9,4,3).…”

Section: Constructing Larger Covering Arraysmentioning

confidence: 99%

See 4 more Smart Citations

Determination of Test Configurations for Pair-Wise Interaction Coverage

Williams

2000

IFIP Advances in Information and Communication Technology

118

View full text Add to dashboard Cite

Section: Applying Statistical Experimental Design To Software Testingmentioning

confidence: 99%

Section: Building Blocks For Covering Arraysmentioning

confidence: 99%

Section: Building Blocks For Covering Arraysmentioning

confidence: 99%

Section: Constructing Larger Covering Arraysmentioning

confidence: 99%

Section: Constructing Larger Covering Arraysmentioning

confidence: 99%

See 3 more Smart Citations

Determination of Test Configurations for Pair-Wise Interaction Coverage

Williams

2000

IFIP Advances in Information and Communication Technology

118

View full text Add to dashboard Cite

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