Abstract
A covering array (CA) is an N x k matrix over the alphabet v s.t. each N x k subset contains at least one time each vt combination. Covering Arrays (CAs) have been applied mainly in software and hardware testing. The construction of CAs requires to do the verification that each N x t subset contains at least one time each vt combination. In this paper we present a sequential algorithm and a grid algorithm to do the CA verification. The algorithms were tested using a benchmark of CAs of variable strength. The main conclusion of the paper lies in the identification of the strengths and weakness of our algorithms (related to the values of the CA parameters). © 2010 Springer-Verlag.
Cite
CITATION STYLE
Avila-George, H., Torres-Jimenez, J., Hernández, V., & Rangel-Valdez, N. (2010). Verification of general and cyclic covering arrays using grid computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6265 LNCS, pp. 112–123). https://doi.org/10.1007/978-3-642-15108-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
