arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.12490cs.DS
收藏

一种用于计算特征模型中原子集的快速免计数算法

A Fast Counting-Free Algorithm for Computing Atomic Sets in Feature Models

Tobias Heß, Aaron Molt

AI总结:

针对特征模型中原子集计算性能不足的问题,提出一种仅依赖SAT求解的免计数算法,可轻松扩展至真实系统,并成功应用于Linux内核。

摘要:

在产品线工程和特征模型的背景下,原子集是指必须始终一起选择的一组特征,以便配置有效。对于许多分析和应用,这些特征可以合并为一个特征,而不影响例如可满足性、模型计数、采样或知识编译。然而,当前方法的性能在实践中往往不足。这一点尤其适用于基于模型计数的方法,但不限于此。在这项工作中,我们提出了一种仅依赖SAT求解的免计数算法来计算原子集。我们的评估表明,该算法可以轻松扩展到困难的真实世界系统,甚至成功应用于当代版本的Linux内核。

英文摘要:

In the context of product-line engineering and feature models, atomic sets are sets of features that must always be selected together in order for a configuration to be valid. For many analyses and applications, these features may be condensed into one feature, without affecting, for instance, satisfiability, model counting, sampling, or knowledge compilation. However, the performance of current approaches tends to be insufficient in practice. This is especially true but not limited to approaches based on model counting. In this work, we present a counting-free algorithm for computing atomic sets that only relies on SAT solving. Our evaluation shows that it scales with ease to hard real-world systems and even succeeds for a contemporary version of the Linux kernel.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑