Cooling schedules for optimal annealing
Mathematics of Operations Research
Simulated annealing: theory and applications
Simulated annealing: theory and applications
The category-partition method for specifying and generating fuctional tests
Communications of the ACM
Software testing techniques (2nd ed.)
Software testing techniques (2nd ed.)
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Computers and Operations Research
Automatic test data generation for path testing using GAs
Information Sciences: an International Journal
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)
Designs, Codes and Cryptography
Software Fault Interactions and Implications for Software Testing
IEEE Transactions on Software Engineering
Roux-type constructions for covering arrays of strengths three and four
Designs, Codes and Cryptography
IPOG: A General Strategy for T-Way Software Testing
ECBS '07 Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems
The test suite generation problem: Optimal instances and their implications
Discrete Applied Mathematics
The density algorithm for pairwise interaction testing: Research Articles
Software Testing, Verification & Reliability
Software testing processes as a linear dynamic system
Information Sciences: an International Journal
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
Computers and Operations Research
Search based software testing of object-oriented containers
Information Sciences: an International Journal
A rigorous approach towards test case generation
Information Sciences: an International Journal
A density-based greedy algorithm for higher strength covering arrays
Software Testing, Verification & Reliability
Binary Covering Arrays and Existentially Closed Graphs
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Upper bounds for covering arrays by tabu search
Discrete Applied Mathematics
Memetic algorithms for constructing binary covering arrays of strength three
EA'09 Proceedings of the 9th international conference on Artificial evolution
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
Information Sciences: an International Journal
Vector sets for exhaustive testing of logic circuits
IEEE Transactions on Information Theory
Supercomputing and grid computing on the verification of covering arrays
The Journal of Supercomputing
Hi-index | 0.07 |
Covering arrays (CAs) are combinatorial structures specified as a matrix of N rows and k columns over an alphabet on v symbols such that for each set of t columns (called the strength of the array) every t-tuple of symbols is covered. Recently they have been used to represent interaction test suites for software testing given that they provide economical sized test cases while still preserving important fault detection capabilities. This paper introduces an improved implementation of a simulated annealing algorithm, called ISA, for constructing CAs of strengths three through six over a binary alphabet (i.e., binary CAs). Extensive experimentation is carried out, using 127 well-known benchmark instances, for assessing its performance with respect to an existing simulated annealing implementation, a greedy method, and five state-of-the-art algorithms. The results show that our algorithm attains 104 new bounds and equals the best-known solutions for the other 23 instances consuming reasonable computational time. Furthermore, the implications of using these results as ingredients to recursive constructions are also analyzed.