Backtracking algorithms and search heuristics to generate test suites for combinatorial testing

Proceedings - International Computer Software and Applications Conference

Volumn 1, Issue , 2006, Pages 385-392

  Yan, Jun ^a,b   Zhang, Jian ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING ALGORITHMS; COMBINATORIAL TESTING; SEARCH ALGORITHM;

COMPUTER AIDED SOFTWARE ENGINEERING; PROBLEM SOLVING;

HEURISTIC ALGORITHMS;

EID: 34247463418     PISSN: 07303157     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COMPSAC.2006.33     Document Type: Conference Paper

References (16)

1. F. A. Aloul, I. L. Markov, and K. A. Sakallah. Shatter: Efficient symmetry-breaking for boolean satisfiability. In Proceedings of the 40th Design Automation Conference(DAC'03), 2003.
2. D. Cohen, S. Dalal, M. Fredman, and G. Patton. The AETG system: An approach to testing based on combinatorial design. IEEE Trans. Software Eng., 23(7):437-443, 1997.
3. M. B. Cohen, P. B. Gibbons, W. B. Mugridge, and C. J. Colbourn. Constructing test suites for interaction testing. In Proceedings of the 25th international Conference on Software Engineering(ICSE'03), 2003.
4. P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Breaking row and column symmetries in matrix models. In CP2002, LNCS 2470, pages 462-477, 2002.
5. A. Godbole, D. Skipper, and R. Sunley. t-covering arrays: upper bounds and Poisson approximations. Combinatorics, Probability and Computing, pages 105-118, 1996.
6. B. Hnich, S. Prestwich, and E. Selensky. Modeling the covering test problem. In CSCLP 2004: Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, 2004.
7. H. Kopka and P. W. Daly. Guide to LATEX. Addison-Wesley, Boston, MA, fourth edition, February 2004.
8. Y. Lei and K. Tai. In-Parameter-Order: A test generation strategy for pairwise testing. In Proceedings of 3rd IEEE Intl. Symp. on High Assurance Systems Engineering, pages 254-261, 1998.
9. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th conference on Design automation table of contents, pages 530-535, 2001.
10. P. J. Schroeder, P. Bolaki, and V. Gopu. Comparing the fault detection effectiveness of n-way and random test suites. In 2004 International Symposium on Empirical Software Engineering (ISESE'04), 2004.
11. B. Selman, H. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In AAAI-92: Proceedings 10th National Conference on AI, 1995.
12. G. Seroussi and N. Bshouty. Vector sets for exhaustive testing of logical circuits. IEEE Trans. Information Theory, 34:513-522, 1988.
13. T. Shiba, T. Tsuchiya, and T. Kikuno. Using artificial life techniques to generate test cases for combinatorial testing. In Proceedings of the 28th Annual International Computer Software and Applications Conference(COMPSAC'04), 2004.
14. Y. Tung and W. S. Aldiwan. Automating test case generation for the new generation mission software system. In Proceedings of IEEE Aerospace Conference, pages 431-437, 2000.
15. C. Yilmaz, M. B. Cohen, and A. A. Porter. Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Transactions on Software Engineering, 32(1), January 2006.
16. J. Zhang. Automatic symmetry breaking method combined with SAT. In Proceedings of the 2001 ACM Symposium on Applied Computing(SAC'01), 2001.