A logic-model semantics for SCR software requirements
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
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
Using model checking to generate tests from requirements specifications
ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
A Test Generation Strategy for Pairwise Testing
IEEE Transactions on Software Engineering
Determination of Test Configurations for Pair-Wise Interaction Coverage
TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
A Measure for Component Interaction Test Coverage
AICCSA '01 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications
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
Upper bounds for covering arrays by tabu search
Discrete Applied Mathematics
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
Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
Issues in using model checkers for test case generation
Journal of Systems and Software
Interaction Coverage Meets Path Coverage by SMT Constraint Solving
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
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)
Feedback driven adaptive combinatorial testing
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Using binary decision diagrams for combinatorial test design
Proceedings of the 2011 International Symposium on Software Testing and Analysis
State coverage metrics for specification-based testing with Büchi automata
TAP'11 Proceedings of the 5th international conference on Tests and proofs
Model-based testing of industrial transformational systems
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
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
| Hi-index | 0.00 |
Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are constructed by combining tuples of assignments of the different input parameters, based on some effective combinatorial strategy. The most commonly used strategy is two-way (pairwise) coverage, requiring all combinations of valid assignments for all possible pairs of input parameters to be covered by at least one test case. In this paper a new heuristic strategy developed for the construction of pairwise covering test suites is presented, featuring a new approach to support expressive constraining over the input domain. Moreover, it allows the inclusion or exclusion of ad-hoc combinations of parameter bindings to let the user customize the test suite outcome. Our approach is tightly integrated with formal logic, since it uses test predicates to formalize combinatorial testing as a logic problem, and applies an external model checker tool to solve it. The proposed approach is supported by a prototype tool implementation, and early results of experimental assessment are also presented.