An algorithm for combinatorial interaction testing: definitions and rigorous evaluations

Abstract

Background

Combinatorial Interaction Testing (CIT) approaches have drawn attention of the software testing community to generate sets of smaller, efficient, and effective test cases where they have been successful in detecting faults due to the interaction of several input parameters. Recent empirical studies show that greedy algorithms are still competitive for CIT. It is thus interesting to investigate new approaches to address CIT test case generation via greedy solutions and to perform rigorous evaluations within the greedy context.;

Methods

We present a new greedy algorithm for unconstrained CIT, T-Tuple;