A Logic-Based Approach to Combinatorial Testing with Constraints
From MaRDI portal
Recommendations
Cites work
- Computer Aided Verification
- Constraint models for the covering test problem
- scientific article; zbMATH DE number 1951195 (Why is no real title available?)
- Orthogonal Arrays of Strength two and three
- Problems and algorithms for covering arrays
- Software and hardware testing using combinatorial covering suites
- Upper bounds for covering arrays by tabu search.
- Using Model Checking to Generate Fault Detecting Tests
Cited in
(9)- Catnap: generating test suites of constrained combinatorial testing with answer set programming
- A constraint programming approach to extract the maximum number of non-overlapping test forms
- Faulty interaction identification via constraint solving and optimization
- State coverage metrics for specification-based testing with Büchi automata
- scientific article; zbMATH DE number 2013397 (Why is no real title available?)
- 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
- A feature commonality-based search strategy to find high t-wise covering solutions in feature models
This page was built for publication: A Logic-Based Approach to Combinatorial Testing with Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458811)