Skip to main content
SpringerLink
Log in

tReductSA – Test Redundancy Reduction Strategy Based on Simulated Annealing

  • Conference paper
  • First Online:
Intelligent Software Methodologies, Tools and Techniques (SoMeT 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 513))

Abstract

Software testing relates to the process of accessing the functionality of a program against some defined specifications. To ensure conformance, test engineers often generate a set of test cases to validate against the user requirements. When dealing with large line of codes (LOCs), there are potentially issue of redundancies as new test cases may be added and old test cases may be deleted during the whole testing process. In order to address this issue, we have developed a new strategy, called tReductSA, to systematically minimize test cases for testing consideration. Unlike existing works which rely on the Greedy approaches, our work adopts the random sequence permutation and optimization algorithm based on Simulated Annealing with systematic merging technique. Our benchmark experiments demonstrate that tReductSA scales well with existing works (including that of GE, GRE and HGS) as far as optimality is concerned. On the other note, tReductSA also offers more diversified solutions as compared to existing work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chvatal, V.: A greedy heuristic for set covering problem. Math. Oper. Res. 4, 233–235 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  2. Harrold, M.J., Gupta, N., Soffa, M.L.: A methodology for controlling the size of a test suite. ACM Trans. Softw. Eng. Med. 2, 270–285 (1993)

    Article  Google Scholar 

  3. Chen, T.Y., Lau, M.F.: Heuristics towards the optimization of the size of a test suite. In: 3rd International Conference of Software Quality Management, Seville, pp. 415–424 (1995)

    Google Scholar 

  4. Chen, T.Y., Lau, M.F.: A new heuristic for test suite reduction. Inf. Softw. Technol. 40, 347–354 (1998)

    Article  Google Scholar 

  5. Shengwei, X., Huaikou, M., Honghao, G.: Test suite reduction using weighted set covering techniques. In: 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel & Distributed Computing, Kyoto, pp. 307–312 (2012)

    Google Scholar 

  6. Galeebathullah, B., Indumathi, C.P.: A novel approach for controlling a size of a test suite with simple technique. Int. J. Comput. Sci. Eng. 2, 614–618 (2010)

    Google Scholar 

  7. Ng, P., Fung, R.Y.K., Kong, R.W.M.: Incremental model-based test suite reduction with formal concept analysis. J. Inf. Process. Syst. 6, 197–208 (2010)

    Article  Google Scholar 

  8. Tallam, S., Gupta, N.: A concept analysis inspired greedy algorithm for test suite minimization. In: 6th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, Lisbon, Portugal (2005)

    Google Scholar 

  9. Yoo, S., Harman, M.: Regression testing minimization, selection and prioritization: a survey. Softw. Test. Verification Reliab. 22, 67–120 (2012)

    Article  Google Scholar 

  10. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  11. Eaarts, E., Korst, J.: Simulated Annealing and Boltzman Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, Chichester (1989)

    Google Scholar 

Download references

Acknowledgements

This research work involves collaborative efforts between Universiti Malaysia Pahang and Umm Al-Qura University. The work is funded by grant number 11-INF1674-10 from the Long-Term National Plan for Science, Technology and Innovation (LT-NPSTI), the King Abdul-Aziz City for Science and Technology (KACST), Kingdom of Saudi Arabia. We thank the Innovation Office, UMP and the Science and Technology Unit at Umm Al-Qura University for their continued logistics support.

Author information

Authors and Affiliations

  1. Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, Gambang, Malaysia

    Kamal Z. Zamli & Mohd Hafiz Mohd Hassin

  2. College of Computer and Information Systems, Umm Al-Qura University, Makkah, Kingdom of Saudi Arabia

    Basem Al-Kazemi

Authors
  1. Kamal Z. Zamli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohd Hafiz Mohd Hassin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Basem Al-Kazemi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kamal Z. Zamli .

Editor information

Editors and Affiliations

  1. Iwate Prefectural University, Takizawa, Japan

    Hamido Fujita

  2. Universiti Teknologi Malaysia, Johor Baharu, Malaysia

    Ali Selamat

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zamli, K.Z., Mohd Hassin, M.H., Al-Kazemi, B. (2015). tReductSA – Test Redundancy Reduction Strategy Based on Simulated Annealing. In: Fujita, H., Selamat, A. (eds) Intelligent Software Methodologies, Tools and Techniques. SoMeT 2014. Communications in Computer and Information Science, vol 513. Springer, Cham. https://doi.org/10.1007/978-3-319-17530-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17530-0_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17529-4

  • Online ISBN: 978-3-319-17530-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation