Markov approach for quantifying the software code coverage using genetic algorithm in software testing Online publication date: Fri, 26-Jul-2019
by M. Boopathi; R. Sujatha; C. Senthil Kumar; S. Narasimman; A. Rajan
International Journal of Bio-Inspired Computation (IJBIC), Vol. 14, No. 1, 2019
Abstract: Markov chain approach to quantify the coverage of dd-graph representing the software code using genetic algorithm (GA) is presented in this paper. Initially the dd-graph is captured from the control flow graph. In this technique, test software code coverage is carried out by applying GA through sufficient number of feasible linearly independent paths. These paths have been decided in a software code depending on computational uses and predicate uses. Automatic test cases have been produced for the three mixed data type variables namely, integer, float, Boolean and GA is applied. Transition probability of the Markov chain is attained from gcov coverage analysis tool of the initial test suite. Fitness function of GA is measured using path coverage metric; as the product of node coverage and TPM values. Highest fitness value represent the most critical paths among these independent paths with aim to increase testing efficiency of the software code.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook