Advertisement

An Orchestrated Survey on T-Way Test Case Generation Strategies Based on Optimization Algorithms

  • AbdulRahman A. Al-Sewari
  • Kamal Z. Zamli
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 291)

Abstract

The test case construction is amongst the most labor-intensive tasks and has significant influence on the effectiveness and efficiency in software testing. Due to the market needed for diverse types of tests, recently, several number of t-way testing strategies (where t indicates the interaction strengths) have been developed adopting different approaches Algebraic, Pure computational, and Optimization Algorithms (OpA). This paper presents an orchestrated survey of the existing OpA t-way strategies as Simulated Annealing (SA), Genetic Algorithm (GA), Ant Colony Algorithm (ACA), Particle Swarm Optimization based strategy (PSTG), and Harmony Search Strategy (HSS). The results demonstrate the strength and the limitations of each strategy, thereby highlighting possible research for future work in this area.

Keywords

T-way testing Test case generation Software and hardware testing Optimization algorithms 

Notes

Acknowledgments

This research is partially funded by myGrants: A New Design of An Artifact-Attribute Social Research Networking Eco-System for Malaysian Greater Research Network, UMP RDU Short Term Grant: Development of a Pairwise Interaction Testing Strategy with Check-Pointing Recovery Support, and ERGS Grant: CSTWay: A Computational Strategy for Sequence Based T-Way Testing.

References

  1. 1.
    Floudas CA et al (1999) Handbook of test problems in local and global optimization, vol 33. Kluwer Academic Publishers, DordrechtGoogle Scholar
  2. 2.
    Bryce R, Colbourn C (2007) One-test-at-a-time heuristic search for interaction test suites. In: Proceedings of the 9th annual conference on genetic and evolutionary computation. ACM, London, EnglandGoogle Scholar
  3. 3.
    Shiba T, Tsuchiya T, Kikuno T (2004) Using artificial life techniques to generate test cases for combinatorial testing. In: Proceedings of the 28th annual international computer software and applications conference. IEEE Computer SocietyGoogle Scholar
  4. 4.
    McCaffrey J (2010) An empirical study of pairwise test set generation using a genetic algorithm. In: Proceedings of the 7th international conference on information technology. IEEE Computer SocietyGoogle Scholar
  5. 5.
    Chen X et al (2009) Variable strength interaction testing with an ant colony system approach. In: Proceedings of the 16th Asia-Pacific software engineering conference. IEEE Computer SocietyGoogle Scholar
  6. 6.
    Wang ZY, Xu BW, Nie CH (2008) Greedy Heuristic Algorithms to generate variable strength combinatorial test suite. In: Proceedings of the 8th international conference on quality software. IEEE Computer SocietyGoogle Scholar
  7. 7.
    Harman M, Jones BF (2001) Search-based software engineering. Inf Softw Technol 43(14):833–839CrossRefGoogle Scholar
  8. 8.
    Stardom J (2001) Metaheuristics and the search for covering and packing array in department of mathematics. Simon Fraser University, Canada, p 89Google Scholar
  9. 9.
    Cohen MB, Colbourn CJ, Ling ACH (2008) Constructing strength three covering arrays with augmented annealing. Discrete Mathematics 308(13):2709–2722CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Cohen MB, Dwyer MB, Shi J (2007) Interaction testing of highly-configurable systems in the presence of constraints. In: Proceeding of international symposium on software testing and analysis. ACM, London, UKGoogle Scholar
  11. 11.
    Ahmed BS, Zamli KZ, Lim CP (2012) Constructing a t-way interaction test suite using the particle swarm optimization approach. Int J Innovative Comput Inf Control 8(1):431–452Google Scholar
  12. 12.
    Younis MI, Zamli KZ (2009) ITTW: t-way minimization strategy based on intersection of tuples. In: Proceeding of IEEE symposium on industrial electronics and applications. IEEE Computer SocietyGoogle Scholar
  13. 13.
    Zamli KZ et al (2011) Design and implementation of a t-way test data generation strategy with automated execution tool support. Inf Sci 181(9):1741–1758CrossRefGoogle Scholar
  14. 14.
    Ahmed BS, Zamli KZ (2011) A variable-strength interaction test suites generation strategy using particle swarm optimization. J Syst Softw 84(12):2171–2185CrossRefGoogle Scholar
  15. 15.
    Alsewari ARA, Younis MI, Zamli KZ (2011) Generation of pairwise test sets using a harmony search algorithm. Comput Sci Lett 3(1)Google Scholar
  16. 16.
    Alsewari ARA, Zamli KZ (2011) Interaction test data generation using harmony search algorithm. In: Proceeding of IEEE symposium on industrial electronics and applications. IEEE Computer Society, Langkawi, MalaysiaGoogle Scholar
  17. 17.
    Alsewari ARA, Zamli KZ (2012) Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support. Inf Softw Technol 54(6):553–568Google Scholar
  18. 18.
    Alsewari ARA, Zamli KZ (2012) A Harmony search based pairwise sampling strategy for combinatorial testing. Int J Phys Sci 7(7):1062–1072Google Scholar
  19. 19.
    Geem ZW, Kim JH (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Singapore 2014

Authors and Affiliations

  1. 1.Software Engineering Department, Faculty of Computer Systems and Software EngineeringUniversiti Malaysia PahangGambang, KuantanMalaysia

Personalised recommendations