Effectively computing high strength mixed covering arrays with constraints

Covering arrays have become a key piece in Combinatorial Testing. In particular, we focus on the efficient construction of Covering Arrays with Constraints of high strength. SAT solving technology has been proven to be well suited when solving Covering Arrays with Constraints. However, the size of the SAT reformulations rapidly grows up with higher strengths. To this end, we present a new incomplete algorithm that mitigates substantially memory blow-ups and its parallel version that allows reducing run-time consumption. Thanks to these new developments we provide a tool for Combinatorial Testing in practical environments. The experimental results confirm the goodness of the approach, opening avenues for new practical applications.

Automated summary

This paper presents an incomplete algorithm for efficiently constructing Covering Arrays with Constraints of high strength. The algorithm mitigates memory blow-ups and reduces run-time consumption, providing a practical tool for Combinatorial Testing.