The following pages link to A survey of combinatorial testing (Q2875046):
Displaying 20 items.
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- On a combinatorial framework for fault characterization (Q1616211) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Constraint games for stable and optimal allocation of demands in SDN (Q2009195) (← links)
- Probabilistic and systematic coverage of consecutive test-method pairs for detecting order-dependent flaky tests (Q2044204) (← links)
- Factorials experiments, covering arrays, and combinatorial testing (Q2071532) (← links)
- Algorithmic methods for covering arrays of higher index (Q2103319) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- Do judge a test by its cover. Combining combinatorial and property-based testing (Q2233461) (← links)
- Improved covering arrays using covering perfect hash families with groups of restricted entries (Q2287570) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Resolvable covering arrays (Q2320870) (← links)
- A survey on the problems and algorithms for covering arrays via set covers (Q2333829) (← links)
- Disjoint Spread Systems and Fault Location (Q2830441) (← links)
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
- Covering arrays, augmentation, and quilting arrays (Q2920882) (← links)
- Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
