The Cost of Detection in Interaction Testing

Ryan E. Dougherty ()
Additional contact information
Ryan E. Dougherty: United States Military Academy

A chapter in Optimization, Discrete Mathematics and Applications to Data Sciences, 2025, pp 81-89 from Springer

Abstract: Abstract The analysis of large-scale system behavior remains a challenge; fortunately, combinatorial testing techniques exist for assisting system testers. Covering arrays provide fault coverage, but do not have an efficient algorithm to determine location of faults. Detecting arrays provide both coverage and such an algorithm; however, there exist far fewer construction techniques for them than for covering arrays. In general, more tests are required for detecting arrays than for covering arrays. In this paper we concern ourselves with determining, asymptotically, how many such tests are required. We use the probabilistic method and the Lovász local lemma in conjunction with the Lambert W function to determine upper bounds on the sizes of detecting arrays.

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-78369-2_5

Ordering information: This item can be ordered from
http://www.springer.com/9783031783692

DOI: 10.1007/978-3-031-78369-2_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().