An orchestrated survey of available algorithms and tools for Combinatorial Testing
Technical Report SCE-14-03
For functional testing based on the input domain of a functionality, parameters and their values are identified and a test suite is generated using a criterion exercising combinations of those parameters and values. Since software systems are large, resulting in large numbers of parameters and values, a technique based on combinatorics called Combinatorial Testing (CT) is used to automate the process of creating those combinations. CT is typically performed with the help of combinatorial objects called Covering Arrays. The goal of the present work is to determine available algorithms/tools for generating a combinatorial test suite. We tried to be as complete as possible by using a precise protocol for selecting papers describing those algorithms/tools. The 75 algorithms/tools we identified are then categorized on the basis of different comparison criteria, including: the test suite generation technique, the support for selection (combination) criteria, mixed covering array, the strength of coverage, and the support for constraints between parameters. Results can be of interest to researchers or software companies who are looking for a CT algorithm/tool suitable for their needs.
|Keywords||Combinatorial testing, Covering arrays, strength of testing, algorithms, Category-partition|
|Publisher||Department of Systems and Computer Engineering|
|Series||SCE Technical Reports|
Khalsa, Sunint Kaur, & Labiche, Y. (2014). An orchestrated survey of available algorithms and tools for Combinatorial Testing. SCE Technical Reports. Department of Systems and Computer Engineering.