Problems and algorithms for covering arrays
作者： Alan Hartman , Leonid Raskin
DOI: 10.1016/J.DISC.2003.11.029
关键词:
摘要: Covering arrays are combinatorial structures which extend the notion of orthogonal and have applications in realm software testing. In this paper we raise several new problems motivated by these discuss algorithms for their solution.
core.ac.uk
acm.org
elsevier.com
sci-hub.se 参考文章(15)
Brett Stevens, Eric Mendelsohn, Alan C. H. Ling, A direct construction of transversal covers using group divisible designs. Ars Combinatoria. ,vol. 63, ,(2002)
Gilbert Roux, K-proprietes dans des tableaux de n colonnes : cas particulier de la k-surjectivite et de la k-permutivite Paris 6. ,(1987)
Douglas Brent West, Introduction to Graph Theory ,(1995)
Alan Hartman, Software and Hardware Testing Using Combinatorial Covering Suites Springer, Boston, MA. pp. 237- 266 ,(2005) , 10.1007/0-387-25036-0_10
Alan W. Williams, Determination of Test Configurations for Pair-Wise Interaction Coverage TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques. pp. 59- 74 ,(2000) , 10.1007/978-0-387-35516-0_4
Yu Lei, K.C. Tai, In-parameter-order: a test generation strategy for pairwise testing high assurance systems engineering. pp. 254- 261 ,(1998) , 10.1109/HASE.1998.731623
CRC Handbook of Combinatorial Designs Journal of the American Statistical Association. ,vol. 92, pp. 800- ,(1996) , 10.1201/9781420049954
Brett Stevens, Eric Mendelsohn, New recursive methods for transversal covers Journal of Combinatorial Designs. ,vol. 7, pp. 185- 203 ,(1999) , 10.1002/(SICI)1520-6610(1999)7:3<185::AID-JCD3>3.0.CO;2-3
K. A. Bush, A Generalization of a Theorem due to MacNeish Annals of Mathematical Statistics. ,vol. 23, pp. 293- 295 ,(1952) , 10.1214/AOMS/1177729449
M. Chateauneuf, D. L. Kreher, On the state of strength-three covering arrays Journal of Combinatorial Designs. ,vol. 10, pp. 217- 238 ,(2002) , 10.1002/JCD.10002