Algorithmic Optimizations for Deriving Minimal Forbidden Tuples

The computation of minimal forbidden tuples (MFTs) is an essential method for constraint validation during the generation of constrained combinatorial test sets. In this paper, we propose an algorithmic optimization for MFT derivation and prove its correctness. Our argumentation also shows that it is invariant under different orderings in which the parameters of the IPM are processed. We illustrate the algorithm’s potential by means of an experimental evaluation, examining different parameter orderings and comparing it with the previous approach.