10种可配置系统采样算法的比较
A Comparison of 10 Sampling Algorithms for Configurable Systems
摘要:
几乎每个软件系统都提供配置选项,以根据目标平台和应用场景定制系统。通常,这种可配置性使得对每个单独的系统配置的分析不可行。为了解决这个问题,研究人员提出了一套不同的采样算法。我们提出了一个比较研究的10个国家的最先进的采样算法的故障检测能力和样本集的大小。前者对提高软件质量很重要,后者对减少分析时间很重要。简而言之,我们发现具有较大样本集的采样算法能够检测到更多数量的故障,但是具有较小样本集的简单算法,例如most-enabled-disabled,在大多数情况下是最有效的。此外,我们观察到,在以前的工作中所做的限制性假设影响检测到的故障的数量,样本集的大小,和算法的排名。最后,我们已经确定了一些技术挑战时,试图避免限制性的假设,质疑某些采样算法的实用性。
英文摘要:
Almost every software system provides configuration options to tailor the system to the target platform and application scenario. Often, this configurability renders the analysis of every individual system configuration infeasible. To address this problem, researchers have proposed a diverse set of sampling algorithms. We present a comparative study of 10 state-of-the-art sampling algorithms regarding their fault-detection capability and size of sample sets. The former is important to improve software quality and the latter to reduce the time of analysis. In a nutshell, we found that sampling algorithms with larger sample sets are able to detect higher numbers of faults, but simple algorithms with small sample sets, such as most-enabled-disabled, are the most efficient in most contexts. Furthermore, we observed that the limiting assumptions made in previous work influence the number of detected faults, the size of sample sets, and the ranking of algorithms. Finally, we have identified a number of technical challenges when trying to avoid the limiting assumptions, which questions the practicality of certain sampling algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。