http://iet.metastore.ingenta.com
1887

Search-based software engineering for constructing covering arrays

Search-based software engineering for constructing covering arrays

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Software — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Search-based software engineering involves the application of optimisation methods to solve software engineering problems. One of the most significant difficulties in testing software systems is the effort needed to build the test suites required to validate a software system, which efficiently exposes faults. Given the importance of the software testing stage, a specific sub-area known as search-based software testing has become relevant in recent years. In this work, a search-based software testing algorithm for constructing covering arrays is proposed. A covering array is a combinatorial structure that can be used as a set of test cases. By utilising this algorithm, the authors reduce the size of 893 test suites.

References

    1. 1)
      • 1. Harman, M., Jones, B.F.: ‘Search-based software engineering’, Inf. Softw. Technol., 2001, 43, (14), pp. 833839.
    2. 2)
      • 2. Fraser, G., Arcuri, A., McMinn, P.: ‘A memetic algorithm for whole test suite generation’, J. Syst. Softw., 2015, 103, pp. 311327.
    3. 3)
      • 3. Kuhn, D.R., Lei, Y., Kacker, R.: ‘Practical combinatorial testing: beyond pairwise’, IT Prof., 2008, 10, (3), pp. 1923.
    4. 4)
      • 4. Kacker, R.N., Kuhn, D.R., Lei, Y., et al: ‘Combinatorial testing for software: an adaptation of design of experiments’, Measurement, 2013, 46, (9), pp. 37453752.
    5. 5)
      • 5. Torres Jimenez, J., Avila George, H.: ‘Search-based software engineering to construct binary test-suites’, in Mejia, J., Munoz, M., Rocha, Á., Calvo-Manzano, J. (Eds.): ‘Trends and applications in software engineering’ (Springer International Publishing, Cham, 2016), pp. 201212.
    6. 6)
      • 6. Stardom, J.: ‘Metaheuristics and the search for covering and packing arrays’. Master thesis, Simon Fraser University, 2001.
    7. 7)
      • 7. Cohen, M.B., Gibbons, P.B., Mugridge, W.B., et al: ‘Constructing test suites for interaction testing’. Proc. 25th Int. Conf. on Software Engineering, Portland, OR, USA, May 2003, pp. 3848.
    8. 8)
      • 8. Tung, Y.W., Aldiwan, W.S.: ‘Automating test case generation for the new generation mission software system’. Proc. IEEE Aerospace Conf., Big Sky, MT, USA, March 2000, pp. 431437.
    9. 9)
      • 9. Cohen, D.M., Dalal, S.R., Fredman, M.L., et al: ‘The AETG system: an approach to testing based on combinatorial design’, IEEE Trans. Softw. Eng., 1997, 23, (7), pp. 437444.
    10. 10)
      • 10. Shiba, T., Tsuchiya, T., Kikuno, T.: ‘Using artificial life techniques to generate test cases for combinatorial testing’. Proc. 28th Annual Int. Computer Software and Applications Conf., Hong Kong, China, September 2004, pp. 7277.
    11. 11)
      • 11. Lei, Y., Tai, K.C.: ‘In-parameter-order: a test generation strategy for pairwise testing’. Proc. The 3rd IEEE Int. Symp. on High-Assurance Systems Engineering, Washington, DC, USA, Nov. 1998, pp. 254261.
    12. 12)
      • 12. Nurmela, K.J.: ‘Upper bounds for covering arrays by tabu search’, Discrete Appl. Math., 2004, 138, (1–2), pp. 143152.
    13. 13)
      • 13. Bryce, R.C., Colbourn, C.J.: ‘One-test-at-a-time heuristic search for interaction test suites’. Proc. 9th Annual Conf. on Genetic and Evolutionary Computation, London, England, July 2007, pp. 10821089.
    14. 14)
      • 14. Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: ‘Constructing strength three covering arrays with augmented annealing’, Discrete Math., 2008, 308, (13), pp. 27092722.
    15. 15)
      • 15. Walker II, R.A., Colbourn, C.J.: ‘Tabu search for covering arrays using permutation vectors’, J. Stat. Plan. Inference, 2009, 139, (1), pp. 6980.
    16. 16)
      • 16. Chen, X., Gu, Q., Zhang, X., et al: ‘Building prioritized pairwise interaction test suites with ant colony optimization’. Proc. 9th Int. Conf. on Quality Software, Jeju, South Korea, Aug. 2009, pp. 347352.
    17. 17)
      • 17. Martinez Pena, J., Torres Jimenez, J., Rangel Valdez, N., et al: ‘A heuristic approach for constructing ternary covering arrays using trinomial coefficients’, in Kuri-Morales, A., Simari, G.R. (Eds.): ‘Advances in artificial intelligence – IBERAMIA 2010’ (Springer Berlin Heidelberg, Berlin, Heidelberg, 2010), pp. 572581.
    18. 18)
      • 18. McCaffrey, J.D.: ‘An empirical study of pairwise test set generation using a genetic algorithm’. Proc. Seventh Int. Conf. on Information Technology: New Generations, Las Vegas, NV, USA, April 2010, pp. 992997.
    19. 19)
      • 19. Garvin, B.J., Cohen, M.B., Dwyer, M.B.: ‘Evaluating improvements to a meta-heuristic search for constrained interaction testing’, Empir. Softw. Eng., 2011, 16, (1), pp. 61102.
    20. 20)
      • 20. Avila George, H., Torres Jimenez, J., Hernández, V.: ‘New bounds for ternary covering arrays using a parallel simulated annealing’, Math. Probl. Eng., 2012, 2012, (897027), p. 19.
    21. 21)
      • 21. Rodriguez Cristerna, A., Torres Jimenez, J.: ‘A simulated annealing with variable neighborhood search approach to construct mixed covering arrays’, Electron. Notes Discrete Math., 2012, 39, pp. 249256.
    22. 22)
      • 22. Jinhua, L., Dandan, X., Zhao, Y.: ‘Combinatorial test suite generation of variable strength based on harmony search’, J. Netw. Inf. Secur., 2013, 4, (2), pp. 177188.
    23. 23)
      • 23. Bao, X., Liu, S., Zhang, N., et al: ‘Combinatorial test generation using improved harmony search algorithm’, Int. J. Hybrid Inf. Technol., 2015, 8, (9), pp. 121130.
    24. 24)
      • 24. 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.
    25. 25)
      • 25. Ahmed, B.S., Abdulsamad, T.S., Potrus, M.Y.: ‘Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the cuckoo search algorithm’, Inf. Softw. Technol., 2015, 66, pp. 1329.
    26. 26)
      • 26. Zamli, K.Z., Alkazemi, B.Y., Kendall, G.: ‘A tabu search hyper-heuristic strategy for -way test suite generation’, Appl. Soft Comput., 2016, 44, pp. 5774.
    27. 27)
      • 27. Bansal, P., Sabharwal, S., Mittal, N., et al: ‘ABC-CAG: covering array generator for pair-wise testing using artificial bee colony algorithm’, e-Inf. Softw. Eng. J., 2016, 10, (1), pp. 929.
    28. 28)
      • 28. Qi, R.Z., Wang, Z.J., Li, S.Y.: ‘A parallel genetic algorithm based on spark for pairwise test suite generation’, J. Comput. Sci. Technol., 2016, 31, (2), pp. 417427.
    29. 29)
      • 29. Sabharwal, S., Bansal, P., Mittal, N.: ‘Construction of -way covering arrays using genetic algorithm’, Int. J. Syst. Assurance Eng. Manage., 2017, 8, (2), pp. 264274.
    30. 30)
      • 30. Kitsos, P., Simos, D.E., Torres Jimenez, J., et al: ‘Exciting FPGA cryptographic trojans using combinatorial testing’. Proc. 26th Int. Symp. on Software Reliability Engineering, Gaithersbury, MD, USA, Nov. 2015, pp. 6976.
    31. 31)
      • 31. Sloane, N.J.A.: ‘Covering arrays and intersecting codes’, J. Comb. Des., 1993, 1, (1), pp. 5163.
    32. 32)
      • 32. Bush, K.A.: ‘Orthogonal arrays of index unity’, Ann. Math. Stat., 1952, 23, (3), pp. 426434.
    33. 33)
      • 33. Colbourn, C.J.: ‘Covering arrays from cyclotomy’, Des. Codes Cryptogr., 2010, 55, (2–3), pp. 201219.
    34. 34)
      • 34. Lobb, J.R., Colbourn, C.J., Dazinger, P., et al: ‘Cover starters for covering arrays of strength two’, Discrete Math., 2012, 312, pp. 943956.
    35. 35)
      • 35. Tang, D.T., Woo, L.S.: ‘Exhaustive test pattern generation with constant weight vectors’, IEEE Trans. Comput., 1983, 32, (12), pp. 11451150.
    36. 36)
      • 36. Raaphorst, S., Moura, L., Stevens, B.: ‘A construction for strength-3 covering arrays from linear feedback shift register sequences’, Des. Codes Cryptogr., 2014, 73, (3), pp. 949968.
    37. 37)
      • 37. Colbourn, C.J., Martirosyan, S.S., Mullen, G.L., et al: ‘Products of mixed covering arrays of strength two’, J. Comb. Des., 2006, 12, (2), pp. 124138.
    38. 38)
      • 38. Hartman, A.: ‘Software and hardware testing using combinatorial covering suites’, in Golumbic, M.C., Hartman, I.B.A. (Eds.): ‘Graph theory, combinatorics and algorithms’ (Springer US, Boston, MA, 2005), pp. 237266.
    39. 39)
      • 39. Roux, G.: ‘k-propriétés dans des tableaux de colonnes; cas particulier de la k-surjectivité et de la k-permutivité’. PhD thesis, University of Paris, 1987.
    40. 40)
      • 40. Du, K.L., Swamy, M.N.S.: ‘Search and optimization by metaheuristics’ (Birkhäuser, Basel, 2016).
    41. 41)
      • 41. Torres Jimenez, J., Rodriguez Tello, E.: ‘New bounds for binary covering arrays using simulated annealing’, Inf. Sci., 2012, 185, (1), pp. 137152.
    42. 42)
      • 42. Covering array tables’, http://www.public.asu.edu/ccolbou/src/tabby/catable.html, accessed on Sept. 26, 2017.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-sen.2018.5141
Loading

Related content

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