JSE_V8_N2_RP1
Branch Coverage Testing Using Anti-Random Technique
Hasim J. Hasan
Mohammad Alshraideh
Basel A. Mahafzah
Journal on Software Engineering
2230 – 7168
8
2
7
19
Software Testing, White Box Testing; Branch Coverage; Random Test Generation; Anti-Random Test Generation
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.
October - December 2013
Copyright © 2013 i-manager publications. All rights reserved.
i-manager Publications
http://www.imanagerpublications.com/Article.aspx?ArticleId=2534