Finding Representative Test Case for Test Case Reduction in Regression Testing

Full Text (PDF, 1228KB), PP.60-65

Views: 0 Downloads: 0


Sudhir Kumar Mohapatra 1,* Srinivas Prasad 2

1. SOA University, Bhubaneswar, Odisha, India

2. Dept. of Computer Science &Engineering, GMR Institute of Technology, Andhra Pradesh

* Corresponding author.


Received: 20 Feb. 2015 / Revised: 17 May 2015 / Accepted: 25 Jul. 2015 / Published: 8 Oct. 2015

Index Terms

Genetic Algorithm, Software testing, Test suite reduction, Test suite minimization


Software testing is one of the important stages of software development. In software development, developers always depend on testing to reveal bugs. In the maintenance stage test suite size grow because of integration of new technique. An addition of new technique force to create new test case which increase the size of test suite. In regression testing new test case may be added to the test suite during the whole testing process. These additions of test cases create possibility of presence of redundant test cases. Due to limitation of time and resource, reduction techniques should be used to identify and remove them. Research shows that a subset of the test case in a suit may still satisfy all the test objectives which is called as representative set. Redundant test case increase the execution cost of the test suite, in spite of NP-completeness of the problem there are few good reduction techniques have been available. In this paper a new approach for test case reduction is proposed. This algorithm use genetic algorithm technique iteratively with varying chromosome length to reduce test case in a test suit by finding a representative set of test cases that are fulfill the testing criteria.

Cite This Paper

Sudhir Kumar Mohapatra, Srinivas Prasad, "Finding Representative Test Case for Test Case Reduction in Regression Testing", International Journal of Intelligent Systems and Applications(IJISA), vol.7, no.11, pp.60-65, 2015. DOI:10.5815/ijisa.2015.11.08


[1]M.J. Harrold, R. Gupta, and M.L. Soffa, “A Methodology for Controlling the Size of a Test Suite,” ACM Trans. Software Eng. And Methodology, vol. 2, no. 3, pp. 270-285, July 1993.
[2]T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, Sept. 2001.
[3]GUPTA, R. A reconfigurable LIW architecture and its compiler. Tech. Rep. 87-3. Dept. Computer Science, Univ. Pittsburgh, Pittsburgh, Pa., 1987.
[4]GumA, R., AND SOFFA, M. L. Compile-time techniques for improving scalar access performance in parallel memories. IEEE Trans. Parallel and Distributed Systems 2, 2 (Apr.1991), 138-148.
[5]D. Jeffrey and N. Gupta, “Improving Fault Detection Capability by Selectively Retaining Test Cases During Test Suite Reduction,” IEEE Trans. on Software Engineering, Vol. 33, No. 2, pp. 108-123, February 2007.
[6]J. W. Lin and C. Y. Huang, “Analysis of Test Suite Reduction with Enhanced Tie-Breaking Techniques,” Information and Software Technology, Vol. 51, No. 4, pp. 679-690, April 2009.
[7]M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, 1979.
[8]R. M. Karp, “Reducibility among Combinatorial Problems,” Complexity of Computer Computations, Plenum Press, pp. 85-103, 1972.
[9]V. Chvatal, “A Greedy Heuristic for the Set-Covering Problem,” Mathematics Operations Research, Vol. 4, No. 3, pp. 233-235, August 1979.
[10]S. Yoo and M. Harman, “Regression Testing Minimization, Selection and Prioritization: a Survey,” Software Testing, Verification and Reliability, Vol. 22, No. 2, March 2012.
[11]T. Y. Chen and M. F. Lau, “A New Heuristic for Test Suite Reduction,” Information and Software Technology, Vol. 40, No. 5-6, pp. 347-354, July 1998.
[12]J. A. Jones and M. J. Harrold, “Test-Suite Reduction and Prioritization for Modified Condition/Decision Coverage,” IEEE Trans. on Software Engineering, Vol. 29 No. 3, pp. 195-209, March 2003.
[13]Ma, X.y., He, Z.f., Sheng, B.k., Ye, C.q.: “A genetic algorithm for test-suite reduction”. In: Proc. the International Conference on Systems, Man and Cybernetics, pp. 133–139, October 2005
[14]Chu-Ti Lin, Kai-Wei Tang, Cheng-Ding Chen, and Gregory M. Kapfhammer. “Reducing the Cost of Regression Testing by Identifying Irreplaceable Test Cases”. In Proc. Of the 6th ICGEC ’12.
[15]Y Zhang, J Liu, Y Cui, X Hei , “An improved quantum genetic algorithm for test suite reduction ”, IEEE International Conference on Computer Science and Automation Engineering (CSAE), 2011
[16]Izzat Alsmadi, Sascha Alda, “Test Cases Reduction and Selection Optimization in Testing Web Services”, I.J. Information Engineering and Electronic Business, 2012, 5, 1-8
[17]Md. Nasar, Prashant Johri, Udayan Chanda, “ Software Testing Resource Allocation and Release Time Problem: A Review”, I.J. Modern Education and Computer Science, 2014, 2, 48-55
[18]Harish Kumar, Naresh Chauhan, “ A Module Coupling Slice Based Test Case Prioritization Technique”, I.J. Modern Education and Computer Science, 2015, 7, 8-16