A survey of combinatorial testing
From MaRDI portal
Publication:2875046
DOI10.1145/1883612.1883618zbMath1293.68080MaRDI 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
68R05: Combinatorics in computer science
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68N99: Theory of software
Related Items
Upper Bounds on the Size of Covering Arrays, Detecting arrays for effects of single factors, Hardness results for covering arrays avoiding forbidden edges and error-locating arrays, Cover starters for covering arrays of strength two, On a combinatorial framework for fault characterization, Asymptotic and constructive methods for covering perfect hash families and covering arrays, Strengthening hash families and compressive sensing, Constraint games for stable and optimal allocation of demands in SDN, Probabilistic and systematic coverage of consecutive test-method pairs for detecting order-dependent flaky tests, Factorials experiments, covering arrays, and combinatorial testing, Algorithmic methods for covering arrays of higher index, A greedy algorithm to construct covering arrays using a graph representation, Do judge a test by its cover. Combining combinatorial and property-based testing, Improved covering arrays using covering perfect hash families with groups of restricted entries, Arrays for combinatorial interaction testing: a review on constructive approaches, Resolvable covering arrays, A survey on the problems and algorithms for covering arrays via set covers, Disjoint Spread Systems and Fault Location, MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays, Covering arrays, augmentation, and quilting arrays
