The category-partition method for specifying and generating fuctional tests
Communications of the ACM
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Prioritizing test cases for regression testing
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
Software Fault Interactions and Implications for Software Testing
IEEE Transactions on Software Engineering
Comparing the Fault Detection Effectiveness of N-way and Random Test Suites
ISESE '04 Proceedings of the 2004 International Symposium on Empirical Software Engineering
Test prioritization for pairwise interaction coverage
A-MOST '05 Proceedings of the 1st international workshop on Advances in model-based testing
Empirical Software Engineering
Covering Arrays for Efficient Fault Characterization in Complex Configuration Spaces
IEEE Transactions on Software Engineering
Constraint Models for the Covering Test Problem
Constraints
Pseudo-Exhaustive Testing for Software
SEW '06 Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop
Interaction testing of highly-configurable systems in the presence of constraints
Proceedings of the 2007 international symposium on Software testing and analysis
Test suite prioritization by interaction coverage
Workshop on Domain specific approaches to software test automation: in conjunction with the 6th ESEC/FSE joint meeting
Prioritizing User-Session-Based Test Cases for Web Applications Testing
ICST '08 Proceedings of the 2008 International Conference on Software Testing, Verification, and Validation
Configuration-aware regression testing: an empirical study of sampling and prioritization
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
IPOG-IPOG-D: efficient test generation for multi-way combinatorial testing
Software Testing, Verification & Reliability
IEEE Transactions on Software Engineering
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
Developing a Single Model and Test Prioritization Strategies for Event-Driven Software
IEEE Transactions on Software Engineering
Evaluating improvements to a meta-heuristic search for constrained interaction testing
Empirical Software Engineering
A software debugging method based on pairwise testing
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Regression testing minimization, selection and prioritization: a survey
Software Testing, Verification & Reliability
A Study in Prioritization for Higher Strength Combinatorial Testing
ICSTW '13 Proceedings of the 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops
Constructing test cases for n-wise testing from tree-based test models
Proceedings of the Fourth Symposium on Information and Communication Technology
| Hi-index | 0.00 |
Combinatorial Interaction Testing (CIT) is important because it tests the interactions between the many features and parameters that make up the configuration space of software systems. However, in order to be practically applicable, it must be able to cater for soft and hard real-world constraints and should, ideally, report a test priority order that maximises earliest fault detection. We show that we can achieve the highest strength CIT in 5.65 minutes on average. This was previously thought to be too computationally expensive to be feasible. Furthermore, we show that higher strength suites find more faults, while prioritisations using lower strengths are no worse at achieving early fault revelation.