Problems and algorithms for covering arrays
暂无分享,去创建一个
[1] Charles J. Colbourn,et al. Covering arrays of strength 3 , 1999 .
[2] Donald L. Kreher,et al. On the state of strength‐three covering arrays , 2002 .
[3] Yu Lei,et al. A Test Generation Strategy for Pairwise Testing , 2002, IEEE Trans. Software Eng..
[4] Brett Stevens,et al. A direct construction of transversal covers using group divisible designs , 2002, Ars Comb..
[5] Michael L. Fredman,et al. The AETG System: An Approach to Testing Based on Combinatiorial Design , 1997, IEEE Trans. Software Eng..
[6] K. A. Bush. A Generalization of a Theorem due to MacNeish , 1952 .
[7] Charles J. Colbourn,et al. Covering Arrays of Strength Three , 1999, Des. Codes Cryptogr..
[8] R DalalSiddhartha,et al. The AETG System , 1997 .
[9] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.
[10] Donald T. Tang,et al. Iterative Exhaustive Pattern Generation for Logic Testing , 1984, IBM J. Res. Dev..
[11] K. A. Bush. Orthogonal Arrays of Index Unity , 1952 .
[12] A. Hartman. Software and Hardware Testing Using Combinatorial Covering Suites , 2005 .
[13] Alfréd Rényi,et al. Foundations of Probability , 1971 .
[14] Alan W. Williams,et al. Determination of Test Configurations for Pair-Wise Interaction Coverage , 2000, TestCom.
[15] E. Mendelsohn,et al. New recursive methods for transversal covers , 1999 .
[16] G. Roux. K-proprietes dans des tableaux de n colonnes : cas particulier de la k-surjectivite et de la k-permutivite , 1987 .
[17] D. West. Introduction to Graph Theory , 1995 .
[18] 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).