Towards test suite reduction using maximal frequent data mining concept
by Preethi Harris; Nedunchezhian Raju
International Journal of Computer Applications in Technology (IJCAT), Vol. 52, No. 1, 2015

Abstract: All the industries are going through a revolution where software has become an essential component. Software testing is important to produce more reliable systems. Over the years this testing activity has evolved into a major resource consumer and cost driver for the software industries. This invariably leads to the addressing of key issues for efficient test case selection and managing test suite size. In this paper, a data mining-based algorithm has been proposed to address the issue of test suite optimisation. This algorithm focuses on selecting maximal frequent test sets for dataflow testing with Define Use (DU) pairs as requirements. Experimentation has been carried out to compare the relative performance and effectiveness of the proposed test suite reduction algorithm with the state-of-the-art algorithms: Harrold Gupta and Soffa (HGS) and Bi-Objective Greedy (BOG) using test metrics.

Online publication date: Thu, 27-Aug-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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