skip to main content
10.1145/1363686.1363782acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

A novel approach for test suite reduction based on requirement relation contraction

Published:16 March 2008Publication History

ABSTRACT

The goal of test suite reduction is to satisfy all testing requirements with the minimum number of test cases. Existing techniques can be applied well on the constructed test suite. However, it is possible and necessary to optimize testing requirements before test case generation. In this paper test suite reduction is solved by testing requirement optimization. A requirement relation graph is proposed to minimize the requirement set by graph contraction. An experiment on specification-based testing is designed and implemented. The empirical studies show that the testing requirements can be optimized by the graph contraction methods effectively.

References

  1. H. Agrawal. Efficient coverage testing using global dominator graphs. In Proc. of PASTE'99, pages 11--20, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Black, E. Melachrinoudis, and D. Kaeli. Bi-criteria models for all-uses test suite reduction. In Proc. of ICSE'04, pages 106--115, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. T. Y. Chen and M. F. Lau. A new heuristic for test suite reduction. Information and Software Technology, 40(5):347--354, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  4. T. Y. Chen and M. F. Lau. On the completeness of a test suite reduction strategy. The Computer Journal, 42(5):430--440, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  5. Z. Y. Chen, B. W. Xu, and C. H. Nie. Comparing fault-based testing strategies of general Boolean specifications. In Proceedings of COMPSAC'07, pages 621--622, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. R. A. DeMillo and A. J. Offutt. Constraint-based automatic test data generation. IEEE Trans. on Soft. Eng., 17(9):900--910, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Gupta and M. L. Soffa. Employing static information in the generation of test cases. J. Softw. Test. Ver. Rel., 3(1):29--48, 1993.Google ScholarGoogle ScholarCross RefCross Ref
  8. M. J. Harrold, R. Gupta, and M. L. Soffa. A methodology for controlling the size of a test suite. ACM Trans. on Soft. Eng. and Meth., 2(3):270--285, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. G. Lee and C. G. Chung. An optimal representative set selection method. Information and Software Technology, 42(1):17--25, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  10. M. Marre and A. Bertolino. Using spanning sets for coverage testing. IEEE Trans. on Soft. Eng., 29(11):974--984, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. H. Nie and B. W. Xu. A minimal test suite generation method. Chinese J. of Computers, 26(12):1690--1696, 2003.Google ScholarGoogle Scholar
  12. S. Tallam and N. Gupta. A concept analysis inspired greedy algorithm for test suite minimization. In Proc. of PASTE'05, pages 35--42, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. E. Weyuker, T. Goradia, and A. Singh. Automatically Generating Test Data from a Boolean Specification. IEEE Trans. on Soft. Eng., 20(5):353--363, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. X. F. Zhang, B. W. Xu, C. H. Nie, and L. Shi. An approach for optimizing test suite based on testing requirement reduction. J. of Software, 18(4):821--831, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  15. H. Zhong, L. Zhang, and H. Mei. An experimental comparison of four test suite reduction techniques. In Proc. of ICSE'06, pages 636--640, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A novel approach for test suite reduction based on requirement relation contraction

                      Recommendations

                      Comments

                      Login options

                      Check if you have access through your login credentials or your institution to get full access on this article.

                      Sign in
                      • Published in

                        cover image ACM Conferences
                        SAC '08: Proceedings of the 2008 ACM symposium on Applied computing
                        March 2008
                        2586 pages
                        ISBN:9781595937537
                        DOI:10.1145/1363686

                        Copyright © 2008 ACM

                        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                        Publisher

                        Association for Computing Machinery

                        New York, NY, United States

                        Publication History

                        • Published: 16 March 2008

                        Permissions

                        Request permissions about this article.

                        Request Permissions

                        Check for updates

                        Qualifiers

                        • research-article

                        Acceptance Rates

                        Overall Acceptance Rate1,650of6,669submissions,25%

                      PDF Format

                      View or Download as a PDF file.

                      PDF

                      eReader

                      View online with eReader.

                      eReader