An Efficient Technique to Test Suite Minimization using Hierarchical Clustering Approach
Fayaz Ahmad Khan1, Anil Kumar Gupta2, Dibya Jyoti Bora3
1Fayaz Ahmad Khan, Department of Computer Science and Applications, Barkatullah University Bhopal, (M.P) India.
2Anil Kumar Gupta, Department of Computer Science and Applications, Barkatullah University Bhopal, (M.P) India.
3Dibya Jyoti Bora, Department of Computer Science and Applications, Barkatullah University Bhopal, (M.P) India.
Manuscript received on September 01, 2015. | Revised Manuscript received on September 02, 2015. | Manuscript published on September 25, 2015. | PP:1-9 | Volume-3 Issue-11, September 2015. | Retrieval Number: K10300931115
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Software testing is a pervasive activity in software development. Testing is widely used to reveal bugs in real software development and is also an expensive task. Testing is expensive due to the fact that it takes very long time to execute the whole test suite. The initial test suite is very large in size and has redundant test cases. So it is necessary to apply some selective techniques in order to reduce the large size of the initial test suite to a manageable size and make it feasible for practical execution. In this study, Hierarchical clustering approach is presented and implemented on the initially generated test suite in order to reduce its size and partition it, into a fixed number of clusters. Here, a branch coverage criterion is selected as the code coverage criteria and for the determination of the number of clusters.
Keywords: Software Testing, Test suite Minimization, Data Clustering, Hierarchical Clustering.