Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Experimental designs in software engineering: d-optimal designs and covering arrays
Proceedings of the 2004 ACM workshop on Interdisciplinary software engineering research
Constraint Models for the Covering Test Problem
Constraints
The test suite generation problem: Optimal instances and their implications
Discrete Applied Mathematics
A backtracking search tool for constructing combinatorial test suites
Journal of Systems and Software
Orthogonal array application for optimal combination of software defect detection techniques choices
WSEAS Transactions on Computers
A Formal Approach to Robustness Testing of Network Protocol
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Strength Two Covering Arrays Construction Using a SAT Representation
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
A systematic review of search-based testing for non-functional system properties
Information and Software Technology
Assessing IRPS as an efficient pairwise test data generation strategy
International Journal of Advanced Intelligence Paradigms
Generation of pairwise test sets using a simulated bee colony algorithm
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
A new strategy for pairwise test case generation
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
CoGenTe: a tool for code generator testing
Proceedings of the IEEE/ACM international conference on Automated software engineering
Memetic algorithms for constructing binary covering arrays of strength three
EA'09 Proceedings of the 9th international conference on Artificial evolution
Automated incremental pairwise testing of software product lines
SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
MiTS: a new approach of tabu search for constructing mixed covering arrays
MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Covering arrays generation methods survey
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Construction of mixed covering arrays of variable strength using a tabu search approach
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
A heuristic approach for constructing ternary covering arrays using trinomial coefficients
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Information Sciences: an International Journal
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
Efficiently exploring compiler optimization sequences with pairwise pruning
Proceedings of the 1st International Workshop on Adaptive Self-Tuning Computing Systems for the Exaflop Era
A variable strength interaction test suites generation strategy using Particle Swarm Optimization
Journal of Systems and Software
A heuristic test data generation approach for program fault localization
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I
Controllable combinatorial coverage in grammar-based testing
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Generating model-based test cases from natural language requirements for space application software
Software Quality Control
Information and Software Technology
Optimal shortening of covering arrays
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Constraint-Based approaches to the covering test problem
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Combining model-based and combinatorial testing for effective test case generation
Proceedings of the 2012 International Symposium on Software Testing and Analysis
Pairwise testing for software product lines: comparison of two approaches
Software Quality Control
Model-based pairwise testing for feature interaction coverage in software product line engineering
Software Quality Control
T-wise combinatorial interaction test suites construction based on coverage inheritance
Software Testing, Verification & Reliability
Mixed optimization combinatorial method for constructing covering arrays
Programming and Computing Software
Hi-index | 0.00 |
Pairwise testing (or 2-way testing) is a specification-based testing criterion, which requires that for each pair of input parameters of a system, every combination of valid values of these two parameters be covered by at least one test case. Empirical results show that pairwise testing is practical and effective for various types of software systems. In this paper, we show that the problem of generating a minimum test set for pairwise testing is NP-complete. We propose a test generation strategy, called in-parameter-order (or IPO), for pairwise testing. For a system with two or more input parameters, the IPO strategy generates a pairwise test set for the first two parameters, extends the test set to generate a pairwise test set for the first three parameters, and continues to do so for each additional parameter. The IPO strategy allows the use of local optimization techniques for test generation and the reuse of existing tests when a system is extended with new parameters or new values of existing parameters. We present practical, IPO-based test generation algorithms. We describe the implementation of an IPO-based test generation tool and show some empirical results.