arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2606.20656cs.AIcs.SE
收藏

学习并行字符串求解器的分裂启发式

Learning Splitting Heuristics for Parallel String Solvers

The State Key Laboratory of Blockchain and Data Security, Zhejiang University(浙江大学区块链与数据安全全国重点实验室)

Chenhao Gao, Peisen Yao

AI总结:

提出数据驱动方法自动生成分裂启发式,将分裂原子选择建模为学习任务,在Z3seq和Z3str4上实现,在求解数量和平均时间上优于手工设计。

摘要:

字符串约束求解器对于推理字符串操作程序至关重要。然而,许多实际字符串约束是不可判定的,现实应用常常提出复杂约束,挑战当前求解器。多核架构的兴起为并行求解提供了机会。一种关键的并行求解方法是\emph{cube-and-conquer},其中分裂启发式的质量对于有效划分搜索空间至关重要。不幸的是,手动设计启发式是劳动密集型的,并且手工设计的启发式往往次优。本文介绍了一种数据驱动的方法来自动生成分裂启发式。我们将选择分裂原子的问题框定为学习任务,使用来自输入公式和求解器执行的动态数据的特征。我们在两个流行的字符串求解器Z3seq和Z3str4中实现了这种方法,证明了学习到的启发式在求解公式数量和平均求解时间上优于手工设计的启发式。

英文摘要:

String constraint solvers are crucial for reasoning about string-manipulating programs. However, many practical string constraints are undecidable, and real-world applications often present complex constraints that challenge current solvers. The rise of multi-core architectures offers an opportunity for parallel solving. A key parallel solving method is \emph{cube-and-conquer}, in which the quality of splitting heuristics is critical to effectively dividing the search space. Unfortunately, manually designing the heuristics is labor-intensive, and handcrafted heuristics are often sub-optimal. This paper introduces a data-driven approach to automatically generating splitting heuristics. We frame the problem of selecting a splitting atom as a learning task, using features from input formulas and dynamic data from solver execution. We implement this approach in two popular string solvers, Z3seq and Z3str4, demonstrating that the learned heuristics outperform manually designed ones in the number of solved formulas and the average solving time.

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

↑