¹School of Computer, Nanjing University of Posts and Telecommunications, Nanjing, 210006, China
²State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, China

---

Abstract—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 classic fixed strength combinatorial testing, the variable strength combinatorial testing usually uses less test cases to detect more interaction faults, because it considers the actual interaction relationship in software sufficiently. For a model of variable strength combinatorial testing that has been propose previously, two heuristic algorithms, which are based on one-test-at-a-time greedy strategy, are proposed in this paper to generate variable strength covering arrays as test suites in software testing. Experimental results show that, compared to some existed algorithms and tools, the two proposed algorithms have advantages on both the execution effectiveness and the optimality of the size of generated test suite.

Index Terms—Software testing, combinatorial testing, test generation, interaction relationship, algorithm.

[PDF]

Cite: Ziyuan Wang, Haixiao He, "Generating Variable Strength Covering Array for Combinatorial Software Testing with Greedy Strategy," Journal of Software vol. 8, no. 12, pp. 3173-3181, 2013.