arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.08170cs.AIcs.LGcs.LOcs.SC
收藏

BNSynth:有界布尔函数综合

BNSynth: Bounded Boolean Functional Synthesis

Indian Institute of Science(印度科学学院);Microsoft Research(微软研究院)

Ravi Raja, Stanly Samuel, Chiranjib Bhattacharyya, Deepak D'Souza, Aditya Kanade

摘要:

根据逻辑规范自动合成构造正确的布尔函数称为布尔函数合成(BFS)问题。BFS具有从软件工程到电路设计的许多应用领域。在本文中,我们介绍了一个工具BNSynth,这是第一个解决BFS问题的解空间上的一个给定的范围内。边界的解决方案空间诱导的合成较小的功能,有利于资源受限的领域,如电路设计。BNSynth使用反例引导的神经方法来解决有界BFS问题。初步结果表明,在合成较小的解决方案的承诺,我们观察到至少\textbf{3.2X}(和高达\textbf{24X})的平均解决方案的大小减少的改善,相比,我们的基准测试的最先进的工具。BNSynth在GitHub上以开源许可证提供。

英文摘要:

The automated synthesis of correct-by-construction Boolean functions from logical specifications is known as the Boolean Functional Synthesis (BFS) problem. BFS has many application areas that range from software engineering to circuit design. In this paper, we introduce a tool BNSynth, that is the first to solve the BFS problem under a given bound on the solution space. Bounding the solution space induces the synthesis of smaller functions that benefit resource constrained areas such as circuit design. BNSynth uses a counter-example guided, neural approach to solve the bounded BFS problem. Initial results show promise in synthesizing smaller solutions; we observe at least \textbf{3.2X} (and up to \textbf{24X}) improvement in the reduction of solution size on average, as compared to state of the art tools on our benchmarks. BNSynth is available on GitHub under an open source license.

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

↑