Combinatorial test cases with constraints in software systems

Combinatorial testing has become an important approach in software testing, and many algorithms have been developed for generating combinatorial test cases. However, few have considered the constraints between the input parameters. In this paper, we summarize existing combinatorial testing strategies with constraints and propose two novel algorithms, namely, the CCS (construct constraint set) algorithm and the CTWC (combinatorial testing with constraints) algorithm. We first utilize CCS to compute implied constraints, and then facilitate CTWC to generate test cases for the system under test. We evaluate the CCS algorithm using a case study and compare the results of the CTWC algorithm with some existing strategies. Experimental results show that our algorithm outperformed them in terms of the number of test cases.