HASHIM J. HASAN, Mohammad Alshraideh, Basel A. Mahafzah

Vol. 8 No. 2

Year: 2013

Issue : Oct-Dec

Title : Branch Coverage Testing Using Anti-Random Technique

Author Name : HASHIM J. HASAN, Mohammad Alshraideh, Basel A. Mahafzah

Synopsis :

Software testing is one of the most important, costly and time consuming phase in software development. Anti-random testing chooses the test case where it's total distance from all previous test cases is the maximum, using the Hamming distance and Cartesian distance as measures of difference. In this paper, the authors present an anti-random technique to achieve high branch coverage in white-box testing, depending on the hypothesis that any two test values with small distance mostly discover the same errors and faults. Experimental results show that anti-random testing yields acceptable results, but the target of branch coverage is not achieved in all cases. We executed the algorithm 60 times over ten different programs, and they found that coverage achieved for eight programs runs with high performance in terms of execution time.

For more details:

imanagerpublications.com