Extending Hierarchical Delta Debugging with Hoisting
D\'aniel Vince, Ren\'ata Hodov\'an, Daniella B\'arsony, \'Akos Kiss

TL;DR
This paper introduces an extension to Hierarchical Delta Debugging by incorporating hoisting, a technique that replaces subtrees with compatible ones to achieve more significant test case reductions, improving efficiency and output size.
Contribution
The paper proposes a novel extension to HDD called hoisting, which replaces subtrees with compatible ones, leading to up to 80% smaller test cases and outperforming existing algorithms.
Findings
Hoisting can reduce test case size by up to 80%.
Extended HDD produces smaller test cases than state-of-the-art algorithms.
Hoisting improves the efficiency of test case minimization.
Abstract
Minimizing failing test cases is an important pre-processing step on the path of debugging. If much of a test case that triggered a bug does not contribute to the actual failure, then the time required to fix the bug can increase considerably. However, test case reduction itself can be a time consuming task, especially if done manually. Therefore, automated minimization techniques have been proposed, the minimizing Delta Debugging (DDMIN) and the Hierarchical Delta Debugging (HDD) algorithms being the most well known. DDMIN does not need any information about the structure of the test case, thus it works for any kind of input. If the structure is known, however, it can be utilized to create smaller test cases faster. This is exemplified by HDD, which works on tree-structured inputs, pruning subtrees at each level of the tree with the help of DDMIN. In this paper, we propose to extend…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
