Combinatorial testing is a practical and efficientsoftware testing techniques, which could detect the faultsthat triggered by interactions among factors in software.Compared to the classic fixed strength combinatorial testing,the variable strength combinatorial testing usually uses lesstest cases to detect more interaction faults, because itconsiders the actual interaction relationship in softwaresufficiently. For a model of variable strength combinatorialtesting that has been propose previously, two heuristicalgorithms, which are based on one-test-at-a-time greedystrategy, are proposed in this paper to generate variablestrength covering arrays as test suites in software testing.Experimental results show that, compared to some existedalgorithms and tools, the two proposed algorithms haveadvantages on both the execution effectiveness and theoptimality of the size of generated test suite.
展开▼
