Title: Markov approach for quantifying the software code coverage using genetic algorithm in software testing

Authors: M. Boopathi; R. Sujatha; C. Senthil Kumar; S. Narasimman; A. Rajan

Addresses: Department of Mathematics, SSN College of Engineering, Kalavakkam, Tamil Nadu, India ' Department of Mathematics, SSN College of Engineering, Kalavakkam, Tamil Nadu, India ' Safety Research Institute, Atomic Energy Regulatory Board, Kalpakkam, Tamil Nadu, India ' Department of Mathematics, SSN College of Engineering, Kalavakkam, Tamil Nadu, India ' Department of Computer Science and Engineering, SSN College of Engineering, Kalavakkam, Tamil Nadu, India

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.

Keywords: software testing; test adequacy; cyclomatic complexity; Markov chain; dd-graph; genetic algorithm.

DOI: 10.1504/IJBIC.2019.101152

International Journal of Bio-Inspired Computation, 2019 Vol.14 No.1, pp.27 - 45

Received: 09 Aug 2016
Accepted: 22 May 2017
Published online: 26 Jul 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article