A logic-model semantics for SCR software requirements
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Applying design of experiments to software testing: experience report
ICSE '97 Proceedings of the 19th international conference on Software engineering
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
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
Symbolic Model Checking
A Test Generation Strategy for Pairwise Testing
IEEE Transactions on Software Engineering
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
Formulation of the Interaction Test Coverage Problem as an Integer Program
TestCom '02 Proceedings of the IFIP 14th International Conference on Testing Communicating Systems XIV
Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
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
Software Fault Interactions and Implications for Software Testing
IEEE Transactions on Software Engineering
Generating Efficient Test Sets with a Model Checker
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
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
Using LTL rewriting to improve the performance of model-checker based test-case generation
Proceedings of the 3rd international workshop on Advances in model-based testing
Exploiting Constraint Solving History to Construct Interaction Test Suites
TAICPART-MUTATION '07 Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION
IEEE Transactions on Software Engineering
Ordering Coverage Goals in Model Checker Based Testing
ICSTW '08 Proceedings of the 2008 IEEE International Conference on Software Testing Verification and Validation Workshop
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
A logic-based approach to combinatorial testing with constraints
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Optimizing the automatic test generation by SAT and SMT solving for Boolean expressions
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
An orchestrated survey of methodologies for automated software test case generation
Journal of Systems and Software
Hi-index | 0.00 |
Combinatorial testing is as an effective testing technique to reveal failures in a given system, based on input combinations coverage and combinatorial optimization. Combinatorial testing of strength t (t驴驴驴2) requires that each t-wise tuple of values of the different system input parameters is covered by at least one test case. Combinatorial test suite generation algorithms aim at producing a test suite covering all the required tuples in a small (possibly minimal) number of test cases, in order to reduce the cost of testing. The most used combinatorial technique is the pairwise testing (t驴=驴2) which requires coverage of all pairs of input values. Constrained combinatorial testing takes also into account constraints over the system parameters, for instance forbidden tuples of inputs, modeling invalid or not realizable input values combinations. In this paper a new approach to combinatorial testing, tightly integrated with formal logic, is presented. In this approach, test predicates are used to formalize combinatorial testing as a logical problem, and an external formal logic tool is applied to solve it. Constraints over the input domain are expressed as logical predicates too, and effectively handled by the same tool. Moreover, inclusion or exclusion of select tuples is supported, allowing the user to customize the test suite layout. The proposed approach is supported by a prototype tool implementation and results of experimental assessment are also presented.