Skip to main content

Covering Arrays: Generation and Post-optimization


Abstract Exhaustive testing is generally infeasible except in the smallest of systems. Research

has shown that testing the interactions among fewer (up to 6) components is generally

sufficient while retaining the capability to detect up to 99% of defects. This leads to a

substantial decrease in the number of tests. Covering arrays are combinatorial objects

that guarantee that every interaction is tested at least once.

In the absence of direct constructions, forming small covering arrays is generally

an expensive computational task. Algorithms to generate covering arrays have been

extensively studied yet no single algorithm provides the smallest solution. More

recently research has been directed towards a new technique called post-optimizatio... (more)
Created Date 2015
Contributor Karia, Rushang Vinod (Author) / Colbourn, Charles J (Advisor) / Syrotiuk, Violet (Committee member) / Richa, Andrea W (Committee member) / Arizona State University (Publisher)
Subject Computer science / combinatorial optimization / covering arrays / post-optimization / quilting arrays
Type Masters Thesis
Extent 58 pages
Language English
Copyright
Reuse Permissions All Rights Reserved
Note Masters Thesis Computer Science 2015
Collaborating Institutions Graduate College / ASU Library
Additional Formats MODS / OAI Dublin Core / RIS


  Full Text
522.4 KB application/pdf
Download Count: 673

Description Dissertation/Thesis