The test suite generation problem: optimal instances and their implications

DOI10.1016/J.DAM.2007.04.010MaRDI QIDQ2381816zbMATH OpenOpenAlexFDO

Authors Christine T. Cheng

Publication date 19 September 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.04.010

zbMATH Keywords

generating test suitesmixed covering arrays for hypergraphsorthogonal arrays

Mathematics Subject Classification ID

Hypergraphs (05C65) Theory of software (68N99) Combinatorics in computer science (68R05)

Recommendations

• The complexity of generating test instances
• scientific article; zbMATH DE number 1332677
• On the complexity of test case generation for NP-hard problems

Cites work

• Algorithms and Computation
• Constructions of (t,m,s)-nets and (t,s)-sequences
• Covering arrays on graphs
• Covering arrays with mixed alphabet sizes
• Discrépance de suites associées à un système de numération (en dimension s)
• Geometric discrepancy. An illustrated guide
• Mixed covering arrays on graphs
• Orthogonal Arrays of Index Unity
• Vector sets for exhaustive testing of logic circuits

Cited in

(6)

• A survey on the problems and algorithms for covering arrays via set covers
• On Sample-Based Testers
• Divisibility of polynomials over finite fields and combinatorial applications
• scientific article; zbMATH DE number 1332677 (Why is no real title available?)
• Global optimization for combination test suite by cluster searching algorithm
• Algorithms and Computation

Describes a project that uses

Uses Software

• AETG

This page was built for publication: The test suite generation problem: optimal instances and their implications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2381816)