A random search based effective algorithm for pairwise test data generation
Testing is a very important task to build error free software. As the resources and time to market is limited for a software product, it is impossible to perform exhaustive test i.e., to test all combinations of input data. To reduce the number of test cases in an acceptable level, it is preferable...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2011
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/26203/ http://umpir.ump.edu.my/id/eprint/26203/ http://umpir.ump.edu.my/id/eprint/26203/1/A%20Random%20search%20based%20effective%20algorithm%20for%20pairwise%20test%20data%20generation.pdf |
| Summary: | Testing is a very important task to build error free software. As the resources and time to market is limited for a software product, it is impossible to perform exhaustive test i.e., to test all combinations of input data. To reduce the number of test cases in an acceptable level, it is preferable to use higher interaction level (t way, where t ≥ 2). Pairwise (2-way or t = 2) interaction can find most of the software faults. This paper proposes an effective random search based pairwise test data generation algorithm named R2Way to optimize the number of test cases. Java program has been used to test the performance of the algorithm. The algorithm is able to support both uniform and non-uniform values effectively with performance better than the existing algorithms/tools in terms of number of generated test cases and time consumption. |
|---|