A survey of combinatorial testing
From MaRDI portal
Recommendations
- Automatic Generation of Combinatorial Test Data
- Faulty interaction identification via constraint solving and optimization
- A formal logic approach to constrained combinatorial testing
- Arrays for combinatorial interaction testing: a review on constructive approaches
- A two-stage algorithm for combinatorial testing
Cited in
(36)- 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
- Covering arrays: using prior information for construction, evaluation and to facilitate fault localization
- 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
- Design of test inputs and their sequences in multi-function system testing
- Disjoint spread systems and fault location
- Faulty interaction identification via constraint solving and optimization
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
- Applying higher strength combinatorial criteria to test case prioritization: a case study
- Covering arrays, augmentation, and quilting arrays
- On Sample-Based Testers
- Lattice-based semantics for combinatorial model evolution
- scientific article; zbMATH DE number 2013397 (Why is no real title available?)
- Why pairwise testing works so well: a possible theoretical explanation of an empirical phenomenon
- Global optimization for combination test suite by cluster searching algorithm
- Upper bounds on the size of covering arrays
- Cyclic consecutive orthogonal arrays
- A Logic-Based Approach to Combinatorial Testing with Constraints
- Combinatorial testing: using blocking to assign test cases for validating complex software systems
- On combinatorial testing problems
- Detecting arrays for effects of single factors
- A formal logic approach to constrained combinatorial testing
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
- A feature commonality-based search strategy to find high t-wise covering solutions in feature models
- Detecting arrays for effects of multiple interacting factors
- Cover starters for covering arrays of strength two
This page was built for publication: A survey of combinatorial testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875046)
