ACM Home Page
Please provide us with feedback. Feedback
Efficient unit test case minimization
Full text PdfPdf (1.43 MB)
Source
Automated Software Engineering archive
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering table of contents
Atlanta, Georgia, USA
POSTER SESSION: Posters table of contents
Pages 417-420  
Year of Publication: 2007
ISBN:978-1-59593-882-4
Authors
Andreas Leitner  ETH Zurich, Zurich, Switzerland
Manuel Oriol  ETH Zurich, Zurich, Switzerland
Andreas Zeller  Saarland University, Saarbruecken, Germany
Ilinca Ciupa  ETH Zurich, Zurich, Switzerland
Bertrand Meyer  ETH Zurich, Zurich, Switzerland
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 113,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1321631.1321698
What is a DOI?

ABSTRACT

Randomized unit test cases can be very effective in detecting defects. In practice, however, failing test cases often comprise long sequences of method calls that are tiresome to reproduce and debug. We present a combination of static slicing and delta debugging that automatically minimizes the sequence of failure-inducing method calls. In a case study on the EiffelBase library, the strategy minimizes failing unit test cases on average by 96%.

This approach improves on the state of the art by being far more efficient: in contrast to the approach of Lei and Andrews, who use delta debugging alone, our case study found slicing to be 50 times faster, while providing comparable results. The combination of slicing and delta debugging gives the best results and is 11 times faster.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
GUPTA, R., HARROLD, M. J., AND SOFFA, M. L. Program slicing-based regression testing techniques. Softw. Test, Verif. Reliab 6, 2 (1996), 83--111.
 
5
 
6
 
7
MEYER, B., CIUPA, I., LEITNER, A., AND LIU, L. L. Automatic testing of object-oriented software. In Proceedings of SOFSEM 2007 (Current Trends in Theory and Practice of Computer Science) (2007), J. van Leeuwen, Ed., Lecture Notes in Computer Science, Springer-Verlag.
8
9
 
10
11


Collaborative Colleagues:
Andreas Leitner: colleagues
Manuel Oriol: colleagues
Andreas Zeller: colleagues
Ilinca Ciupa: colleagues
Bertrand Meyer: colleagues