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
Model-based testing in practice
Proceedings of the 21st international conference on Software engineering
Test set size minimization and fault detection effectiveness: a case study in a space application
Journal of Systems and Software
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
An Investigation of the Applicability of Design of Experiments to Software Testing
SEW '02 Proceedings of the 27th Annual NASA Goddard Software Engineering Workshop (SEW-27'02)
Model-based Testing of a Highly Programmable System
ISSRE '98 Proceedings of the The Ninth International Symposium on Software Reliability Engineering
Augmenting Simulated Annealing to Build Interaction Test Suites
ISSRE '03 Proceedings of the 14th International Symposium on Software Reliability Engineering
Software Fault Interactions and Implications for Software Testing
IEEE Transactions on Software Engineering
A framework of greedy methods for constructing interaction test suites
Proceedings of the 27th international conference on Software engineering
Modeling requirements for combinatorial software testing
A-MOST '05 Proceedings of the 1st international workshop on Advances in model-based testing
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
IEEE Transactions on Software Engineering
Using spin to generate tests from ASM specifications
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Using model checking to generate fault detecting tests
TAP'07 Proceedings of the 1st 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
Evaluating improvements to a meta-heuristic search for constrained interaction testing
Empirical Software Engineering
A survey of methods for constructing covering arrays
Programming and Computing Software
An algorithm for generating t-wise covering arrays from large feature models
Proceedings of the 16th International Software Product Line Conference - Volume 1
Pairwise testing for software product lines: comparison of two approaches
Software Quality Control
T-wise combinatorial interaction test suites construction based on coverage inheritance
Software Testing, Verification & Reliability
An orchestrated survey of methodologies for automated software test case generation
Journal of Systems and Software
Mixed optimization combinatorial method for constructing covering arrays
Programming and Computing Software
Hi-index | 0.01 |
Combinatorial interaction testing aims at revealing errors inside a system under test triggered by unintended interaction between values of its input parameters. In this context we defined a new greedy approach to generate a combinatorial interaction test suites in the presence of constraints, based on integration of an SMT solver, and ordered processing of test goals. Based on the observation that the processing order of required combinations determines the size of the final test suite, this approach has been then used as a framework to evaluate a set of deterministic ordering strategies, each based on a different heuristic optimization criteria. Their performance has been assessed and contrasted also with those of random and dummy ordering strategies. Results of experimental assessment are presented and compared with well-known combinatorial tools.