Greedy heuristic algorithms to generate variable strength combinatorial test suite

Proceedings - International Conference on Quality Software

Volumn , Issue , 2008, Pages 155-162

  Wang, Ziyuan ^a   Xu, Baowen ^a   Nie, Changhai ^a  

^a SOUTHEAST UNIVERSITY   (China)

Author keywords

Combinatorial testing; Software testing; Test generation; Variable strength

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER SOFTWARE SELECTION AND EVALUATION; FLOW INTERACTIONS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; PORTALS; SOFTWARE TESTING; TESTING;

APPLICATIONS.; COMBINATORIAL TESTING; GREEDY HEURISTIC; INTERNATIONAL CONFERENCES; MINIMUM COVERAGE; OPTIMALITY; QUALITY SOFTWARE; TEST GENERATION; TEST SUITES; VARIABLE STRENGTH;

HEURISTIC ALGORITHMS;

EID: 52449109126     PISSN: 15506002     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QSIC.2008.52     Document Type: Conference Paper

References (11)

1. C. Yilmaz, M. B. Cohen, A. A. Porter. Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Transaction on Software Engineering, 2006, 32(1): 20-34.
2. M. B. Cohen, P. B. Gibbons, W. B. Mugridge, C. J. Colbouns, et al. Variable strength interaction testing of components. In Proceedings of 27th Annual International Computer Software and Applications Conference, Dallas, TX, USA, 2003: 413-418.
3. P. J. Schroeder, B. Korel. Black-box test reduction using input-output analysis. In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA2000), Portland, Oregon, USA, August, 2000. ACM SIGSOFT Software Engineering Notes, 2005, 25(5): 173-177.
4. P. J. Schroeder. Black-box test reduction using input-output analysis. Dissertation for PhD, Department of Computer Science, Illinois Institute of Technology, Chicago, Illinois, USA, December, 2001.
5. C. Cheng, A. Dumitrescu, P. J. Schroeder. Generating small combinatorial test suites to cover input-output relationships. In Proceedings of 3rd International Conference on Quality Software (QSIC2003), November, 2003: 76-82.
6. J. Czerwonka. Pairwise testing in real world: Practical extensions to test case generator. In Proceedings of 24th Pacific Northwest Software Quality Conference, Portland, Oregon, USA, October 9-11, 2006: 419-430.
7. Wang Ziyuan, Nie Changhai, Xu Baowen. Generating combinatorial test suite for interaction relationship. In Proceeding of 4th International Workshop on Software Quality Assurance (SOQUA2007), Dubrovnik, Croatia, September 3-4, 2007: 55-61.
8. C. J. Colboum, M. B. Cohen, R. C. Turban. A deterministic density algorithm for pair-wise interaction coverage. In: Proceedings of 22nd IASTED International Conference on Software Engineering (SE2004), Innsbruck, Austria, February, 2004: 345-352.
9. R. C. Bryce, C. J. Colboum, M. B. Cohen. A framework of greedy methods for constructing interaction test suites. In: Proceedings of 27th international conference on Software engineering (ICSE2005), St. Louis, Missouri, USA, May 15-21, 2005: 146-155.
10. Kuo-Chung Tai, Yu Lei. A test generation strategy for pairwise testing. IEEE Transaction on Software Engineering, 2002, 28(1): 109-111.
11. Changhai Nie, Baowen Xu, Liang Shi, Guowei Dong, Automatic test generation for n-way combinatorial testing. Lecture Notes in Computer Science 3712, 2005: 203-211.