Cited in
(75)- Constructing strength three covering arrays with augmented annealing
- Problems and algorithms for covering arrays via set covers
- Constraint models for the covering test problem
- Randomized post-optimization of covering arrays
- Recent Advances in Constraints
- Construction of mixed covering arrays of variable strength using a tabu search approach
- On a combinatorial framework for fault characterization
- Attribute-efficient learning of Boolean functions from Post closed classes
- On the state of strength-three covering arrays
- scientific article; zbMATH DE number 2038701 (Why is no real title available?)
- An efficient design and implementation of the in-parameter-order algorithm
- Heuristically enhanced IPO algorithms for covering array generation
- Products of mixed covering arrays of strength two
- Difference covering arrays and pseudo-orthogonal Latin squares
- Cover starters for covering arrays of strength two
- The test suite generation problem: optimal instances and their implications
- Binary Covering Arrays and Existentially Closed Graphs
- Tabu search for the cyclic bandwidth problem
- Heterogeneous hash families and covering arrays
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
- Constructing heterogeneous hash families by puncturing linear transversal designs
- Covering arrays of strength 3 and 4 from holey difference matrices
- Upper bounds for covering arrays by tabu search.
- Strength two covering arrays: existence tables and projection
- Tabu search for covering arrays using permutation vectors
- A formal logic approach to constrained combinatorial testing
- A greedy algorithm to construct covering arrays using a graph representation
- Linear hash families and forbidden configurations
- New techniques for designing qualitatively independent systems
- A survey of methods for constructing covering arrays
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Roux-type constructions for covering arrays of strengths three and four
- CAgen
- Mixed covering arrays on 3-uniform hypergraphs
- Covering arrays via set covers
- Problems and algorithms for covering arrays
- SAL
- TweetNaCl
- SAcb
- TScb
- Merging covering arrays and compressing multiple sequence alignments
- Improving two recursive constructions for covering arrays
- MUDD
- A Logic-Based Approach to Combinatorial Testing with Constraints
- Mixed covering arrays of strength three with few factors
- A survey on the problems and algorithms for covering arrays via set covers
- ACTS
- Geno
- TVG
- PinPoint
- Constructions of new orthogonal arrays and covering arrays of strength three
- Factorials experiments, covering arrays, and combinatorial testing
- Pattern matching with don't cares and few errors
- Classification of orthogonal arrays by integer programming
- Mixed optimization combinatorial method for constructing covering arrays
- A new method for constructing pair-wise covering designs for software testing
- Algorithmic methods for covering arrays of higher index
- An adaptive algorithm for group testing for complexes
- Software and hardware testing using combinatorial covering suites
- On (\(g\), 4; 1)-difference matrices
- Constructions of difference covering arrays.
- Structures and lower bounds for binary covering arrays
- Algebraic modelling of covering arrays
- scientific article; zbMATH DE number 1286223 (Why is no real title available?)
- Improved strength four covering arrays with three symbols
- Automation of broad sanity test generation
- Cost-efficient mixed-level covering designs for testing experiments
- Computational Science – ICCS 2005
- Fault detection and localization using Modelica and abductive reasoning
- Faulty interaction identification via constraint solving and optimization
- scientific article; zbMATH DE number 2088728 (Why is no real title available?)
- Mutually unbiased maximally entangled bases from difference matrices
- A primer on the application of neural networks to covering array generation
- Mixed covering arrays on graphs of small treewidth
- Model Based Testing for Agent Systems
This page was built for software: AETG
