ASU Electronic Theses and Dissertations
- 1 English
- 1 Public
Exhaustive testing is generally infeasible except in the smallest of systems. Research has shown that testing the interactions among fewer (up to 6) components is generally sufficient while retaining the capability to detect up to 99% of defects. This leads to a substantial decrease in the number of tests. Covering arrays are combinatorial objects that guarantee that every interaction is tested at least once. In the absence of direct constructions, forming small covering arrays is generally an expensive computational task. Algorithms to generate covering arrays have been extensively studied yet no single algorithm provides the smallest solution. More recently research …
- Karia, Rushang Vinod, Colbourn, Charles J, Syrotiuk, Violet, et al.
- Created Date