WDD: Weighted Delta Debugging
Xintong Zhou, Zhenyang Xu, Mengxiao Zhang, Yongqiang Tian, Chengnian Sun

TL;DR
Weighted Delta Debugging (WDD) enhances traditional delta debugging algorithms by incorporating element weights based on size, significantly improving the efficiency and effectiveness of bug-triggering test input minimization.
Contribution
This paper introduces WDD, a novel approach that assigns weights to input fragments, enabling existing delta debugging algorithms to better handle size variations among elements.
Findings
Wddmin and WProbDD outperform traditional algorithms in benchmarks.
WDD improves minimization efficiency and effectiveness.
Extensive evaluation confirms WDD's value across multiple applications.
Abstract
Delta Debugging is a widely used family of algorithms (e.g., ddmin and ProbDD) to automatically minimize bug-triggering test inputs, thus to facilitate debugging. It takes a list of elements with each element representing a fragment of the test input, systematically partitions the list at different granularities, identifies and deletes bug-irrelevant partitions. Prior delta debugging algorithms assume there are no differences among the elements in the list, and thus treat them uniformly during partitioning. However, in practice, this assumption usually does not hold, because the size (referred to as weight) of the fragment represented by each element can vary significantly. For example, a single element representing 50% of the test input is much more likely to be bug-relevant than elements representing only 1%. This assumption inevitably impairs the efficiency or even effectiveness of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReservoir Engineering and Simulation Methods
