Applying design of experiments to software testing: experience report
ICSE '97 Proceedings of the 19th international conference on Software engineering
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Factor-covering designs for testing software
Technometrics
Model-based testing in practice
Proceedings of the 21st international conference on Software engineering
A framework of greedy methods for constructing interaction test suites
Proceedings of the 27th international conference on Software engineering
Interaction testing of highly-configurable systems in the presence of constraints
Proceedings of the 2007 international symposium on Software testing and analysis
Cross feature testing in database systems
Proceedings of the 1st international workshop on Testing database systems
Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
A logic-based approach to combinatorial testing with constraints
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
A Formal Logic Approach to Constrained Combinatorial Testing
Journal of Automated Reasoning
The Minimal Failure-Causing Schema of Combinatorial Testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
T-wise combinatorial interaction test suites construction based on coverage inheritance
Software Testing, Verification & Reliability
| Hi-index | 0.00 |
The combinatorial approach to software testing uses models to generate a minimal number of test inputs so that selected combinations of input values are covered. The most common coverage criteria is two-way, or pairwise coverage of value combinations, though for higher confidence three-way or higher coverage may be required. This paper presents example system requirements and corresponding models for applying the combinatorial approach to those requirements. These examples are intended to serve as a tutorial for applying the combinatorial approach to software testing. Although this paper focuses on pairwise coverage, the discussion is equally valid when higher coverage criteria such as three-way (triples) are used. We use terminology and modeling notation from the AETG1 system to provide concrete examples.