Simplifying and isolating failure-inducing input
Andreas Zeller, Ralf Hildebrandt · IEEE Transactions on Software Engineering · 2002
Given some test case, a program fails. Which circumstances of the test case are responsible for the particular failure? The delta debugging algorithm generalizes and simplifies the failing test case to a minimal test case that still produces the failure. It also isolates the difference between a passing and a failing test case. In a case study, the Mozilla Web browser crashed after 95 user actions. Our prototype implementation automatically simplified the input to three 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.
Cited by 1,079 works. doi:10.1109/32.988498
Authors
References
- An empirical study of the reliability of UNIX utilities
- Programmers use slices when debugging
- Dynamic program slicing
- A Survey of Program Slicing Techniques.
- Fuzz Revisited: A Re-examination of the Reliability of UNIX Utilities and Services
- Yesterday, my program worked. Today, it does not. Why?
- Dynamic program slicing
- Massive Stochastic Testing of SQL
- Unified versioning through feature logic
- An efficient relevant slicing method for debugging