Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support

Information and Software Technology

Volumn 54, Issue 6, 2012, Pages 553-568

  Alsewari, Abdul Rahman A ^a   Zamli, Kamal Z ^a  

^a SCHOOL OF PHYSICS   (Malaysia)

Author keywords

Combinatorial testing; Harmony search algorithm; Variable strength t way testing

Indexed keywords

COMBINATORIAL TESTING; HARMONY SEARCH; HARMONY SEARCH ALGORITHMS; INTERACTION STRENGTH; T-WAY TESTING; TEST SIZE;

SEARCH ENGINES;

LEARNING ALGORITHMS;

EID: 84858060984     PISSN: 09505849     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.infsof.2012.01.002     Document Type: Article

References (54)

1. J. Karlsson, C. Wohlin, and B. Regnell An evaluation of methods for prioritizing software requirements Information and Software Technology 39 1998 939 947 (Pubitemid 128394300)
2. Q. Guo, R.M. Hierons, M. Harman, and K. Derderian Improving test quality using robust unique input/output circuit sequences (UIOCs) Information and Software Technology 48 2006 696 707 (Pubitemid 43782653)
3. M. Harman, S.A. Mansouri, Y. Zhang, Search Based Software Engineering: A Comprehensive Analysis and Review of Trends Techniques and Applications, Technical Report TR-09-03, Department of Computer Science, King's College London, 2009.
4. J. Arshem, TVG, 2010. < http://sourceforge.net/projects/tvg >.
5. P.J. Schroeder, E. Kim, J. Arshem, P. Bolaki, Combining behavior and data modeling in automated test case generation, in: Proceedings of the 3rd International Conference on Quality Software, IEEE Computer Society, 2003.
6. Z.Y. Wang, B.W. Xu, C.H. Nie, Greedy heuristic algorithms to generate variable strength combinatorial test suite, in: Proceedings of The 8th International Conference on Quality Software, IEEE Computer Society, 2008, pp. 155-160.
7. A. Hartman, IBM Intelligent Test Case Handler, 2005. < http://www.alphaworks.ibm.com/tech/whitch >.
8. J. Czerwonka, Pairwise testing in the real world: practical extensions to test-case scenarios, in: Proceedings of 24th Pacific Northwest Software Quality Conference, Citeseer, 2006, pp. 419-430.
9. X. Chen, Q. Gu, A. Li, D. Chen, Variable strength interaction testing with an ant colony system approach, in: Proceedings of the 16th Asia-Pacific Software Engineering Conference, IEEE Computer Society, 2009, pp. 160-167.
10. M. Harman, and B.F. Jones Search-based software engineering Information and Software Technology 43 2001 833 839 (Pubitemid 33050963)
11. J. Stardom, Metaheuristics and the search for covering and packing array, in: Department of Mathematics, Simon Fraser University, Canada, 2001, pp. 89.
12. B.S. Ahmed, and K.Z. Zamli A variable-strength interaction test suites generation strategy using particle swarm optimization Journal of Systems and Software 84 2011 2171 2185
13. M.B. Cohen, C.J. Colbourn, and A.C.H. Ling Constructing strength three covering arrays with augmented annealing Discrete Mathematics 308 2008 2709 2722 (Pubitemid 351474499)
14. K.P. Anagnostopoulos, and L. Kotsikas Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem Applied Mathematics and Computation 217 2010 260 270
15. I.H. Osman Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem Annals of Operations Research 41 1993 421 451
16. W. Afzal, R. Torkar, and R. Feldt A systematic review of search-based testing for non-functional system properties Information and Software Technology 51 2009 957 976
17. R. Bryce, C. Colbourn, 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, England, 2007, pp. 1082-1089. (Pubitemid 47291666)
18. J. McCaffrey, An empirical study of pairwise test set generation using a genetic algorithm, in: Proceedings of the 7th International Conference on Information Technology, IEEE Computer Society, 2010, pp. 992-997.
19. H. Sthamer, The Automatic Generation of Software Test Data Using Genetic Algorithms, University of Glamorgan, Pontyprid, Wales, 1995.
20. T. Shiba, T. Tsuchiya, T. Kikuno, Using artificial life techniques to generate test cases for combinatorial testing, in: Proceedings of the 28th Annual International Computer Software and Applications Conference, vol. 71, IEEE Computer Society, 2004, pp. 72-77. (Pubitemid 40673832)
21. B.S. Ahmed, K.Z. Zamli, and C.P. Lim Constructing a t-way interaction test suite using the particle swarm optimization approach International Journal of Innovative Computing, Information and Control 7 2011 1 10
22. B.S. Ahmed, K.Z. Zamli, PSTG: a t-way strategy adopting particle swarm optimization, in: Proceeding of 4th Asia International Conference on Mathematical /Analytical Modelling and Computer Simulation, IEEE Computer Society, 2010, pp. 1-5.
23. B.S. Ahmed, K.Z. Zamli, T-way test data generation strategy based on particle swarm optimization, in: Proceeding of 2nd International Conference on Computer Research and Development, IEEE Computer Society, 2010, pp. 93-97.
24. K.Z. Zamli, M.F.J. Klaib, M.I. Younis, N.A.M. Isa, and R. Abdullah Design and implementation of a t-way test data generation strategy with automated execution tool support Information Sciences 181 2011 1741 1758
25. B. Garvin Evaluating improvements to a meta-heuristic search for constrained interaction testing Empirical Software Engineering 16 2011 61 102
26. A.W. Williams, R.L. Probert, A measure for component interaction test coverage, in: The ACS/IEEE International Conference on Computer Systems and Applications, 2001, p. 304.
27. Y. Lei, R. Kacker, D. Kuhn, V. Okun, and J. Lawrence IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing Software Testing Verification and Reliability 18 2007 125 148
28. R. Mandl, Orthogonal Latin squares: an application of experiment design to compiler testing, in: Communications of the ACM, New York, NY, USA, 1985, pp. 1054-1058. (Pubitemid 15587965)
29. A. Hartman, and L. Raskin Problems and algorithms for covering arrays Discrete Mathematics 284 2004 149 156
30. M.B. Cohen, Designing test suites for software interaction testing, in: Computer Science, University of Auckland, New Zealand, 2004.
31. A.W. Williams, TConfig, 2002. < http://www.site.uottawa.ca/~awilliam >.
32. D.M. Cohen, S.R. Dalal, M.L. Fredman, and G.C. Patton The AETG system: an approach to testing based on combinatorial design IEEE Transactions on Software Engineering 23 1997 437 444 (Pubitemid 127828305)
33. D.M. Cohen, S.R. Dalal, J. Parelius, G.C. Patton, and N.J. Bellcore The combinatorial design approach to automatic test generation IEEE Software 13 1996 83 88
34. M.B. Cohen, M.B. Dwyer, J. Shi, Interaction testing of highly-configurable systems in the presence of constraints, in: Proceeding of International Symposium on Software Testing and Analysis, ACM, London, UK, 2007, pp. 129-139. (Pubitemid 47317587)
35. D. Pallas, Jenny, 2003. < http://www.burtleburtle.net/bob/math >.
36. Keith, H. Doug, PICT, 2006. < http://testmuse.wordpress.com/2006/04/ 05/pict-tool-available/2006 >.
37. Y. Lei, K.C. Tai, In-parameter-order: a test generation strategy for pairwise testing, in: Proceedings of The 3rd IEEE International Symposium on High-Assurance Systems Engineering, Washington, DC, USA, 1998, pp. 254-261.
38. M. Forbes, J. Lawrence, Y. Lei, R.N. Kacker, and D.R. Kuhn Refining the in-parameter-order strategy for constructing covering arrays Journal of Research of the National Institute of Standards and Technology 113 2008 287 297
39. M.I. Younis, and K.Z. Zamli MC-MIPOG: a parallel t-way test generation strategy for multicore systems ETRI Journal 32 2010
40. NIST, ACTS, 2010. < http://csrc.nist.gov/acts >.
41. C.A. Floudas, P.M. Pardalos, C.S. Adjiman, W.R. Esposito, Z.H. Gümüs, S.T. Harding, J.L. Klepeis, C.A. Meyer, and C.A. Schweiger Handbook of Test Problems in Local and Global Optimization 1999 Kluwer Academic Publishers Dordrecht
42. M.I. Younis, K.Z. Zamli, ITTW: T-way minimization strategy based on intersection of tuples, in: Proceeding of IEEE Symposium on Industrial Electronics & Applications, IEEE Computer Society, 2009, pp. 221-226.
43. P. Angeline, Evolutionary optimization versus particle swarm optimization: philosophy and performance differences, in: Proceedings of the 7th International Conference on Evolutionary Programming VII, Springer, Berlin/Heidelberg, San Diego, USA, 1998, pp. 601-610. (Pubitemid 128118970)
44. A. Kaveh, and S. Talatahari Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures Computers & Structures 87 2009 267 283
45. Z.W. Geem, C.-L. Tseng, and Y. Park Harmony search for generalized orienteering problem: best touring in China Lecture Notes in Computer Science 3612 2005 741 750 (Pubitemid 41449642)
46. Z.W. Geem, and J.H. Kim A new heuristic optimization algorithm: harmony search Simulation 76 2001 60 68 (Pubitemid 32543074)
47. M.G.H. Omran, and M. Mahdavi Global-best harmony search Applied Mathematics and Computation 198 2008 643 656 (Pubitemid 351400737)
48. J.H. Kim, Z.W. Geem, and E.S. Kim Parameter estimation of the nonlinear Muskingum model using harmony search Journal of the American Water Resources Association 37 2001 1131 1138 (Pubitemid 34009650)
49. K.S. Lee, and Z.W. Geem A new structural optimization method based on the harmony search algorithm Computers & Structures 82 2004 781 798
50. Z.W. Geem, K.S. Lee, and Y. Park Application of harmony search to vehicle routing American Journal of Applied Sciences 2 2005 1552 1557
51. Z.W. Geem, and J.Y. Choi Music composition using harmony search algorithm Applications of Evolutionary Computing 4448 2007 593 600 (Pubitemid 47290117)
52. M. Mahdavi, M. Fesanghary, and E. Damangir An improved harmony search algorithm for solving optimization problems Applied Mathematics and Computation 188 2007 1567 1579 (Pubitemid 46710046)
53. D.C. Montgomery, and G.C. Runger Applied Statistics and Probability for Engineers 4th ed. 2007 John Wiley and Sons
54. G. Sherwood, 2006. TestCover. < http://testcover.com/pub/constex.php >.