Abstract
Software testing is a very important phase of the software development cycle which ensures that the system developed is reliable and acceptable. Optimizing the test suite size of software eliminates the unnecessary cost and resources that are involved in testing. Sometimes it is not possible to exhaustively test any system due to huge number of test cases. In order to test any system and make it acceptable, combinatorial software interaction testing has been used in several fields. Investigations have concluded that most of the software faults could be identified by pairwise combinatorial interaction testing. Researchers have applied parallel algorithms to various combinatorial optimisation problems and have succeeded in significant time reduction in solving the problems. Large and/or computationally expensive optimization problems sometimes require parallel or high-performance computing systems to achieve reasonable running times.
In this paper we propose a new strategy, “A Parallel Tree Based Strategy for Pairwise Combinatorial Interaction Testing”. The proposed strategy is based on two algorithms, a parallel tree generation algorithm and a parallel cost calculation algorithm, which are used in constructing a test suite with minimum number of test cases. The correctness of the strategy has been proved, and imperial results show that our strategy is efficient in test size reduction.
This is a preview of subscription content, log in via an institution to check access.
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
Bryce, R., Colbourn, C.J., Cohen, M.B.: A Framework of Greedy Methods for Constructing Interaction Tests. In: 27th International Conference on Software Engineering, St. Louis, MO, USA, pp. 146–155 (2005)
Tsui, F.F., Karam, O.: Essentials of Software Engineering. Jones and Bartlett, Massachusetts (2007)
Chaudhuri, D.K.R., Zhu, T.: A Recursive Method for Construction of Designs. Discrete Mathematics 106, 399–406 (1992)
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, pp. 463–470. IEEE Press, China (2008)
Copeland, L.: A Practitioner’s Guide to Software Test Design. Artech House, Boston (2004)
Roper, M.: Software Testing, 3rd edn., vol. 15, pp. 41–47. Academic Press, California (2002)
Burr, K., Young, W.: Combinatorial Test Techniques: Table-based Automation, Test Generation and Code Coverage. In: International Conference on Software Testing, Analysis, and Review (STAR), San Diego, CA (1998)
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 23, 437–444 (1997)
Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Constructing Strength Three Covering Arrays with Augmented Annealing. Discrete Mathematics 308, 2709–2722 (2008)
Zamli, K.Z., Hassan, M.D.A., Isa, N.A.M., Klaib, M.F.J.: Developing Automated Testing Tool - SFIT: Experiences and Lessons Learned. Academy of Science Malaysia (ASM) Journal (December 2007)
Lei, Y., Kacker, R., Kuhn, D., Okun, V., Lawrence, J.: IPOG/IPOD: Efficient Test Generation for Multi-Way Software Testing. Journal of Software Testing, Verification, and Reliability 18, 125–148 (2009)
Cohen, M.B.: Designing Test Suites for Software Interaction Testing. Ph.D Thesis, Computer Science, University of Auckland, New Zealand (2004)
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, Monterey, California, USA, pp. 303–309 (1994)
Lei, Y., Tai, K.C.: In-Parameter-Order: A Test Generation Strategy for Pairwise Testing. In: 3rd IEEE Intl. High-Assurance Systems Engineering Symp., pp. 254–261. IEEE Press, Washington (1998)
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 Conf. (COMPSAC 2004), Hong Kong, pp. 72–77 (2004)
Tai, K.C., Lei, Y.: A Test Generation Strategy for Pairwise Testing. IEEE Transactions on Software Engineering 28, 109–111 (2002)
Dalal, S.R., Jain, A., Karunanithi, N., Leaton, J.M., Lott, C.M., Patton, G.C., Horowitz, B.M.: Model Based Testing in Practice. In: International Conference on Software Engineering (ICSE), pp. 285–294 (1999)
Kuhn, D.R., Reilly, M.J.: An Investigation of the Applicability of Design of Experiments to Software Testing. In: 27th NASA/IEEE Software Engineering Workshop, pp. 69–80. IEEE Computer Society Press, Washington (2002)
Kuhn, D.R., Okum, V.: Pseudo-Exhaustive Testing for Software. In: 30th Annual IEEE/NASA Software Engineering Workshop (SEW 2006), pp. 25–27. IEEE Computer Society Press, Washington (2006)
Kuhn, D.R., Wallace, D.R., Gallo, A.M.: Software Fault Interactions and Implications for Software Testing. IEEE Transactions on Software Engineering 30, 418–421 (2004)
Yan, J., Zhang, J.: A Backtracking Search Tool for Constructing Combinatorial Test Suites. Journal of Systems and Software 81, 1681–1693 (2008)
Bryce, R., Colbourn, C.J.: Prioritized Interaction Testing for Pairwise Coverage with Seeding and Avoids. Information and Software Technology Journal 48, 960–970 (2006)
Kuhn, D.R., Lei, Y., Kacker, R.: Practical Combinatorial Testing: Beyond Pairwise. IT Professional 10, 19–23 (2008)
Grindal, M., Offutt, J., Andler, S.F.: Combination Testing Strategies: a Survey. Software Testing, Verification and Reliability 15, 167–200 (2005)
Mats Grindal: Handling Combinatorial Explosion in Software Testing. Linkoping Studies in Science and Technology, Dissertation No. 1073, Sweden (2007)
Zamli, K.Z., Klaib, M.F.J., Isa, N.A.M.: Combinatorial Explosion Problem in Software Testing: Issues and Practical Remedies. In: 3rd Malaysian Software Engineering Conference (mysec 2007), Selangor, Malaysia, pp. 24–28 (2007)
Zamli, K.Z., Isa, N.A.M., Klaib, M.F.J., Soh, Z.H.C., Zulkifli, C.Z.: On Combinatorial Explosion Problem for Software Configuration Testing. In: International Robotics, Vision, Information and Signal Processing Conference (ROVISP 2007), Penang, Malaysia (2007)
Bader, D.A., Hart, W.E., Phillips, C.A.: Parallel Algorithm Design for branch and bound, Tutorials on Emerging Methodologies and Applications in Operations Research. In: Mathematics and Statistics, vol. 76. Springer, New York (2006)
Setia, R., Nedunchezhian, A., Balachandran, S.: A New Parallel Algorithm for Minimum Spanning Tree Problem. In: 16th Annual IEEE International Conference on High Performance Computing, Cochin, India (2009)
Bach, J.: Allpairs Test Case Generation Tool, http://tejasconsulting.com/opentestware/feature/allpairs.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klaib, M.F.J., Muthuraman, S., Ahmad, N., Sidek, R. (2010). A Parallel Tree Based Strategy for Test Data Generation and Cost Calculation for Pairwise Combinatorial Interaction Testing. In: Zavoral, F., Yaghob, J., Pichappan, P., El-Qawasmeh, E. (eds) Networked Digital Technologies. NDT 2010. Communications in Computer and Information Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14306-9_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-14306-9_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14305-2
Online ISBN: 978-3-642-14306-9
eBook Packages: Computer ScienceComputer Science (R0)