Simplifying Failure-Inducing Input
- ISSTA 2000
by
Ralf Hildebrandt, Andreas Zeller
ISSTA '00: Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis, Pages 135-145, ACM Press, New York, NY, USA, August 2000.
ISBN: 1581132662
Digital Library via DOI: 10.1145/347324.348938 - Local copy: Download as PDF file.
See also
More information is available at http://www.infosun.fmi.uni-passau.de/st/papers/hildeb-thesis/.
Abstract
Given some test case, a program fails. Which part of the test case is responsible for the particular failure? We show how our test case minimization algorithm generalizes and simplifies some failing input to a minimal test case that produces the failure. In a case study, the Mozilla web browser crashed after 95 user actions. Our prototype implementation automatically simplified the input to 3 relevant user actions. Likewise, it simplified 896 lines of HTML to the single line that caused the failure. The case study required 139 automated test runs, or 35 minutes on a 500 MHz PC.
Keywords
- automated debugging
- combinatorial testing
BibTeX Entry
@inproceedings{hildebrandt-issta-2000,
title = "Simplifying Failure-Inducing Input",
author = "Ralf Hildebrandt and Andreas Zeller",
year = "2000",
month = aug,
address = "New York, NY, USA",
booktitle = "ISSTA '00: Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and
analysis",
location = "Portland, Oregon, United States",
pages = "135--145",
publisher = "ACM Press",
ISBN = "1581132662",
doi = "10.1145/347324.348938",
}