To ensure the correctness and quality of a software system, it is desirable to test all possible
combinations of the input parameters under various configurations. But the exhaustive …

A fact that is known both by researchers and by industry professionals is that exhaustive
software testing is impractical. Therefore, one of the most studied activities of software …

Covering array generation (CAG) is the key research problem in combinatorial testing and is
an NP‐complete problem. With the increasing complexity of software under test and the …

Up to now, several useful algorithms have been proposed to generate covering array, which
is one of the branches of combinatorial testing. The main challenge in generating such …

Today, software systems are complex and have many possible configurations. A deficient
software testing process often leads to unfortunate consequences, including data losses …

Today, there are a lot of useful algorithms for covering array (CA) generation, one of the
branches of combinatorial testing. The major CA challenge is the generation of an array with …

Context To improve the quality and correctness of a software product it is necessary to test
different aspects of the software system. Among different approaches for software testing …

To achieve acceptable quality and performance of any software product, it is crucial to
assess various software components in the application. There exist various softwaretesting …

Combinatorial testing is a method that can reduce costs and increase the effectiveness of
software testing for many applications. It is based on constructing test-suites of economical …

Combinatorial testing is a practical and efficient software testing techniques, which could
detect the faults that triggered by interactions among factors in software. Compared to the …