The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Machine Learning
Goal-Oriented Requirements Engineering: A Guided Tour
RE '01 Proceedings of the Fifth IEEE International Symposium on Requirements Engineering
Software Fault Interactions and Implications for Software Testing
IEEE Transactions 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
Input parameter modeling for combination strategies
SE'07 Proceedings of the 25th conference on IASTED International Multi-Conference: Software Engineering
IEEE Transactions on Software Engineering
Coverage criteria for state based specifications
Formal methods and testing
Automated incremental pairwise testing of software product lines
SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
Pairwise feature-interaction testing for SPLs: potentials and limitations
Proceedings of the 15th International Software Product Line Conference, Volume 2
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
SP 800-142. Practical Combinatorial Testing
SP 800-142. Practical Combinatorial Testing
Combinatorial Testing of ACTS: A Case Study
ICST '12 Proceedings of the 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation
Test-Case design by feature trees
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Hi-index | 0.00 |
In our previous work [17], we proposed a model-based combinatorial testing method, called FOT. It provides a technique to design test-models for combinatorial testing based on extended logic trees. In this paper, we introduce pair-wise testing (and by extension, n-wise testing, where n = 1, 2, ...) to FOT, by developing a technique to construct a test-suite of n-wise strategies from the test models in FOT. We take a "transformation approach" to realize this technique. To construct test suites, this approach first transforms test-models in FOT, represented as extended logic trees, to those in the formats which the existing n-wise testing tools (such as PICT [9], ACTS [30], CIT-BACH [31], etc.) accept to input, and then applies transformed test-models to any of these tools. In this transformation approach, an algorithm, called "flattening algorithm", plays a key role. We prove the correctness of the algorithm, and implement the algorithm to automate such test-suite constructions, providing a tool called FOT-nw (FOT with n-wise). Further, to show the effectiveness of the technique, we conduct a case study, where we apply FOT-nw to design test models and automatically construct test suites of n-wise strategies for an embedded system of stationary services for real-use in industry.