Algebraic Models for Arbitrary Strength Covering Arrays over v-ary Alphabets
Extending our previous work , we introduce a novel technique to model and compute arbitrary strength covering arrays over v-ary alphabets, using methods arising from linear algebra commutative algebra and symbolic computation. Concrete instances of covering arrays for given parameters then appear as points in varieties as they occur in solutions of multivariate polynomial equation systems. To solve these systems we apply polynomial solvers based on the theory of Gröbner bases and exhaustive search using serial and parallel programming techniques.
KeywordsCovering arrays Algebraic models Solvers
This research was carried out partly in the context of the Austrian COMET K1 program and publicly funded by the Austrian Research Promotion Agency (FFG) and the Vienna Business Agency (WAW). Kotsireas and Zhereshchin are supported by an NSERC grant.
- 9.Kampel, L., Simos, D.E.: A survey on the state of the art of complexity problems for covering arrays. Theoret. Comput. Sci. (2018, to appear)Google Scholar
- 14.Lei, Y., Tai, K.C.: In-parameter-order: a test generation strategy for pairwise testing. In: Proceedings of the Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No. 98EX231), pp. 254–261 (1998)Google Scholar
- 17.Torres-Jimenez, J., Izquierdo-Marquez, I.: Survey of covering arrays. In: 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 20–27 (2013)Google Scholar