Abstract
In this paper we first show that the combinatorial task of enumerating t-wise tuples out of a given set of elements is the recursive iteration of the simpler task of computing pairs out of the same set of elements. We then show how to apply this result to the design of a general framework for incremental CIT test suite construction, that is, producing at each iteration an additional set of tuples required to increase the coverage interaction degree just by one. As a last contribution, we show that in the presented construction framework, the covering array minimization problem and its inherent complexity can be encapsulated inside a delegate task of merging two given smaller covering array, while minimizing rows redundancy.
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
Williams, A.W., Probert, R.L.: Formulation of the interaction test coverage problem as an integer program. In: Proceedings of the 14th International Conference on the Testing of Communicating Systems (TestCom), Berlin, Germany, pp. 283–298 (March 2002)
Seroussi, G., Bshouty, N.H.: Vector sets for exhaustive testing of logic circuits. IEEE Transactions on Information Theory 34(3), 513–522 (1988)
Kobayashi, N., Tsuchiya, T., Kikuno, T.: Non-specification-based approaches to logic testing for software. Journal of Information and Software Technology 44(2), 113–121 (2002)
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(7), 437–444 (1997)
Tai, K.C., Lei, Y.: A test generation strategy for pairwise testing. IEEE Trans. Softw. Eng. 28(1), 109–111 (2002)
Bryce, R.C., Colbourn, C.J., Cohen, M.B.: A framework of greedy methods for constructing interaction test suites. In: ICSE 2005: Proceedings of the 27th International Conference on Software Engineering, pp. 146–155. ACM, New York (2005)
Cohen, M.B., Colbourn, C.J., Gibbons, P.B., Mugridge, W.B.: Constructing test suites for interaction testing. In: ICSE, pp. 38–48 (2003)
Nurmela, K.: Upper bounds for covering arrays by tabu. Discrete Applied Mathematics 138(1-2), 143–152 (2004)
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 14(2), 124–138 (2006)
Sherwood, G.B.: Optimal and near-optimal mixed covering arrays by column expansion. Discrete Mathematics 308(24), 6022–6035 (2008), http://www.sciencedirect.com/science/article/B6V00-4RFD3S4-3/2/c6824765b1ecc8edcef07ee1fbc00717
Fouché, S., Cohen, M.B., Porter, A.A.: Incremental covering array failure characterization in large configuration spaces. In: ISSTA, pp. 177–188 (2009)
Lei, Y., Kacker, R., Kuhn, D.R., Okum, V., Lawrence, J.: IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing. Software Testing Verification and Reliability 18(3), 125–148 (2008)
“Jenny combinatorial tool”, http://www.burtleburtle.net/bob/math/jenny.html
Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. DMATH: Discrete Mathematics 284(1-3), 149–156 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Calvagna, A., Tramontana, E. (2015). A Framework for Incremental Covering Arrays Construction. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds) Software Engineering in Intelligent Systems. Advances in Intelligent Systems and Computing, vol 349. Springer, Cham. https://doi.org/10.1007/978-3-319-18473-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-18473-9_28
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18472-2
Online ISBN: 978-3-319-18473-9
eBook Packages: EngineeringEngineering (R0)