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

Z3str3:一个具有理论感知分支的字符串求解器

Z3str3: A String Solver with Theory-aware Branching

Murphy Berzish, Yunhui Zheng, Vijay Ganesh

摘要:

我们提出了一个新的字符串SMT求解器,Z3str3,这是快于它的竞争对手Z3str2,Norn,CVC 4,S3和S3P在大多数三个工业强度的基准,即卡鲁扎,PISA和IBM AppScan。Z3str3支持字符串等式、长度函数上的线性算术和正则语言成员谓词。Z3str3效率背后的关键算法创新是一种我们称之为理论感知分支的技术,其中我们修改了Z3的分支启发式算法,以考虑理论文字的结构来计算分支活动。在传统的DPLL(T)结构中,理论文字的结构是隐藏的DPLL(T)SAT求解器,因为布尔抽象的输入理论公式。相比之下,本文提出的理论感知技术将理论文字的结构暴露给DPLL(T)SAT求解器的分支启发式,从而使其能够在搜索过程中做出比其他方式更明智的决策。因此,Z3str3比其竞争对手具有更好的性能。

英文摘要:

We present a new string SMT solver, Z3str3, that is faster than its competitors Z3str2, Norn, CVC4, S3, and S3P over a majority of three industrial-strength benchmarks, namely Kaluza, PISA, and IBM AppScan. Z3str3 supports string equations, linear arithmetic over length function, and regular language membership predicate. The key algorithmic innovation behind the efficiency of Z3str3 is a technique we call theory-aware branching, wherein we modify Z3's branching heuristic to take into account the structure of theory literals to compute branching activities. In the traditional DPLL(T) architecture, the structure of theory literals is hidden from the DPLL(T) SAT solver because of the Boolean abstraction constructed over the input theory formula. By contrast, the theory-aware technique presented in this paper exposes the structure of theory literals to the DPLL(T) SAT solver's branching heuristic, thus enabling it to make much smarter decisions during its search than otherwise. As a consequence, Z3str3 has better performance than its competitors.

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

↑