An empirical evaluation of test suite reduction for boolean specification-based testing

Proceedings - International Conference on Quality Software

Volumn , Issue , 2008, Pages 270-275

  Zhang, Xiaofang ^a,b,c   Xu, Baowen ^a,c   Chen, Zhenyu ^a,c   Nie, Changhai ^a,c   Li, Leifang ^a,c  

^a SOUTHEAST UNIVERSITY   (China)

^b SOOCHOW UNIVERSITY   (China)

^c Jiangsu Institute of Software Quality   (China)

Author keywords

Boolean testing; Optimization; Software testing; Test suite reduction; Testing requirement

Indexed keywords

BOOLEAN ALGEBRA; GERMANIUM; SPECIFICATIONS; TESTING;

BOOLEAN SPECIFICATIONS; BOOLEAN TESTING; EMPIRICAL EVALUATIONS; EMPIRICAL STUDIES; INTERNATIONAL CONFERENCES; OPTIMIZATION; QUALITY SOFTWARE; REDUCTION STRATEGIES; SOFTWARE TESTING; TEST SUITE REDUCTION; TEST SUITES; TESTING REQUIREMENT;

COST REDUCTION;

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

References (13)

1. H. Agrawal. Dominators, super blocks, and program coverage. In Conference Record of the 21st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 25-34. ACM Press, Jan. 1994.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading, MA, 1974.
3. T. Y. Chen and M. F. Lau. A new heuristic for test suite reduction. Information and Software Technology, 40(5):347-354, 1998.
4. T. Y. Chen and M. F. Lau. A simulation study on some heuristics for test suite reduction. Information and Software Technology, 40(13):777-787, 1998.
5. Z. Chen, B. Xu, X. Zhang, and C. Nie. A novel approach for test suite reduction based on requirement relation contraction. In Proceedings of the 23rd Annual ACM Symposium on Applied Computing, pages 390-394. ACM Press, 2008.
6. M. J. Harrold, R. Gupta, and M. L. Soffa. A methodology for controlling the size of a test suite. ACM Transactions on Software Engineering and Methodology, 2(3):270-285, 1993.
7. M. F. Lau and Y T. Yu. An Extended Fault Class Hierarchy for Specification-Based Testing. ACM Transactions on Software Engineering Methodology, 14(3):247-276, 2005.
8. J. G. Lee and C. G. Chung. An optimal representative set selection method. Information and Software Technology, 42(1):17-25, 2000.
9. M. Marre and A. Bertolino. Using spanning sets for coverage testing. IEEE Transactions on software engineering, 29(11): 974-984, 2003.
10. S. Tallam and N. Gupta. A Concept Analysis Inspired Greedy Algorithm for Test Suite Minimization. In Proceedings of the ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 35-42. ACM Press, Sept. 2005.
11. E. Weyuker, T. Goradia, and A. Singh. Automatically Generating Test Data from a Boolean Specification. IEEE Transactions on Software Engineering, 20(5):353-363, 1994.
12. X. Zhang, B. Xu, C. Nie, and L. Shi. An approach for optimizing test suite based on testing requirement reduction. Journal of Software, (in Chinese), 18(4):821-831, 2007.
13. H. Zhong, L. Zhang, and H. Mei. An experimental comparison of four test suite reduction techniques. In Proceedings of 28th International Conference on Software Engineering, pages 636-640. ACM Press, 2006.