A parallel algorithm for the verification of Covering Arrays

Covering Arrays (CAs) are combinatorial objects that, with a small number of cases, cover a certain level of interaction of a set of parameters. CAs have found application in a variety of fields where interactions among factors need to be identified; some of these fields are biology , agriculture, medicine, and software and hardware testing. In particular, a covering array is anN × k matrix over an alphabetv s.t. eachN × k subset contains at least one time each combination from{0, 1, ..., v − 1}, given a positive integer valuet. The process of ensuring that a CA contains each of thev combinations is called verification of CA. When CAs have many variables or their strength is greater than 3, its verification is computationally very expensive. In this paper we present an algorithm for CA verification and its implementation details in sequential and parallel computing.

[1]  K. A. Bush.  Orthogonal Arrays of Index Unity , 1952 .

[2]  Charles J. Colbourn,et al.  The density algorithm for pairwise interaction testing , 2007, Softw. Test. Verification Reliab..

[3]  Nor Ashidi Mat Isa,et al.  IRPS - An Efficient Test Data Generation Strategy for Pairwise Testing , 2008, KES.

[4]  Donald L. Kreher,et al.  On the state of strength‐three covering arrays , 2002 .

[5]  José Torres-Jiménez,et al.  Simulated Annealing for constructing binary covering arrays of variable strength , 2010, IEEE Congress on Evolutionary Computation.

[6]  Eric R. Ziegel,et al.  Experimental Design for Combinatorial and High Throughput Materials Development , 2003, Technometrics.

[7]  Per Runeson,et al.  Efficient Evaluation of Multifactor Dependent System Performance Using Fractional Factorial Design , 2003, IEEE Trans. Software Eng..

[8]  Jeff Yu Lei,et al.  IPOG: A General Strategy for T-Way Software Testing , 2007, 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07).

[9]  D.M. Cohen,et al.  The Combinatorial Design Approach to Automatic Test Generation , 1996, IEEE Softw..

[10]  Nelson Rangel-Valdez,et al.  Construction of logarithm tables for Galois Fields , 2011 .

[11]  José Torres-Jiménez,et al.  Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three , 2009, Artificial Evolution.

[12]  Violet R. Syrotiuk,et al.  Factor interaction on service delivery in mobile ad hoc networks , 2004, IEEE Journal on Selected Areas in Communications.

[13]  Myra B. Cohen,et al.  Covering Arrays for Efficient Fault Characterization in Complex Configuration Spaces , 2006, IEEE Trans. Software Eng..

[14]  José Torres-Jiménez,et al.  Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach , 2010, COCOA.

[15]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[16]  Jeff Yu Lei,et al.  Practical Combinatorial Testing: Beyond Pairwise , 2008, IT Professional.

[17]  K. Burr,et al.  Combinatorial Test Techniques : Table-based Automation , Test Generation and Code Coverage , 1998 .

[18]  Alan Hartman,et al.  Problems and algorithms for covering arrays , 2004, Discret. Math..

[19]  Charles J. Colbourn,et al.  The density algorithm for pairwise interaction testing: Research Articles , 2007 .

[20]  Brett Stevens,et al.  Group construction of covering arrays , 2005 .

[21]  Myra B. Cohen,et al.  Augmenting simulated annealing to build interaction test suites , 2003, 14th International Symposium on Software Reliability Engineering, 2003. ISSRE 2003..

[22]  C. Colbourn.  Combinatorial aspects of covering arrays , 2006 .

[23]  Myra B. Cohen,et al.  Constructing strength three covering arrays with augmented annealing , 2003, Discret. Math..

[24]  Joel H. Spencer,et al.  Families of k-independent sets , 1973, Discret. Math..

[25]  Yu-Wen Tung,et al.  Automating test case generation for the new generation mission software system , 2000, 2000 IEEE Aerospace Conference. Proceedings (Cat. No.00TH8484).

[26]  Yu Lei,et al.  In-parameter-order: a test generation strategy for pairwise testing , 1998, Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231).

[27]  José Torres-Jiménez,et al.  A Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients , 2010, IBERAMIA.

[28]  Myra B. Cohen,et al.  Covering arrays for efficient fault characterization in complex configuration spaces , 2004, IEEE Transactions on Software Engineering.

[29]  D E Shasha,et al.  Using combinatorial design to study regulation by multiple input signals. A tool for parsimony in the post-genomics era. , 2001, Plant physiology.