## Abstract A __covering array__ of __size__ __N__, __strength__ __t__, __degree k__, and __order__ Ο is a __kβΓβN__ array on Ο symbols in which every __tβΓβN__ subarray contains every possible __t__βΓβ1 column at least once. We present explicit constructions, constructive upper bounds on the size
The Strengths of Some Violations of Covering
β Scribed by Heike Mildenberger
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 152 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A __covering array__ __CA__(__N__;__t__,__k__, __v__ is an __N__βΓβ__k__ array such that every __N__βΓβ__t__ subarray 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 t
## Abstract A __covering array__ __CA(N;t,k,v)__ is an __NβΓβk__ array such that every __NβΓβ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