Abstract
A covering array (CA) is an N × k matrix over the alphabet v s.t. each N × 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 × 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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
