Constrained locating arrays for combinatorial interaction testing
This work addresses software testing challenges for systems with parameter constraints, but it appears incremental as it builds on existing locating arrays.
The paper tackles the problem of fault localization in software testing for systems with constraints on test parameters by introducing Constrained Locating Arrays (CLAs), which extend ordinary locating arrays to handle such constraints, and proposes an algorithm for constructing CLAs that scales to practical problem sizes.
This paper introduces the notion of Constrained Locating Arrays (CLAs), mathematical objects which can be used for fault localization in software testing. CLAs extend ordinary locating arrays to make them applicable to testing of systems that have constraints on test parameters. Such constraints are common in real-world systems; thus CLA enhances the applicability of locating arrays to practical testing problems. The paper also proposes an algorithm for constructing CLAs. Experimental results show that the proposed algorithm scales to problems of practical sizes.