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
Factor-covering designs for testing software
Technometrics
Model-based testing in practice
Proceedings of the 21st international conference on Software engineering
A new method for constructing pair-wise covering designs for software testing
Information Processing Letters
In-Parameter-Order: A Test Generation Strategy for Pairwise Testing
HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems Engineering
Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
A practical strategy for testing pair-wise coverage of network interfaces
ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability Engineering
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
One-test-at-a-time heuristic search for interaction test suites
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Generating combinatorial test suite for interaction relationship
Fourth international workshop on Software quality assurance: in conjunction with the 6th ESEC/FSE joint meeting
A backtracking search tool for constructing combinatorial test suites
Journal of Systems and Software
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
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
Verification of general and cyclic covering arrays using grid computing
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
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
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
Information Sciences: an International Journal
The Minimal Failure-Causing Schema of Combinatorial Testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
A variable strength interaction test suites generation strategy using Particle Swarm Optimization
Journal of Systems and Software
Automatic test generation for n-way combinatorial testing
QoSA'05 Proceedings of the First international conference on Quality of Software Architectures and Software Quality, and Proceedings of the Second International conference on Software Quality
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
Supercomputing and grid computing on the verification of covering arrays
The Journal of Supercomputing
Automated test generation for multi-state systems
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Artificial life and cellular automata based automated test case generator
ACM SIGSOFT Software Engineering Notes
Hi-index | 0.01 |
Combinatorial testing is a specification-based testing criterion, which requires that for each t-way combination of input parameters of a system, every combination of valid values of these t parameters be covered by at least one test case. This approach is motivated by the observation that in many applications a significant number of faults are caused by interactions of a smaller number of parameters. In this paper, we propose new test generation algorithms for combinatorial testing based on two artificial life techniques: a genetic algorithm (GA) and an ant colony algorithm (ACA). The usefulness of these algorithms is demonstrated through experiments. In the case t = 3 in particular, our algorithms exhibited impressive results.