Authors
Caleb King (1), Joseph Morgan (1) and Ryan Lekivetz (1)
Affiliations
(1) JMP Statistical Discovery LLC
Journal
2019 IEEE 19th International Conference on Software Quality, Reliability and Security Companion (QRS-C)
Date Published
2019
Abstract
Test engineers are often faced with the challenge of selecting test cases that maximize the chance of discovering faults while working within a limited budget. Combinatorial testing is an effective test case selection strategy to address this challenge. The basic idea is to select test cases that ensure that all possible combinations of settings from two (or more) inputs are accounted for, regardless of which subset of inputs are selected. This is accomplished by using a covering array as the test case selection mechanism. However, for any given testing scenario, there are usually several alternative covering arrays that may satisfy budgetary and coverage requirements. Unfortunately, it is often unclear how to choose from these alternatives. Practitioners often want a way to explore how the input space is being covered to decide which alternative is best suited for the testing scenario. In this paper we propose a graphical method that may be used to evaluate binary covering arrays. The method allows practitioners to visualize input space coverage for inputs of interest. We illustrate the method with several examples.
Citation
King, C., Morgan, J. and Lekivetz, R., 2019, July. Design Fractals: A Graphical Method for Evaluating Binary Covering Arrays. In 2019 IEEE 19th International Conference on Software Quality, Reliability and Security Companion (QRS-C) (pp. 185-190). IEEE, https://doi.org/10.1109/QRS-C.2019.00046.