Title: Software test effort estimation: a model based on cuckoo search

Authors: Praveen Ranjan Srivastava; Abhishek Varshney; Priyanka Nama; Xin-She Yang

Addresses: Department of Computer Science and Information Systems, Birla Institute of Technology and Science (BITS), Pilani, Vidya Vihar Campus, Pilani-333031, Rajasthan, India. ' Department of Computer Science and Information Systems, Birla Institute of Technology and Science (BITS), Pilani, Vidya Vihar Campus, Pilani-333031, Rajasthan, India. ' Department of Computer Science and Information Systems, Birla Institute of Technology and Science (BITS), Pilani, Vidya Vihar Campus, Pilani-333031, Rajasthan, India. ' Department of Engineering, University of Cambridge, Trumpington Street, Cambridge CB2 1PZ, UK

Abstract: Test effort estimation is the process of predicting effort for testing the software. It has always been a fascinating area for software engineering researchers. "How long will it take to test the system?" is the most promising question in minds of testers before the testing process actually starts. Many factors such as the productivity of the test team, strategy chosen for testing, the size and complexity of the system, technical factors, and expected quality can affect test effort estimation. Testing requires a good amount of time and effort in the entire software development life cycle. Several researches have attempted to develop test effort estimation models but still it is not possible to achieve accurate forecasting. A new model based on a metaheuristic technique called, cuckoo search, for estimating the test effort is proposed in this paper. The proposed model is used to assign weights to the various factors involved based on past results, and, is then used for predicting the test effort for new projects of similar kind.

Keywords: test effort estimation; cuckoo search; use case points analysis; exponential moving average; software engineering; software testing; metaheuristics.

DOI: 10.1504/IJBIC.2012.049888

International Journal of Bio-Inspired Computation, 2012 Vol.4 No.5, pp.278 - 285

Received: 17 Jan 2012
Accepted: 20 May 2012
Published online: 22 Sep 2014 *

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