Covering Arrays Generation Methods Survey

This paper is a survey of methods for covering arrays generation. Covering arrays are used in test data generation for program interfaces with many parameters. The effectiveness and the range of application of these methods are analysed. The algorithms used in these methods are analysed for their time complexity and memory usage. In this paper combinatorial, recursive, greedy algorithms are observed. Several heuristics for reducing the size and the time for construction of covering arrays are observed.

[1]  A. Jefferson Offutt,et al.  Combination testing strategies: a survey , 2005, Softw. Test. Verification Reliab..

[2]  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).

[3]  Tran van Trung,et al.  On t-Covering Arrays , 2004, Des. Codes Cryptogr..

[4]  G. Dueck.  New optimization heuristics , 1993 .

[5]  Myra B. Cohen,et al.  A deterministic density algorithm for pairwise interaction coverage , 2004, IASTED Conf. on Software Engineering.

[6]  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).

[7]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

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

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

[10]  Alan Edelman,et al.  The Mathematics of the Pentium Division Bug , 1997, SIAM Rev..

[11]  Alan W. Williams,et al.  Determination of Test Configurations for Pair-Wise Interaction Coverage , 2000, TestCom.

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

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

[14]  Charles J. Colbourn,et al.  One-test-at-a-time heuristic search for interaction test suites , 2007, GECCO '07.

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

[16]  E. Mendelsohn,et al.  New recursive methods for transversal covers , 1999 .

[17]  Siddhartha R. Dalal,et al.  The Automatic Efficient Test Generator (AETG) system , 1994, Proceedings of 1994 IEEE International Symposium on Software Reliability Engineering.

[18]  Gadiel Seroussi,et al.  Vector sets for exhaustive testing of logic circuits , 1988, IEEE Trans. Inf. Theory.

[19]  Brett Stevens,et al.  Transversal covers and packings , 1998 .

[20]  A. Hartman.  Software and Hardware Testing Using Combinatorial Covering Suites , 2005 .

[21]  Brett Stevens,et al.  A direct construction of transversal covers using group divisible designs , 2002, Ars Comb..

[22]  Clifford Stein,et al.  Introduction to algorithms. Chapter 16. 2nd Edition , 2001 .

[23]  Charles J. Colbourn,et al.  Roux-type constructions for covering arrays of strengths three and four , 2006, Des. Codes Cryptogr..

[24]  Robert L. Probert,et al.  A measure for component interaction test coverage , 2001, Proceedings ACS/IEEE International Conference on Computer Systems and Applications.

[25]  Michael L. Fredman,et al.  The AETG System: An Approach to Testing Based on Combinatiorial Design , 1997, IEEE Trans. Software Eng..

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

[27]  Dennis Shasha,et al.  Products of mixed covering arrays of strength two , 2006 .

[28]  Kari J. Nurmela,et al.  Upper bounds for covering arrays by tabu search , 2004, Discret. Appl. Math..

[29]  Paul Ammann,et al.  Using formal methods to derive test frames in category-partition testing , 1994, Proceedings of COMPASS'94 - 1994 IEEE 9th Annual Conference on Computer Assurance.

[30]  N. Sloane.  Covering arrays and intersecting codes , 1993 .

[31]  Yu Lei,et al.  A Test Generation Strategy for Pairwise Testing , 2002, IEEE Trans. Software Eng..

[32]  Rudolf Lide,et al.  Finite fields , 1983 .

[33]  Curtis Greene.  Sperner Families and Partitions of A Partially Ordered Set , 1975 .

[34]  Anant P. Godbole,et al.  t-Covering Arrays: Upper Bounds and Poisson Approximations , 1996, Combinatorics, Probability and Computing.