PWiseGen: Generating test cases for pairwise testing using genetic algorithms

Pairwise testing is a combinatorial testing technique that tests all possible pairs of input values. Although, finding a smallest set of test cases for pairwise testing is NP-complete, pairwise testing is regarded as a reasonable cost-benefit compromise among combinatorial testing methods. In this p...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 IEEE International Conference on Computer Science and Automation Engineering Ročník 2; s. 747 - 752
Hlavní autoři: Flores, P., Yoonsik Cheon
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2011
Témata:
Browsers
combinatorial testing
Copper
genetic algorithms
pairwise testing
software testing
test coverage
XML
ISBN:9781424487271, 1424487277
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Pairwise testing is a combinatorial testing technique that tests all possible pairs of input values. Although, finding a smallest set of test cases for pairwise testing is NP-complete, pairwise testing is regarded as a reasonable cost-benefit compromise among combinatorial testing methods. In this paper we formulate the problem of finding a pairwise test set as a search problem and apply a genetic algorithm to solve it. We also describe an open-source tool called PWiseGen for generating pairwise test sets. PWiseGen produces competitive results compared with existing pairwise testing tools. Besides, it provides a framework and a research platform for generating pairwise test sets using genetic algorithms; it is configurable, extensible, and reusable.
ISBN:9781424487271
1424487277
DOI:10.1109/CSAE.2011.5952610