Results 1 
3 of
3
Backtracking algorithms and search heuristics to generate test suites for combinatorial testing
 Proceeding of the 30th Annual International Computer Software and Applications Conference. IEEE Computer Society
, 2006
"... Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SATbased approach and a backtracking search algorithm are presented to solve the problem. A novel pruning strategy called SCEH is proposed ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SATbased approach and a backtracking search algorithm are presented to solve the problem. A novel pruning strategy called SCEH is proposed to increase the efficiency of the methods. Several existing search heuristics and symmetry breaking techniques are also used in the backtracking search algorithm. Lastly, this paper introduces a tool called EXACT (EXhaustive seArch of Combinatorial Test suites) which implements all the above techniques to construct the covering arrays automatically. The experimental results show that our backtracking search method outperforms other methods in many small size cases. 1
Reducing Symmetries to Generate Easier SAT Instances
, 2005
"... Finding countermodels is an effective way of disproving false conjectures. In firstorder predicate logic, model finding is an undecidable problem. But if a finite model exists, it can be found by exhaustive search. The finite model generation problem in the firstorder logic can also be translated ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Finding countermodels is an effective way of disproving false conjectures. In firstorder predicate logic, model finding is an undecidable problem. But if a finite model exists, it can be found by exhaustive search. The finite model generation problem in the firstorder logic can also be translated to the satisfiability problem in the propositional logic. But a direct translation may not be very efficient. This paper discusses how to take the symmetries into account so as to make the resulting problem easier. A static method for adding constraints is presented, which can be thought of as an approximation of the least number heuristic (LNH). Also described is a dynamic method, which asks a model searcher like SEM to generate a set of partial models, and then gives each partial model to a propositional prover. The two methods are analyzed, and compared with each other.
Generating SAT Instances from FirstOrder Formulas
"... Huang Z, Zhang J. Generating SAT instances from firstorder formulas. Journal of Software, 2005,16(3): ..."
Abstract
 Add to MetaCart
Huang Z, Zhang J. Generating SAT instances from firstorder formulas. Journal of Software, 2005,16(3):