Introduction to combinatorial testing

MaRDI QIDQ5300606zbMATH OpenFDO

Authors D. Richard Kuhn, Raghu Kacker, Yu Lei

Publication date 27 June 2013

Full work available at URL http://proquest.tech.safaribooksonline.de/9781466552302

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatorics in computer science (68R05)

Recommendations

• scientific article; zbMATH DE number 2020403
• Automatic Generation of Combinatorial Test Data
• Analytic methods in systems and software testing
• Guide to advanced software testing.
• Practical Software Testing

Cited in

(27)

• On a combinatorial framework for fault characterization
• Weighted \(t\)-way sequences
• Algebraic techniques for covering arrays and related structures
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Factorials experiments, covering arrays, and combinatorial testing
• Algorithmic methods for covering arrays of higher index
• Heuristically enhanced IPO algorithms for covering array generation
• Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
• Cost-efficient mixed-level covering designs for testing experiments
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Problems and algorithms for covering arrays via set covers
• Covering arrays, augmentation, and quilting arrays
• scientific article; zbMATH DE number 1106308 (Why is no real title available?)
• scientific article; zbMATH DE number 2013397 (Why is no real title available?)
• Algebraic modelling of covering arrays
• IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation
• A primer on the application of neural networks to covering array generation
• Subspace restrictions and affine composition for covering perfect hash families
• Upper bounds on the size of covering arrays
• Combinatorial testing: using blocking to assign test cases for validating complex software systems
• On combinatorial testing problems
• Combinatorial sequences for disaster scenario generation
• A feature commonality-based search strategy to find high t-wise covering solutions in feature models
• Covering array on the Cartesian product of hypergraphs
• Mixed-level covering, locating, and detecting arrays via cyclotomy
• Detecting arrays for effects of multiple interacting factors
• Algebraic and SAT models for SCA generation

This page was built for publication: Introduction to combinatorial testing

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