Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Adapting the elitism on greedy algorithm for variable strength combinatorial test cases generation

A combinatorial testing (CT) is an important technique usually employed in the generation of test cases. The generation of an optimal sized test case is a non-deterministic polynomial hard problem. In recent times, many researchers had developed various strategies based on the search-based approach to address the CT issues. This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. Hence, they are referred to as variable strength modified greedy strategy (VS-MGS). Moreover, the modified strategy supports a VS together with interaction strength up to six. The proposed variant-greedy algorithm employed the elitism mechanism alongside the iteration in order to improve its efficiency. This algorithm is invariably called the modified greedy algorithm (MGA). Furthermore, the efficiency and performance of the VS-MGS using MGA were assessed first by comparing its results with the original greedy algorithm results and thereafter benchmarked with the results of the existing VS CT strategies. The VS-MGS's results ultimately revealed that the adaptation of elitism mechanism with iteration in greedy algorithm resulted in an improved efficiency in the process of generating a near-optimal test case set size.

References

    1. 1)
      • 5. Mao, C.: ‘Generating test data for software structural testing based on particle swarm optimization’, Arab. J. Sci. Eng., 2014, 39, (6), pp. 45934607.
    2. 2)
      • 12. Bryce, R.C., Colbourn, C.J.: ‘A density-based greedy algorithm for higher strength covering arrays’, Softw. Testing, Verif. Reliab., 2009, 19, (1), pp. 3753.
    3. 3)
      • 9. Zamli, K.Z., Al-Sewari, A.A., Hassin, M.H.M.: ‘On test case generation satisfying the mc/dc criterion’, Int. J. Adv. Soft Comput. Its Appl., 2013, 5, (3), pp. 104115.
    4. 4)
      • 8. Petke, J., Cohen, M.B., Harman, M., et al: ‘Practical combinatorial interaction testing: empirical findings on efficiency and early fault detection’, IEEE Trans. Softw. Eng., 2015, 41, (9), pp. 901924.
    5. 5)
      • 22. Othman, R.R., Zamli, K.Z., Mohamad, S.M.S.: ‘T-way testing strategies: a critical survey and analysis’, Int. J. Digit. Content Technol. Appl., 2013, 7, (9), p. 222.
    6. 6)
      • 18. Wu, H., Nie, C., Kuo, F.-C., et al: ‘A discrete particle swarm optimization for covering array generation’, IEEE Trans. Evol. Comput., 2015, 19, (4), pp. 575591.
    7. 7)
      • 30. Črepinšek, M., Liu, S.-H., Mernik, L., et al: ‘Is a comparison of results meaningful from the inexact replications of computational experiments?’, Soft Comput.., 2016, 20, (1), pp. 223235.
    8. 8)
      • 13. Timaná-Peña, J.A., Cobos-Lozada, C.A., Torres-Jimenez, J.: ‘Metaheuristic algorithms for building covering arrays: a review’, Rev. Fac. Ing., 2016, 25, (43), pp. 3145.
    9. 9)
      • 29. Rao, R., Patel, V.: ‘An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems’, Int. J. Ind. Eng. Comput., 2012, 3, (4), pp. 535560.
    10. 10)
      • 2. Nie, C., Leung, H.: ‘A survey of combinatorial testing’, ACM Comput. Surv., 2011, 43, (2), p. 11.
    11. 11)
      • 10. Ba Homaid, A.A., Alsewari, A.A.: ‘A variable combinatorial test suite strategy based on modified greedy algorithm’. 2015 4th Int. Conf. on Software Engineering and Computer Systems, ICSECS 2015: Virtuous Software Solutions for Big Data, Kuantan, Pahang, Malaysia, 2015.
    12. 12)
      • 6. Kuhn, D.R., Kacker, R.N., Lei, Y.: ‘Introduction to combinatorial testing’ (CRC Press, USA, 2013).
    13. 13)
      • 20. Zakaria, H.L., Zamli, K.Z.: ‘Elitism based migrating birds optimization algorithm for combinatorial interaction testing’, Int. J. Softw. Eng. Technol., 2017, 3, (1), pp. 1018.
    14. 14)
      • 15. Avila-George, H., Torres-Jimenez, J., Gonzalez-Hernandez, L., et al: ‘Metaheuristic approach for constructing functional test-suites’, vol. 7 (Institution of Engineering and Technology, UK, 2013), pp. 104117.
    15. 15)
      • 24. Schroeder, P.J., Kim, E., Arshem, J., et al: ‘Combining behavior and data modeling in automated test case generation’. Proc. Third Int. Conf. on Quality Software, Dallas, TX, USA, 2003, pp. 247254.
    16. 16)
      • 26. Afzal, W., Torkar, R., Feldt, R.: ‘A systematic review of search-based testing for non-functional system properties’, Inf. Softw. Technol., 2009, 51, (6), pp. 957976.
    17. 17)
      • 17. Chen, X., Gu, Q., Li, A., et al: ‘Variable strength interaction testing with an ant colony system approach’. Asia-Pacific on Software Engineering Conf., 2009. APSEC'09, Penang, Malaysia, 2009, pp. 160167.
    18. 18)
      • 14. Nie, C., Wu, H., Liang, Y., et al: ‘Search based combinatorial testing’. 2012 19th Asia-Pacific Software Engineering Conf., Hong Kong, China, 2012, pp. 778783.
    19. 19)
      • 23. Lei, Y., Kacker, R., Kuhn, D.R., et al: ‘IPOG/ipog-d: efficient test generation for multi-way combinatorial testing’, Softw. Testing, Verif. Reliab., 2008, 18, (3), pp. 125148.
    20. 20)
      • 28. Hromkovič, P.D.J.: ‘Algorithmics for hard problems’ (Springer, Berlin Heidelberg, 2004, 2nd edn.).
    21. 21)
      • 25. Harman, M., Jones, B.F.: ‘Search-based software engineering’, Inf. Softw. Technol., 2001, 43, (14), pp. 833839.
    22. 22)
      • 11. Wang, Z., Xu, B., Nie, C.: ‘Greedy heuristic algorithms to generate variable strength combinatorial test suite’. 2008 The Eighth Int. Conf. on Quality Software, New York, USA, 2008, pp. 155160.
    23. 23)
      • 7. Petke, J., Yoo, S., Cohen, M.B., et al: ‘Efficiency and early fault detection with lower and higher strength combinatorial interaction testing’. Proc. of the 2013 9th Joint Meeting on Foundations of Software Engineering, Saint Petersburg, Russia, 2013, pp. 2636.
    24. 24)
      • 4. Aghdam, Z.K., Arasteh, B.: ‘An efficient method to generate test data for software structural testing using artificial bee colony optimization algorithm’, Int. J. Softw. Eng. Knowl. Eng., 2017, 27, (6), pp. 951966.
    25. 25)
      • 16. Alsewari, A.R.A., Zamli, K.Z.: ‘Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support’, Inf. Softw. Technol., 2012, 54, (6), pp. 553568.
    26. 26)
      • 21. Xiang, Y., Zhou, Y., Liu, H.: ‘An elitism based multi-objective artificial bee colony algorithm’, Eur. J. Oper. Res., 2015, 245, (1), pp. 168193.
    27. 27)
      • 19. Cohen, M.B., Dwyer, M.B., Shi, J.: ‘Constructing interaction test suites for highly-configurable systems in the presence of constraints: a greedy approach’, IEEE Trans. Softw. Eng., 2008, 34, (5), pp. 633650.
    28. 28)
      • 1. Khalsa, S.K., Labiche, Y.: ‘An orchestrated survey of available algorithms and tools for combinatorial testing’. 2014 IEEE 25th Int. Symp. on Software Reliability Engineering, Naples, Italy, 2014, pp. 323334.
    29. 29)
      • 27. Cohen, M.B., Gibbons, P.B., Mugridge, W.B., et al: ‘A variable strength interaction testing of components’. 27th Annual Int. on Computer Software and Applications Conf., 2003, COMPSAC 2003, Dallas, TX, USA, 2003, pp. 413418.
    30. 30)
      • 3. Al-Sewari, A.A., Zamli, K.Z.: ‘An orchestrated survey on t-way test case generation strategies based on optimization algorithms’. Lecture Notes in Electrical Engineering, 2014, pp. 255264.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-sen.2018.5005
Loading

Related content

content/journals/10.1049/iet-sen.2018.5005
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address