Application of particle swarm optimisation for coverage estimation in software testing Online publication date: Tue, 23-Feb-2021
by M. Boopathi; R. Sujatha; C. Senthil Kumar
International Journal of Computational Science and Engineering (IJCSE), Vol. 23, No. 4, 2020
Abstract: A Markov approach for test case generation and code coverage estimation using particle swarm optimisation technique is proposed. Initially, the DD-graph is taken from control flow graph of the software code by joining decision to decision. The DD-graph identifies the sequences of independent paths using c-uses and p-uses based on set theory approach and compared to cyclomatic complexity. Automatic test cases are generated and the nature of test cases are integer, float and Boolean variables. Using this initial test suite, the code coverage summary is generated using gcov code coverage analysis tool, the branch probability percentage is considered as TPM values with respect to each branch in the DD-graph. Path coverage is used as a fitness function which is the product of node coverage and TPM values. Iterate this algorithm until reaches 100% code coverage among each independent test path. The randomness of the proposed approach is compared to genetic algorithm.
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 Computational Science and Engineering (IJCSE):
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