Title: Identification and deletion of duplicate subtrees in classification tree for test case reduction

Authors: P. Prema; B. Ramadoss; S.R. Balasundaram

Addresses: Department of Computer Applications, National Institute of Technology, Tiruchirappalli-620015, India ' Department of Computer Applications, National Institute of Technology, Tiruchirappalli-620015, India ' Department of Computer Applications, National Institute of Technology, Tiruchirappalli-620015, India

Abstract: Among the many widely used specification-based testing techniques, classification tree method (CTM) is one of the most acclaimed methods, to generate test cases from the functional specification. While integrating applications, there may be a possibility for the occurrence of duplicates, which affects the performance improvement of integrated applications (IAs). To test such applications, CTM can be used to generate test cases. A classification tree, thus generated for this application may have duplicate subtrees and test cases generated from this classification tree may also have redundant test cases. Thus, the existence of duplicate subtrees affects the quality and effectiveness of the classification tree. This paper concentrates on identifying duplicate subtrees through searching techniques and also proposed an enhanced duplicate terminal subtree deletion algorithm, which helps to reduce the number of redundant test cases. Finally, this paper compares the proposed algorithm with the existing one using case studies.

Keywords: classification tree method; CTM; duplicate subtrees; duplicates; duplicate deletion; duplicate identification; software testing; test case reduction; software development.

DOI: 10.1504/IJISCM.2013.060986

International Journal of Information Systems and Change Management, 2013 Vol.6 No.4, pp.374 - 388

Received: 15 Jul 2013
Accepted: 28 Feb 2014

Published online: 05 Jul 2014 *

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