Skip to main content

ASU Electronic Theses and Dissertations


This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.

In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.

Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.


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 …

Contributors
Karia, Rushang Vinod, Colbourn, Charles J, Syrotiuk, Violet, et al.
Created Date
2015