Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing

Authors:
Jun Yan;Jian Zhang
Affiliations:
Chinese Academy of Sciences, China;Chinese Academy of Sciences, China
Venue:
COMPSAC '06 Proceedings of the 30th Annual International Computer Software and Applications Conference - Volume 01
Year:
2006

Citing 0
Cited 9

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
Finding Orthogonal Arrays Using Satisfiability Checkers and Symmetry Breaking Constraints

PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Assessing IRPS as an efficient pairwise test data generation strategy

International Journal of Advanced Intelligence Paradigms
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength

MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
A survey of combinatorial testing

ACM Computing Surveys (CSUR)
Design and implementation of a t-way test data generation strategy with automated execution tool support

Information Sciences: an International Journal
Combining model-based and combinatorial testing for effective test case generation

Proceedings of the 2012 International Symposium on Software Testing and Analysis
Auto-tuning methodology to represent landform attributes on multicore and multi-GPU systems

Proceedings of the 2013 International Workshop on Programming Models and Applications for Multicores and Manycores

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 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.