Skip to main content
SpringerLink
Log in

Introduction

  • Chapter
  • First Online:
Combinatorial Testing in Cloud Computing

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 463 Accesses

Abstract

This chapter gives an introduction to software testing and cloud testing. It describes the basic concepts of combinatorial testing in detail, including Latin squares, orthogonal arrays, and covering arrays. The popular combinatorial testing algorithms, such as AETG and IPO, are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. B.S. Ahmed, K.Z. Zamli, A review of covering arrays and their application to software testing. J. Comput. Sci. 7(9), 1375–1385 (2011)

    Article  Google Scholar 

  2. A. Arcuri, L. Briand, Formal analysis of the probability of interaction fault detection using random testing. IEEE Trans. Softw. Eng. 38(5), 1088–1099 (2012). (ISSN 0098-5589)

    Google Scholar 

  3. A. Arcuri, M.Z. Iqbal, L. Briand, Formal analysis of the effectiveness and predictability of random testing, in Proceedings of the 19th International Symposium on Software Testing and Analysis, ISSTA ’10 (ACM, New York, NY, USA, 2010), pp. 219–230. ISBN 978-1-60558-823-0

    Google Scholar 

  4. R. Brownlie, J. Prowse, M.S. Padke, Robust testing of AT&T PMX/StarMAIL using OATS. AT T Techn. J. 7(3), 41–47 (1992)

    Article  Google Scholar 

  5. R.C. Bryce, C.J. Colbourn, One-test-at-a-time heuristic search for interaction test suites, in Genetic and Evolutionary Computation Conference (GECCO), Search-based Software Engineering track (SBSE) (2007), pp. 1082–1089

    Google Scholar 

  6. R.C. Bryce, C.J. Colbourn, Expected time to detection of interaction faults. J. Comb. Math. Comb. Comput. (to appear)

    Google Scholar 

  7. R.C. Bryce, C.J. Colbourn, D.R. Kuhn, Finding interaction faults adaptively using distance-based strategies, in Proceedings of the 2011 18th IEEE International Conference and Workshops on Engineering of Computer-Based Systems, ECBS ’11 (IEEE Computer Society, Washington, DC, USA, 2011), pp. 4–13. ISBN 978-0-7695-4379-6

    Google Scholar 

  8. K. Burr, W. Young, Combinatorial test techniques: table-based automation, test generation and code coverage, in Proceedings of the International Conference on Software Testing Analysis and Review (West, 1998), pp. 503–513

    Google Scholar 

  9. D. Cohen, S.R. Dalal, M.L. Fredman, G.C. Patton, The AETG system: an approach to testing based on combinatorial design. J. IEEE Trans. Softw. Eng. 23, 437–444 (1997)

    Article  Google Scholar 

  10. D.M. Cohen, S.R. Dalal, A. Kajla, G.C. Patton, The automatic efficient test generator (AETG) system, in Proceedings of International Conference on Testing Computer Software (1994)

    Google Scholar 

  11. D.M. Cohen, S.R. Dalal, J. Parelius, G.C. Patton, The combinatorial design approach to automatic test generation. IEEE Softw. 13(5), 83–88 (1996a)

    Google Scholar 

  12. D.M. Cohen, S.R. Dalal, J. Parelius, G.C. Patton, The combinatorial design approach to automatic test generation. IEEE Softw. 13(5), 83–88 (1996b)

    Article  Google Scholar 

  13. C.J. Colbourn, Covering arrays and hash families, in ed. By D. Crnkovic, V.D. Tonchev, Information Security, Coding Theory and Related Combinatorics, volume 29 of NATO Science for Peace and Security Series–D: Information and Communication Security (IOS Press 2011)

    Google Scholar 

  14. C.J. Colbourn, S.S. Martirosyan, G.L. Mullen, D. Shasha, G.B. Sherwood, J.L. Yucas. Products of mixed covering arrays of strength two. J. Comb. Des. 14(14), 124C138 (2006)

    Google Scholar 

  15. S.R. Dalal, C.L. Mallows, Factor-covering designs for testing software. Technometrics 40, 234–243 (1998)

    Article  Google Scholar 

  16. S.R. Dalal, A. Jain, N. Karunanithi, J.M. Leaton, C.M. Lott, G.C. Patton, B.M. Horowitz, Model-based testing in practice, in Proceedings of the 21st International Conference on Software Engineering, ICSE ’99 (ACM, New York, NY, USA, 1999), pp. 285–294. ISBN 1-58113-074-0

    Google Scholar 

  17. J.W. Duran, S.C. Ntafos, An evaluation of random testing. IEEE Trans. Softw. Eng. 10(4), 438–444 (1984). ISSN 0098-5589

    Google Scholar 

  18. J. Gao, X. Bai, W.-T. Tsai, SaaS performance and scalability evaluation in cloud, in Proceedings of The 6th IEEE International Symposium on Service Oriented System Engineering, SOSE ’11 (2011)

    Google Scholar 

  19. S. Ghazi, M. Ahmed, Pair-wise test coverage using genetic algorithms, in Proceedings of 2003 Congress on Evolutionary Computation (CEC03), vol. 2 (2003), pp. 1420–1424

    Google Scholar 

  20. M. Grindal, J. Offutt, S.F. Andler, Combination testing strategies: a survey. Softw. Test. Verif. Reliab. 15, 167–199 (2005a)

    Article  Google Scholar 

  21. M. Grindal, J. Offutt, S.F. Andler, Combination testing strategies: a Survey. Softw. Test. Verif. Reliab. 15(3), 167–199 (2005b)

    Google Scholar 

  22. A.S. Hedayat, N.J.A. Sloane, J. Stufken, Orthogonal Arrays: Theory and Applications (Springer, New York, 1999)

    Book  MATH  Google Scholar 

  23. R. Huang, X. Xie, T.Y. Chen, Y. Lu, Adaptive random test case generation for combinatorial testing, in COMPSAC (IEEE Computer Society, 2012), pp. 52–61

    Google Scholar 

  24. C. Kaner, J. Falk, H.Q. Nguyen, Testing Computer Software, 2nd edn. (Wiley, New York, 1999)

    MATH  Google Scholar 

  25. V.V. Kuliamin, A.A. Petukhov, A survey of methods for constructing covering arrays. J. Progr. Comput. Softw. 37(3), 121–146 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  26. J. Lei, In-parameter-order: a test generation strategy for pairwise testing (2005), http://csrc.nist.gov/groups/SNS/acts/documents/ipo-nist.pdf/

  27. Y. Lei, K.-C. Tai, In-parameter-order: a test generation strategy for pairwise testing, in Proceedings of 3rd IEEE International Symposium on High-Assurance Systems Engineering, HASE ’98 (1998), pp. 254–261. ISBN 0-8186-9221-9

    Google Scholar 

  28. R. Mandl, Orthogonal latin squares: an application of experiment design to compiler testing. Commun. ACM 28(10), 1054–1058 (1985). ISSN 0001-0782

    Google Scholar 

  29. A.P. Mathur, Foundations of Software Testing, 2nd edn. (Pearson Education, New Jersey, 2013)

    Google Scholar 

  30. T. Muller, D. Friedenberg, Certified tester foundation level syllabus. J. Int. Softw. Test. Qualif. Board (2007)

    Google Scholar 

  31. C. Nie, H. Leung, A survey of combinatorial testing. ACM Comput. Surv. 43(2), 11:1–11:29 (2011). ISSN 0360-0300

    Google Scholar 

  32. A.A. Porter, C. Yilmaz, A.M. Memon, D.C. Schmidt, B. Natarajan, Skoll: a process and infrastructure for distributed continuous quality assurance. IEEE Trans. Softw. Eng. 33(8), 510–525 (2007)

    Article  Google Scholar 

  33. G. Qi, W.-T. Tsai, W. Li, Z. Zhu, Y. Luo, A cloud-based triage log analysis and recovery framework. Simul. Model. Prac. Theory 77, 292–316 (2017)

    Article  Google Scholar 

  34. V. Rajappa, A. Birabar, S. panda, Efficient software test case generation using genetic algorithm based graph theory (2008), www.cs.uofs.edu/~bi/2008f-html/se516/peddachappali.ppt/

  35. P.J. Schroeder, P. Bolaki, V. Gopu, Comparing the fault detection effectiveness of n-way and random test suites, in Proceedings of the 2004 International Symposium on Empirical Software Engineering, ISESE ’04 (IEEE Computer Society, Washington, DC, USA, 2004), pp. 49–59. ISBN 0-7695-2165-7

    Google Scholar 

  36. T. Shiba, T. Tsuchiya, T. Kikuno, Using artificial life techniques to generate test cases for combinatorial testing, in Proceedings of the 28th Annual International Conference on Computer Software and Applications (COMPSAC2004), vol. 1 (2004), pp. 72–77

    Google Scholar 

  37. M. Sinnema, S. Deelstra, Classifying variability modeling techniques. Inf. Softw. Technol. 49(7), 717–739 (2007). ISSN 0950-5849

    Google Scholar 

  38. K.-C. Tai, Y. Lei, A test generation strategy for pairwise testing. IEEE Trans. Softw. Eng. 28(1), 109–111 (2002)

    Article  MathSciNet  Google Scholar 

  39. W.-T. Tsai, Q. Shao, W. Li, OIC: ontology-based intelligent customization framework for SaaS, in Proceedings of International Conference on Service Oriented Computing and Applications(SOCA’10) (Perth, Australia, 2010)

    Google Scholar 

  40. W.-T. Tsai, Y. Huang, X. Bai, J. Gao, Scalable architecture for SaaS, in Proceedings of 15th IEEE International Symposium on Object Component Service-oriented Real-time Distributed Computing, ISORC ’12 (2012)

    Google Scholar 

  41. W. T. Tsai, W. Li, G. Qi, Ltbd: a triage framework, in 2016 IEEE Symposium on Service-Oriented System Engineering (SOSE) (2016), pp. 91–100

    Google Scholar 

  42. J.H. van Lint, R.M. Wilson, A Course in Combinatorics (Cambridge University Press, 1992). ISBN 978-0-521-41057-1

    Google Scholar 

  43. Wikipedia. Backtracking (2014a), http://en.wikipedia.org/wiki/Backtracking/

  44. Wikipedia. Black-box testing (2014b), http://en.wikipedia.org/wiki/Black-box_testing/

  45. Wikipedia. Genetic algorithm (2014c), http://en.wikipedia.org/wiki/Genetic_algorithm/

  46. Wikipedia. Latin square (2014d), http://en.wikipedia.org/wiki/Latin_square/

  47. Wikipedia. Orthogonal array (2014e), http://en.wikipedia.org/wiki/Orthogonal_array/

  48. Wikipedia. All-pairs testing (2014f), http://en.wikipedia.org/wiki/All-pairs_testing/

  49. Wikipedia. White-box testing (2014g), http://en.wikipedia.org/wiki/White-box_testing/

  50. A. Williams, R. Probert, A practical strategy for testing pair-wise coverage of network interfaces, in Proceedings Seventh International Symposium on Software Reliability Engineering (1996), pp. 246–254

    Google Scholar 

  51. C. Yilmaz, M.B. Cohen, A. Porter, Covering arrays for efficient fault characterization in complex configuration spaces, in Proceedings of the 2004 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA ’04 (ACM, New York, NY, USA, 2004), pp. 45–54

    Google Scholar 

  52. J. Zhang, Z. Zhang, F. Ma, Automatic Generation of Combinatorial Test Data (Springer, New York, 2014)

    Book  MATH  Google Scholar 

  53. Q. Zuo, M. Xie, G. Qi, H. Zhu, Tenant-based access control model for multi-tenancy and sub-tenancy architecture in software-as-a-service. Front. Comput. Sci. 11(3), 465–484 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Arizona State University, Tempe, AZ, USA

    Wei-Tek Tsai & Guanqiu Qi

Authors
  1. Wei-Tek Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guanqiu Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guanqiu Qi .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 The Author(s)

About this chapter

Cite this chapter

Tsai, WT., Qi, G. (2017). Introduction. In: Combinatorial Testing in Cloud Computing. SpringerBriefs in Computer Science. Springer, Singapore. https://doi.org/10.1007/978-981-10-4481-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4481-6_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4480-9

  • Online ISBN: 978-981-10-4481-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation