Practical Combinatorial Testing: Beyond Pairwise
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
With new algorithms and tools, developers can apply high-strength combinatorial testing to detect elusive failures that occur only when multiple components interact. In pairwise testing, all possible pairs of parameter values are covered by at least one test, and good tools are available to generate arrays with the value pairs. In the past few years, advances in covering-array algorithms, integrated with model checking or other testing approaches, have made it practical to extend combinatorial testing beyond pairwise tests. The US National Institute of Standards and Technology (NIST) and the University of Texas, Arlington, are now distributing freely available methods and tools for constructing large t-way combination test sets (known as covering arrays), converting covering arrays into executable tests, and automatically generating test oracles using model checking (http://csrc.nist.gov/acts). In this review, we focus on real-world problems and empirical results from applying these methods and tools.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Software fault interactions and implications for software testing
Kuhn, D. R., Wallace, D. R., & Gallo, A. M. (2004) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2004.24 · Cited by 789
Fuzzing: Brute Force Vulnerability Discovery
Sutton, M. J. D., Greene, A., & Amini, P. (2007) · Medical Entomology and Zoology · Cited by 548
JML: A Notation for Detailed Design
Leavens, G. T., Baker, A. L., & Ruby, C. (1999) · Behavioral Specifications of Businesses and Systems · doi:10.1007/978-1-4615-5229-1_12 · Cited by 417
Abstracting formal specifications to generate software tests via model checking
Ammann, P., & Black, P. E. (2003) · IEEE/AIAA Digital Avionics Systems Conference (DASC) · doi:10.1109/dasc.1999.822091 · Cited by 41
Cited by
Graduate Theses and Dissertations
Davis, M., Davis, K. J., & Dunagan, M. M. (2012) · Scientific Papers and Presentations · doi:10.1016/b978-0-12-384727-0.00006-9 · Cited by 164
CarFast: achieving higher statement coverage faster
Park, S., Hossain, B. M. M., Hussain, I., Csallner, C., Grechanik, M., Taneja, K., Fu, C., & Xie, Q. (2012) · Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering · doi:10.1145/2393596.2393636 · Cited by 55
Automated infrastructure as code program testing
Sokolowski, D., Spielmann, D., & Salvaneschi, G. (2024) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2024.3393070 · Cited by 20
“Kuhn et al. [100] found that most bugs are caused by the interaction of only a few parameters, motivating combinatorial testing [101], which Goldstein et al. [34] applied to PBT generators by modifying the random generator distributions.”
Background
Metadata
- Authors
- Kuhn, R., Lei, Y., & Kacker, R.
- Venue
- IT Professional
- Published
- 2008-05
- Volume
- 10
- Issue
- 3
- Pages
- 19-23
- ISSN
- 1520-9202 (ISSN-L)
- OpenAlex
- W2014973576
- Cited by
- 194
- References
- 4
- FWCI
- 46.17
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.