research-article

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

Authors:

Xiaofang Zhang,

Changhai NieAuthors Info & Claims

SAC '08: Proceedings of the 2008 ACM symposium on Applied computing

Pages 390 - 394

https://doi.org/10.1145/1363686.1363782

Published: 16 March 2008 Publication 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.

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

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

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

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

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

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

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

Digital Library

[9]

J. G. Lee and C. G. Chung. An optimal representative set selection method. Information and Software Technology, 42(1):17--25, 2000.

[10]

M. Marre and A. Bertolino. Using spanning sets for coverage testing. IEEE Trans. on Soft. Eng., 29(11):974--984, 2003.

Digital Library

[11]

C. H. Nie and B. W. Xu. A minimal test suite generation method. Chinese J. of Computers, 26(12):1690--1696, 2003.

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

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

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

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

Digital Library

Cited By

BERNARD EBOTELLA JAMBERT FLEGEARD BUTTING M(2020)Tool Support for Refactoring Manual Tests2020 IEEE 13th International Conference on Software Testing, Validation and Verification (ICST)10.1109/ICST46399.2020.00041(332-342)Online publication date: Oct-2020
https://doi.org/10.1109/ICST46399.2020.00041
Jeyaprakash SAlagarsamy K(2015)A Distinctive Genetic Approach for Test-Suite OptimizationProcedia Computer Science10.1016/j.procs.2015.08.43762(427-434)Online publication date: 2015
https://doi.org/10.1016/j.procs.2015.08.437
Chen XZhang LGu QZhao HWang ZSun XChen DChu WWong WPalakal MHung C(2011)A test suite reduction approach based on pairwise interaction of requirementsProceedings of the 2011 ACM Symposium on Applied Computing10.1145/1982185.1982488(1390-1397)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.1145/1982185.1982488
Show More Cited By

Index Terms

Recommendations

Balancing trade-offs in test-suite reduction
FSE 2014: Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering

Regression testing is an important activity but can get expensive for large test suites. Test-suite reduction speeds up regression testing by identifying and removing redundant tests based on a given set of requirements. Traditional research on test-...
Empirically evaluating Greedy-based test suite reduction methods at different levels of test suite complexity

Test suite reduction is an important approach that decreases the cost of regression testing. A test suite reduction technique operates based on the relationship between the test cases in the regression test suite and the test requirements in the program ...
An Empirical Study of JUnit Test-Suite Reduction
ISSRE '11: Proceedings of the 2011 IEEE 22nd International Symposium on Software Reliability Engineering

As test suites grow larger during software evolution, regression testing becomes expensive. To reduce the cost of regression testing, test-suite reduction aims to select a minimal subset of the original test suite that can still satisfy all the test ...

Comments

Information & Contributors

Information

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

Conference Chairs:
Roger L. Wainwright
University of Tulsa
,
Hisham M. Haddad
Kennesaw State University

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]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 March 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Jiangsu Planned Projects for Postdoctoral Research Funds
National Natural Science Foundation of Jiangsu Province
National Natural Science Foundation of China
Ministry of Education of the People's Republic of China
High Technology Research Project of Jiangsu Province

Conference

SAC '08

Sponsor:

SIGAPP

SAC '08: The 2008 ACM Symposium on Applied Computing

March 16 - 20, 2008

Fortaleza, Ceara, Brazil

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
332
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

BERNARD EBOTELLA JAMBERT FLEGEARD BUTTING M(2020)Tool Support for Refactoring Manual Tests2020 IEEE 13th International Conference on Software Testing, Validation and Verification (ICST)10.1109/ICST46399.2020.00041(332-342)Online publication date: Oct-2020
https://doi.org/10.1109/ICST46399.2020.00041
Jeyaprakash SAlagarsamy K(2015)A Distinctive Genetic Approach for Test-Suite OptimizationProcedia Computer Science10.1016/j.procs.2015.08.43762(427-434)Online publication date: 2015
https://doi.org/10.1016/j.procs.2015.08.437
Chen XZhang LGu QZhao HWang ZSun XChen DChu WWong WPalakal MHung C(2011)A test suite reduction approach based on pairwise interaction of requirementsProceedings of the 2011 ACM Symposium on Applied Computing10.1145/1982185.1982488(1390-1397)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.1145/1982185.1982488
Chen SChen ZZhao ZXu BFeng Y(2011)Using Semi-supervised Clustering to Improve Regression Test Selection TechniquesProceedings of the 2011 Fourth IEEE International Conference on Software Testing, Verification and Validation10.1109/ICST.2011.38(1-10)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.1109/ICST.2011.38
Zhang XGu QChen XQi JChen DShin SOssowski SSchumacher MPalakal MHung C(2010)A study of relative redundancy in test-suite reduction while retaining or improving fault-localization effectivenessProceedings of the 2010 ACM Symposium on Applied Computing10.1145/1774088.1774556(2229-2236)Online publication date: 22-Mar-2010
https://dl.acm.org/doi/10.1145/1774088.1774556
Parsa SKhalilian AFazlalizadeh Y(2009)A new algorithm to Test Suite Reduction based on cluster analysis2009 2nd IEEE International Conference on Computer Science and Information Technology10.1109/ICCSIT.2009.5234742(189-193)Online publication date: Aug-2009
https://doi.org/10.1109/ICCSIT.2009.5234742
Khalilian AParsa S(2009)Bi-criteria test suite reduction by cluster analysis of execution profilesProceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques10.1007/978-3-642-28038-2_19(243-256)Online publication date: 12-Oct-2009
https://dl.acm.org/doi/10.1007/978-3-642-28038-2_19
Zhang XXu BChen ZNie CLi L(2008)An Empirical Evaluation of Test Suite Reduction for Boolean Specification-Based Testing (Short Paper)Proceedings of the 2008 The Eighth International Conference on Quality Software10.1109/QSIC.2008.25(270-275)Online publication date: 12-Aug-2008
https://dl.acm.org/doi/10.1109/QSIC.2008.25

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten