Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Factor-covering designs for testing software
Technometrics
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Software Testing: A Craftman's Approach
Software Testing: A Craftman's Approach
In-Parameter-Order: A Test Generation Strategy for Pairwise Testing
HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems 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
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A practical strategy for testing pair-wise coverage of network interfaces
ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability Engineering
Constraint Models for the Covering Test Problem
Constraints
Algorithms for covering arrays
Algorithms for covering arrays
Upper bounds for covering arrays by tabu search
Discrete Applied Mathematics
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
A simulated annealing algorithm for the problem of minimal addition chains
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
A mutation-selection algorithm for the problem of minimum brauer chains
MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II
| Hi-index | 0.00 |
According to the NIST report of 2002 there is a great potential to reduce the cost, and to increase the quality of the software developed in USA through the creation of automated tools that help in the software testing process. One alternative to improve the software testing process is the creation of tools that generate testing cases in an automatic way. Through the construction of Covering Arrays (CA) it is possible to obtain a minimum set of test cases with the maximum possibility of testing all the functionality of the developed software.In this paper an approach to construct CA using the propositional satisfiability problem (SAT) is presented. The approach starts with the transformation of a CA instance into a non-conjunctive normal form (non-CNF) SAT instance. Then the SAT instance is solved through a non-CNF SAT solver, and finally the SAT solution is transformed into a CA solution. The main contributions of this work are: an efficient non-CNF SAT solver able to equals or improves previously reported results, and a simplified SAT representation to solve the CA problem.