Summary of Constrained Detecting Arrays: Mathematical Structures for Fault Identification in Combinatorial Interaction Testing

Detecting arrays are mathematical objects designed for identifying faulty interactions in combinatorial interaction testing. Our paper introduces constrained detecting arrays (CDAs), an extension of the detecting arrays. In contrast to detecting arrays, CDAs allow for constraints on parameters. We explored the mathematical properties of CDAs and presented two algorithms for constructing them: one for generating minimum CDAs and another for quicker generation of CDAs. The experimental results demonstrated that the two algorithms offer different advantages in terms of array size and generation time.