Locating and Detecting Arrays for Interaction Faults

The identification of interaction faults in component-based systems has focused on indicating the presence of faults, rather than their location and magnitude. While this is a valuable step in screening a system for interaction faults prior to its release, it provides little information to assist in the correction of such faults. Consequently tests to reveal the location of interaction faults are of interest. The problem of nonadaptive location of interaction faults is formalized under the hypothesis that the system contains (at most) some number d of faults, each involving (at most) some number t of interacting factors. Restrictions on the number and size of the putative faults lead to numerous variants of the basic problem. The relationships between this class of problems and interaction testing using covering arrays to indicate the presence of faults, designed experiments to measure and model faults, and combinatorial group testing to locate faults in a more general testing scenario, are all examined. While each has some definite similarities with the fault location problems for component-based systems, each has some striking differences as well. In this paper, we formulate the combinatorial problems for locating and detecting arrays to undertake interaction fault location. Necessary conditions for existence are established, and using a close connection to covering arrays, asymptotic bounds on the size of minimal locating and detecting arrays are established. A final version of this paper appears in J Comb Optim (2008) 15: 17-48

Moving forward with combinatorial interaction testing

Combinatorial interaction testing (CIT) is an efficient and effective method of detecting failures that are caused by the interactions of various system input parameters. In this paper, we discuss CIT, point out some of the difficulties of applying it in practice, and highlight some recent advances that have improved CIT’s applicability to modern systems. We also provide a roadmap for future research and directions; one that we hope will lead to new CIT research and to higher quality testing of industrial systems

Screening interacting factors in a wireless network testbed using locating arrays

Wireless systems exhibit a wide range of configurable parameters (factors), each with a number of values (levels), that may influence performance. Exhaustively analyzing all factor interactions is typically not feasible in experimental systems due to the large design space. We propose a method for determining which factors play a significant role in wireless network performance with multiple performance metrics (response variables). Such screening can be used to reduce the set of factors in subsequent experimental testing, whether for modelling or optimization. Our method accounts for pairwise interactions between the factors when deciding significance, because interactions play a significant role in real-world systems. We utilize locating arrays to design the experiment because they guarantee that each pairwise interaction impacts a distinct set of tests. We formulate the analysis as a problem in compressive sensing that we solve using a variation of orthogonal matching pursuit, together with statistical methods to determine which factors are significant. We evaluate the method using data collected from the w-iLab.t Zwijnaarde wireless network testbed and construct a new experiment based on the first analysis to validate the results. We find that the analysis exhibits robustness to noise and to missing data

Locating one pairwise interaction: Three recursive constructions

In a complex component-based system, choices (levels) for components (factors) may interact to cause faults in the system behaviour. When faults may be caused by interactions among few factors at specific levels, covering arrays provide a combinatorial test suite for discovering the presence of faults. While well studied, covering arrays do not enable one to determine the specific levels of factors causing the faults; locating arrays ensure that the results from test suite execution suffice to determine the precise levels and factors causing faults, when the number of such causes is small. Constructions for locating arrays are at present limited to heuristic computational methods and quite specific direct constructions. In this paper three recursive constructions are developed for locating arrays to locate one pairwise interaction causing a fault