Combinatorial test design in practice
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2
Evaluating improvements to a meta-heuristic search for constrained interaction testing
Empirical Software Engineering
Proceedings of the 33rd International Conference on Software Engineering
A metaheuristic approach to test sequence generation for applications with a GUI
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
T-wise combinatorial interaction test suites construction based on coverage inheritance
Software Testing, Verification & Reliability
| Hi-index | 0.00 |
Combinatorial interaction testing (CIT) is a cost-effective sampling technique for discovering interaction faults in highly configurable systems. Recent work with greedy CIT algorithms efficiently supports constraints on the features that can coexist in a configuration. But when testing a single system configuration is expensive, greedy techniques perform worse than meta-heuristic algorithms because they produce larger samples. Unfortunately, current meta-heuristic algorithms are inefficient when constraints are present.We investigate the sources of inefficiency, focusing on simulated annealing, a well-studied meta-heuristic algorithm. From our findings we propose changes to improve performance, including a reorganized search space based on the CIT problem structure. Our empirical evaluation demonstrates that the optimizations reduce run-time by three orders of magnitude and yield smaller samples. Moreover, on real problems the new version compares favorably with greedy algorithms.