ABSTRACT

This chapter introduces some general strategies for covering array construction, and explains two widely used algorithms, namely, AETG and IPOG. We also present several practical considerations in covering array construction, including constraint handling, mixed-strength covering array, and covering array extension.