Covering arrays of higher strength from permutation vectors

被引:43
作者
Sherwood, GB
Martirosyan, SS
Colbourn, CJ
机构
[1] Testcover Com LLC, Colts Neck, NJ 07722 USA
[2] Arizona State Univ, Dept Comp Sci & Engn, Tempe, AZ 85287 USA
关键词
covering array; orthogonal array; perfect hash family; permutation vector;
D O I
10.1002/jcd.20067
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A covering array CA (N; t, k, v) is an N x k array such that every N x t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. We introduce a combinatorial technique for their construction, focussing on covering arrays of strength 3 and 4. With a computer search, covering arrays with improved parameters have been found. (C) 2005 Wiley Periodicals, Inc.
引用
收藏
页码:202 / 213
页数:12
相关论文
共 15 条
[1]  
Bierbrauer J, 2000, LECT NOTES COMPUT SC, V1880, P533
[2]   On the state of strength-three covering arrays [J].
Chateauneuf, M ;
Kreher, DL .
JOURNAL OF COMBINATORIAL DESIGNS, 2002, 10 (04) :217-238
[3]   Covering arrays of strength three [J].
Chateauneuf, MA ;
Colbourn, CJ ;
Kreher, DL .
DESIGNS CODES AND CRYPTOGRAPHY, 1999, 16 (03) :235-242
[4]   The AETG system: An approach to testing based on combinatorial design [J].
Cohen, DM ;
Dalal, SR ;
Fredman, ML ;
Patton, GC .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1997, 23 (07) :437-444
[5]  
COHEN MB, IN PRESS AUGMENTED S
[6]  
COLBOURN CJ, IN PRESS J COMBIN A
[7]  
COLBOURN CJ, IN PRESS MATEMATICHE
[8]  
GODBOLE AP, 1966, COMBINATORICS PROBAB, V5, P105
[9]   Problems and algorithms for covering arrays [J].
Hartman, A ;
Raskin, L .
DISCRETE MATHEMATICS, 2004, 284 (1-3) :149-156
[10]  
HARTMAN A, IN PRESS GRAPH THEOR