Abstract
Aside from the one-test-at-a-time strategy, the in-parameter-order (IPO) is another greedy strategy for generating covering arrays. As the name says, the IPO strategy extends the covering array in parameter order. In each iteration, the algorithm extends a smaller covering array into a larger covering array with one more parameter. The extension process has two stages, which extends the covering array horizontally and vertically, respectively.
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
Notes
- 1.
For a brief introduction to CSP and constraint solving, see Sect. 6.1.
References
Chateauneuf, M.A., Colbourn, C.J., Kreher, D.L.: Covering arrays of strength three. Des. Codes Cryptogr. 16(3), 235–242 (1999)
Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Refining the in-parameter-order strategy for constructing covering arrays. J. Res. Natl. Inst. Stand. Technol. 113(5), 287–297 (2008)
Lei, Y., Tai, K.C.: In-parameter-order: a test generation strategy for pair-wise testing. In: Proceedings of the 3rd IEEE International Symposium on High-Assurance Systems Engineering (HASE’98), IEEE Computer Society, pp. 254–261 (1998)
Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: A general strategy for t-way software testing. In: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS’07), IEEE, pp. 549–556 (2007)
Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing. Softw. Test. Verification Reliab. 18(3), 125–148 (2008)
Nie, C., Xu, B., Shi, L., Dong, G.: Automatic test generation for n-way combinatorial testing. In: Quality of Software Architectures and Software Quality (QoSA-SOQUA), Springer LNCS 3712, pp. 203–211 (2005)
Tai, K.C., Lei, Y.: A test generation strategy for pairwise testing. IEEE Trans. Softw. Eng. 28(1), 109–111 (2002)
Wang, Z., Nie, C., Xu, B.: Generating combinatorial test suite for interaction relationship. In: Proceedings of the Fourth International Workshop on Software Quality Assurance (SOQUA 2007), ACM, pp. 55–61 (2007)
Wang, Z., Xu, B., Nie, C.: Greedy heuristic algorithms to generate variable strength combinatorial test suite. In: Proceedings of the Eighth International Conference on Quality Software (QSIC’08), IEEE, pp. 155–160 (2008)
Yu, L., Lei, Y., Nourozborazjany, M., Kacker, R. N., Kuhn, D. R.: An efficient algorithm for constraint handling in combinatorial test generation. In: Proceedings of the Sixth International Conference on Software Testing, Verification and Validation (ICST’13), IEEE, pp. 242–251 (2013)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 The Author(s)
About this chapter
Cite this chapter
Zhang, J., Zhang, Z., Ma, F. (2014). The IPO Family. In: Automatic Generation of Combinatorial Test Data. SpringerBriefs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43429-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-43429-1_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43428-4
Online ISBN: 978-3-662-43429-1
eBook Packages: Computer ScienceComputer Science (R0)