Efficiency and early fault detection with lower and higher strength combinatorial interaction testing

Combinatorial Interaction Testing (CIT) is important be-cause it tests the interactions between the many features and parameters that make up the configuration space of software systems. However, in order to be practically appli-cable, it must be able to cater for soft and hard real-world constraints and should, ideally, report a test priority order that maximises earliest fault detection. We show that we can achieve the highest strength CIT in 5.65 minutes on average. This was previously thought to be too computa-tionally expensive to be feasible. Furthermore, we show that higher strength suites find more faults, while prioritisations using lower strengths are no worse at achieving early fault revelation