Abstract
Software testing is an integral part of software development life cycle which ensures the quality of the software. An exhaustive testing is not always possible because of combinatorial optimisation problem. Thus, in the software testing phase, generation of optimal number of test data accelerate the overall software testing process. We identified that the reduction of interactions among the input parameters significantly reduces the number of test data and generate an optimal test data set. This interaction is known as ‘t’-way interaction. Over the last decade, a large number of ‘t’-way test data generation strategies have been developed. However, generating optimum number of test data appears to be a NP-hard problem where the test data generation time becomes significantly higher. This paper proposes an effective test data generation strategy based on ‘Kids Card’ game known as MTTG. The proposed strategy significantly reduces the test data generation time. The result and discussion section shows that, MTTG outperforms all other strategies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lions, J.L.: Ariane 5 Failure: Full Report. http://sunnyday.mit.edu/accidents/Ariane5accidentreport.html (accessed February 11, 2015)
Patrick, M., Alexander, R., Oriol, M., Clark, J.A.: Subdomain-based test data generation. The Journal of Systems and Software, 1–15, November 2014. Elsevier
Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: a general strategy for t-way software testing. In: 14th Annual IEEE International Conference and Workshops on the Engineering and Computer-Based Systems (2007)
Cui, Y., Li, L., Yao, S.: A new strategy for pairwise test case generation. In: 3rd International Symposium on Intelligent Information Technology Application (2009)
Chen, X., Gu, Q., Qi, J., Chen, D.: Applying particle swarm optimization to pairwise testing. In: 34th Annual IEEE Computer Software And Application Conference (2010)
Younis, M.I., Zamli, K.Z., Isa, N.A.M.: Algebraic strategy to generate pairwise test set for prime number parameters and variables. In: IEEE International Conference on Computer and Information Technology (2008)
Younis, M.I., Zamli, K.Z., Mat Isa, N.A.: IRPS – an efficient test data generation strategy for pairwise testing. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part I. LNCS (LNAI), vol. 5177, pp. 493–500. Springer, Heidelberg (2008)
Klaib, M.F.J., Muthuraman, S., Ahmad, N., Sidek, R.: A tree based strategy for test data generation and cost calculation for uniform and non-uniform parametric values. In: 10th IEEE International Conference on Computer and Information Technology (2010)
Shitao, W., Hao, W.: A novel algorithm for multipath test data generation. In: 4th International Conference on Digital Manufacturing & Automation (2013)
Cohen, D.M., Dalal, S.R., Kajla, A., Patton, G.C.: The automatic efficient test generator (AETG) system. In: 5th International Symposium on Software Reliability Engineering (1994)
Bach, J.: Allpairs Test Case Generation Tool. http://tejasconsulting.com/open-testware/feature/allpairs.html (access September 27, 2009)
Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG System: An Approach to Testing Based on Combinatorial design. IEEE Transactions on Software Engineering (1997)
Lei, Y., Tai, K.C.: In-parameter-order: a test generation strategy for pairwise testing. In: 3rd IEEE Intl. High- Assurance Systems Engineering Symposium (1998)
Shiba, T., Tsuchiya, T., Kikuno, T.: Using artificial life techniques to generate test cases for combinatorial testing. In: 28th Annual International Computer Software and Applications Conference (2004)
Harman, M., Jones, B.F.: Search based software engineering. Information and Software Technology (2001)
Klaib, M.F.J., Zamli, K.Z., Isa, N.A.M., Younis, M.I., Abdullah, R.: G2Way – a backtracking strategy for pairwise test data generation. In: 15th IEEE Asia-Pacific Software Engineering Conference (2008)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE international Conference on Neural Networks (1995)
TConfig: http://www.site.uottawa.ca/~awilliam/ (access September 27, 2010)
TVG: http://sourceforge.net/projects/tvg (access September 27 2010)
Jenny: http://www.burtleburtle.net/bob/math/ (access September 27, 2010)
Yan, J., Zhang, J.: A Backtracking Search Tool for Constructing Combinatorial Test Suites. Journal of Systems and Software – Elsevier (2008)
Chateauneuf, M., Kreher, D.: On the State of Strength-Three Covering Arrays. Journal of Combinatorial Designs (2002)
Colbourn, C.J., Martirosyan, S.S., Mullen, G.L., Shasha, D., Sherwood, G.B., Yucas, J.L.: Products of Mixed Covering Arrays of Strength Two. Journal of Combinatorial Designs (2005)
Williams, A.W.: Determination of test configurations for pair-wise interaction coverage. In: Proc. of the 13th International Conference on Testing of Communicating Systems (2000)
Hartman, A., Raskin, L.: Combinatorial Test Services (2004). https://www.research.ibm.com/haifa/projects/verification/mdt/papers/CTSUserDocumentation.pdf (accessed March 2015)
Bach, J.: ALLPAIRS Test Generation Tool, Version 1.2.1 (2004). http://www.satisfice.com/tools.shtml (accessed March 2015)
Ellims, M., Ince, D., Petre, M.: AETG vs. Man: an Assessment of the Effectiveness of Combinatorial Test Data Generation. UK, in Technical Report, Department of Computing, Faculty of Mathematics and Computing, Open University (2008)
Cohen, M.B., Dwyer, M.B., Shi, J.: Exploiting constraint solving history to construct interaction test suites. In: Proc. of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION, 2007. IEEE Computer Society, UK (2007)
Yu-Wen, T., Aldiwan, W.S.: Automating test case generation for the new generation mission software system. In: Proc. of the IEEE Aerospace Conference (2000)
Cohen, M.B.: Designing Test Suites for Software Interaction Testing. Computer Science. New Zealand, University of Auckland (2004)
Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Refining the In-Parameter-Order Strategy for Constructing Covering Arrays. NIST Journal of Research (2008)
Hartman, A., Raskin, L.: Problems and Algorithms for Covering Arrays. Discrete Mathematics-Elsevier (2004)
Zamli, K.Z., Klaib, M.F.J., Younis, M.I., Isa, N.A.M., Abdullah, R.: Design and implementation of a t-way test data generation strategy with automated execution tool support. Information Sciences, Elsevier (2009)
Ahmed, B.S., Zamli, K.Z.: PSTG: A T-Way Strategy Adopting Particle Swarm Optimization. Mathematical/Analytical Modelling and Computer Simulation (AMS) (2010)
Khatun, S., Rabbi, K.F., Yaakub, C.Y., Klaib, M.F.J., Masroor Ahmed, M.: PS2Way: an efficient pairwise search approach for test data generation. In: Zain, J.M., Wan Mohd, WMb, El-Qawasmeh, E. (eds.) ICSECS 2011, Part III. CCIS, vol. 181, pp. 99–108. Springer, Heidelberg (2011)
Rabbi, K.F., Khatun, S., Yaakub, C.Y., Klaib, M.F.J.: EasyA: easy and effective way to generate pairwise test data. In: 2011 Third International Conference on Computational Intelligence, Communication Systems and Networks (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Rabbi, K., Mamun, Q. (2015). An Effective t-way Test Data Generation Strategy. In: Thuraisingham, B., Wang, X., Yegneswaran, V. (eds) Security and Privacy in Communication Networks. SecureComm 2015. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 164. Springer, Cham. https://doi.org/10.1007/978-3-319-28865-9_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-28865-9_42
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28864-2
Online ISBN: 978-3-319-28865-9
eBook Packages: Computer ScienceComputer Science (R0)