Software and hardware testing using combinatorial covering suites
From MaRDI portal
Publication:3374252
Recommendations
Cited in
(52)- Covering arrays of strength 3 and 4 from holey difference matrices
- Linear hash families and forbidden configurations
- Merging covering arrays and compressing multiple sequence alignments
- On a combinatorial framework for fault characterization
- Improved strength four covering arrays with three symbols
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Randomized post-optimization of covering arrays
- Covering arrays of strength three from extended permutation vectors
- Problems and algorithms for covering arrays
- Mixed optimization combinatorial method for constructing covering arrays
- Factorials experiments, covering arrays, and combinatorial testing
- A greedy algorithm to construct covering arrays using a graph representation
- Covering array EXtender
- Consecutive covering arrays and a new randomness test
- Bipartite locating array
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Resolvable covering arrays
- Optimality and constructions of locating arrays
- Improving two recursive constructions for covering arrays
- Tower of covering arrays
- Mixed covering arrays on 3-uniform hypergraphs
- Locating and detecting arrays for interaction faults
- Strength two covering arrays: existence tables and projection
- Classification of orthogonal arrays by integer programming
- Disjoint spread systems and fault location
- Construction of non-isomorphic covering arrays
- Coloured and directed designs
- Constructing heterogeneous hash families by puncturing linear transversal designs
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
- Mixed covering arrays on graphs of small treewidth
- A two-stage algorithm for combinatorial testing
- Non-uniform covering array with symmetric forbidden edge constraints
- Locating one pairwise interaction: three recursive constructions
- Binary Covering Arrays and Existentially Closed Graphs
- 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
- A formal logic approach to constrained combinatorial testing
- Covering array on the Cartesian product of hypergraphs
- An efficient screening method for identifying parameters and interactions that impact wireless network performance
- Mixed-level covering, locating, and detecting arrays via cyclotomy
- Detecting arrays for effects of multiple interacting factors
- New families of strength-3 covering arrays using linear feedback shift register sequences
- Covering and radius-covering arrays: constructions and classification
- A survey of methods for constructing covering arrays
- Cover starters for covering arrays of strength two
- Roux-type constructions for covering arrays of strengths three and four
- Augmentation of covering arrays of strength two
- Constructing new covering arrays from LFSR sequences over finite fields
- Tabu search for covering arrays using permutation vectors
- Constructions of new orthogonal arrays and covering arrays of strength three
- Covering arrays from cyclotomy
This page was built for publication: Software and hardware testing using combinatorial covering suites
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374252)
