A survey of combinatorial testing

DOI10.1145/1883612.1883618zbMath1293.68080OpenAlexW2075699551MaRDI QIDQ2875046

Changhai Nie, Hareton K. N. Leung

Publication date: 13 August 2014

Published in: ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1883612.1883618

zbMATH Keywords

software testingcovering arraytest case generationcombinatorial testing (CT)

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of software (68N99)

Related Items

On a combinatorial framework for fault characterization, Covering arrays, augmentation, and quilting arrays, Strengthening hash families and compressive sensing, Detecting arrays for effects of single factors, A greedy algorithm to construct covering arrays using a graph representation, Hardness results for covering arrays avoiding forbidden edges and error-locating arrays, Do judge a test by its cover. Combining combinatorial and property-based testing, Asymptotic and constructive methods for covering perfect hash families and covering arrays, Constraint games for stable and optimal allocation of demands in SDN, Improved covering arrays using covering perfect hash families with groups of restricted entries, Probabilistic and systematic coverage of consecutive test-method pairs for detecting order-dependent flaky tests, Arrays for combinatorial interaction testing: a review on constructive approaches, Disjoint Spread Systems and Fault Location, Cover starters for covering arrays of strength two, Factorials experiments, covering arrays, and combinatorial testing, Resolvable covering arrays, A survey on the problems and algorithms for covering arrays via set covers, Algorithmic methods for covering arrays of higher index, MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays, Upper Bounds on the Size of Covering Arrays