Cargando…
Refining the In-Parameter-Order Strategy for Constructing Covering Arrays
Covering arrays are structures for well-representing extremely large input spaces and are used to efficiently implement blackbox testing for software and hardware. This paper proposes refinements over the In-Parameter-Order strategy (for arbitrary t). When constructing homogeneous-alphabet covering...
Autores principales: | Forbes, Michael, Lawrence, Jim, Lei, Yu, Kacker, Raghu N., Kuhn, D. Richard |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
[Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology
2008
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4652878/ https://www.ncbi.nlm.nih.gov/pubmed/27096128 http://dx.doi.org/10.6028/jres.113.022 |
Ejemplares similares
-
Taguchi’s Orthogonal Arrays Are Classical Designs of Experiments
por: Kacker, Raghu N., et al.
Publicado: (1991) -
Introduction to combinatorial testing
por: Kuhn, D Richard, et al.
Publicado: (2013) -
True value and uncertainty in the GUM
por: Kacker, Raghu
Publicado: (2018) -
Optimal shortening of uniform covering arrays
por: Torres-Jimenez, Jose, et al.
Publicado: (2017) -
A Survey of Tables of Probability Distributions
por: Kacker, Raghu, et al.
Publicado: (2005)