Title: Towards test suite reduction using maximal frequent data mining concept

Authors: Preethi Harris; Nedunchezhian Raju

Addresses: Department of Information Technology, Sri Ramakrishna Engineering College, Coimbatore 641022, India ' R. Nedunchezhian, KIT – Kalaignarkarunanidhi Institute of Technology, Coimbatore, India

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.

Keywords: software testing; test case selection; test suite optimisation; maximal frequent test sets; data mining; dataflow testing; test requirements; test suite reduction; state-of-the-art algorithms; test metrics; software development.

DOI: 10.1504/IJCAT.2015.071419

International Journal of Computer Applications in Technology, 2015 Vol.52 No.1, pp.48 - 58

Published online: 27 Aug 2015 *

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