.png){kind=icon}
返回
Generalizing the Split Factor of the Minimizing Delta Debugging Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3043027.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
One of the first attempts at the automation of test case reduction was the minimizing delta debugging algorithm, widely known as ddmin. Despite its age, it is still an unavoidable cornerstone of this field of research. One criticism against ddmin is that it can take too long to reach the granularity where it can perform actual reduction. Therefore, in this paper, ddmin is generalized with respect to the granularity by introducing a new split factor parameter, leading to the formalization of a parametric algorithm variant. The complexity analysis of this parametric variant reveals that the theoretical worst and best-case behavior of ddmin can be improved. Moreover, the results of experiments with the generalized algorithm show that the reduction can be sped up significantly by choosing the right split factor: up to 84% of the test steps can be eliminated in practice.
Keyword:
Debugging
Testing
Complexity theory
Partitioning algorithms
Software
Licenses
Automation
Delta debugging
granularity
split factor
test case reduction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Steady-state, Pre-steady-state, and Single-turnover Kinetic Measurement for DNA Glycosylase ActivityOAAI
OAAI分享收藏
查看更多内容