Abstract
Software testing is an integral part of software engineering. Lack of testing often leads to disastrous consequences including loss of data, fortunes, and even lives. In order to ensure software reliability, many combinations of possible input parameters, hardware/software environments, and system configurations need to be tested and verified against for conformance. Due to costing factors as well as time to market constraints, considering all exhaustive test possibilities would be infeasible (i.e. due to combinatorial explosion problem). Earlier work suggests that pairwise sampling strategy (i.e. based on two-way parameter interaction) can be effective. Building and complementing earlier work, this paper discusses an efficient pairwise test data generation strategy, called IRPS. In doing so, IRPS is compared against existing strategies including AETG and its variations, IPO, SA, GA, ACA, and All Pairs. Empirical results demonstrate that IRPS strategy, in most cases, outperformed other strategies as far as the number of test data generated within reasonable time.
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
Bush, K.A.: Orthogonal Arrays of Index Unity. Annals of Mathematical Statistics 23, 426–434 (1952)
Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG system: An Approach to Testing Based on Combinatorial Design. IEEE Trans. on Software Engineering 23(7), 437–443 (1997)
Cohen, D.M., Dalal, S.R., Parelius, J., Patton, G.C.: The Combinatorial Design Approach to Automatic Test Generation. IEEE Software 13(5), 83–88 (1996)
Cohen, M.B.: Designing Test Suites for Software Interaction Testing, PhD Thesis, University of Auckland (2004)
Cohen, M.B., Gibbons, P.B., Mugridge, W.B., Colbourn, C.J.: Constructing Test Suites for Interaction Testing. In: Proc. of the 25th Intl. Conf. on Software Engineering (ICSE 2003), Dallas USA. IEEE CS Press, Los Alamitos (2003)
Copeland, L.: A Practitioner’s Guide to Software Test Design. STQE Publishing (2004)
Grindal, M., Offutt, J., Andler, S. F.: Combination Testing Strategies: A Survey. In: GMU Technical Report ISE-TR-04-05 (July 2004)
Hartman, A., Raskin, L.: Problems and Algorithms for Covering Arrays. Discrete Mathematics 284(1-3), 149–156 (2004)
Kuhn, D.R., Wallace, D.R., Gallo, A.M.: Software Fault Interactions and Implications for Software Testing. IEEE Trans. on Software Engineering 30(6), 418–421 (2004)
Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: A General Strategy for T-Way Software Testing. In: 14th Annual IEEE Intl. Conf. and Workshops on the Engineering of Computer-Based Systems, Tucson, AZ, March 2007, pp. 549–556. IEEE CS Press, Los Alamitos (2007)
Lei, Y., Tai, K.C.: In-Parameter-Order: A Test Generating Strategy for Pairwise Testing. In: Proc. 3rd IEEE Intl. Symp. On High Assurance System Engineering, November 1998, pp. 254–261 (1998)
Lei, Y., Tai, K.C.: In-Parameter-Order: A Test Generating Strategy for Pairwise Testing. IEEE Transaction on Software Engineering 28(1), 1–3 (2002)
Maity, S., Nayak, A., Zaman, M., Bansal, N., Srivastava, A.: An Improved Test Generation Strategy for Pair-Wise Testing. In: Fast Abstract ISSRE 2003 (2003)
Mandl, R.: Orthogonal Latin squares: an application of experiment design to compiler testing. Communications of the ACM 28(10), 1054–1058 (1985)
Shiba, T., Tsuchiya, T., Kikuno, T.: Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing. In: 28th Annual Intl. Computer Software and Applications Conference (COMPSAC 2004), Hong Kong, China, September 2004, pp. 72–77 (2004)
Williams, A.W., Probert, R.L.: A Practical Strategy for Testing Pair-Wise Coverage of Network Interfaces. In: Proc. of the 7th Intl. Symp. on Software Reliability Engineering (ISSRE), White Plains, New York (1996)
Yan, J., Zhang, J.: Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing. In: Proc. of the 30th Annual Intl. Computer Software and Applications Conference (COMPSAC 2006), Chicago USA, September 2006, vol. 1, pp. 385–394. IEEE CS Press, Los Alamitos (2006)
Zekaoui, L.: Mixed Covering Arrays on Graphs and Tabu Search Algorithms. In: MSc Thesis, Ottawa-Carleton Institute for Computer Science, University of Ottawa, Canada (September 2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Younis, M.I., Zamli, K.Z., Mat Isa, N.A. (2008). IRPS – An Efficient Test Data Generation Strategy for Pairwise Testing. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2008. Lecture Notes in Computer Science(), vol 5177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85563-7_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-85563-7_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85562-0
Online ISBN: 978-3-540-85563-7
eBook Packages: Computer ScienceComputer Science (R0)