Premium
Lower bounds estimation of factor‐covering design sizes
Author(s) -
Ido Nobuhiko,
Kikuno Tohru
Publication year - 2003
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.10039
Subject(s) - range (aeronautics) , factor (programming language) , mathematics , test (biology) , software , estimation , combinatorics , statistics , algorithm , computer science , engineering , programming language , biology , aerospace engineering , paleontology , systems engineering
Factor‐covering designs have been studied with the aim of making efficient suites of test cases for software testing. One of the major concerns in these studies is the construction of factor‐covering designs of smaller sizes. In this paper, we propose a method of estimating the lower bounds of the sizes. The proposed method is based on two assumptions that a test design has parameters of the same range, and that all the values in the range are tested equally. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 89–99, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10039