arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2605.08243cs.PLcs.DCcs.LG
收藏

GPU加速的混合布尔算术综合:超越缓存

GPU-Accelerated Synthesis of Mixed-Boolean Arithmetic: Beyond Caching

CNRS(法国国家科学研究中心);LaBRI(拉普拉ia实验室);University of Bordeaux(波尔多大学)

Gabriel Bathie, Baptiste Mouillon, Nathanaël Fijalkow

AI总结:

本文提出SIMBA,一种基于GPU的混合布尔算术综合工具,通过无缓存的自底向上枚举方法,实现更高效的大规模规格处理和复杂目标的综合。

摘要:

从输入输出示例综合混合布尔算术(MBA)表达式对于程序去混淆和编译器优化、逆向工程和密码分析至关重要。现有的MBA综合器通常是基于CPU的,在处理大规模规范或复杂目标时表现不佳。最近的基于GPU的综合方法在定性设置中实现了显著的速度提升,但依赖于缓存观察等价候选者;这种策略在MBA中失效,因为候选输出是定量位向量,行为空间巨大。我们提出了SIMBA(混合布尔算术综合),一种基于GPU的MBA综合器,围绕无缓存的自底向上枚举构建。SIMBA完全避免语言缓存,并采用面向GPU的枚举设计,保持工作局部化和高度并行。在实验中,SIMBA比现有MBA综合工具快得多,处理更大的规范,并达到现有方法无法解决的表达式规模。这些结果确立了无缓存GPU综合作为定量领域实用且可扩展的方法,并将其作为替代缓存中心设计的有力选择。

英文摘要:

Synthesizing Mixed-Boolean Arithmetic (MBA) expressions from input-output examples is central to program deobfuscation and also useful for compiler optimization, reverse engineering, and cryptanalysis. Existing MBA synthesizers are typically CPU-based and scale poorly on large specifications or complex targets. Recent GPU-accelerated synthesis methods achieve large speedups in qualitative settings, but they depend on caching observationally equivalent candidates; this strategy breaks down for MBA because candidate outputs are quantitative bitvectors and the behavioral space is enormous. We present SIMBA (Synthesis of Mixed-Boolean Arithmetic), a GPU-accelerated MBA synthesizer built around cache-free bottom-up enumeration. SIMBA avoids language caches entirely and uses a GPU-oriented enumeration design that keeps work local and highly parallel. In experiments, SIMBA is substantially faster than prior MBA synthesis tools, handles larger specifications, and reaches expression sizes that existing methods fail to solve. These results establish cache-free GPU synthesis as a practical and scalable approach for quantitative domains, and identify it as a strong alternative to cache-centric designs.

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

↑