88 search results - page 1 / 18 » Backtracking Algorithms and Search Heuristics to Generate Te... |
COMPSAC
2006
IEEE
13 years 10 months ago
2006
IEEE
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
JSS
2008
13 years 4 months ago
2008
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
ISSRE
2003
IEEE
13 years 9 months ago
2003
IEEE
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
QSIC
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...