paperbot · PL 论文追踪

全部论文 待读 收藏

P2 NRAgo: Solving SMT(NRA) Formulas with Gradient-Based Optimization

NRAgo:使用基于梯度的优化求解 SMT(NRA) 公式
ASE 2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE)2023匹配度 3/10 · 该论文研究 SMT(NRA) 求解器,属于形式化验证与程序分析的基础设施,与用户关注的静态分析/形式化验证有间接关联;但它未涉及 LLM/Agent、浮点程序分析或贝叶斯程序分析,也不属于用户核心的 PL×AI 交叉方向。引用 1 inbox
Minghao Liu, Kunhang Lv, Pei Huang, Rui Han, Fuqi Jia, Yu Zhang, Feifei Ma, Jian Zhang
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:提出混合 SMT(NRA) 求解器 NRAgo,将梯度优化与代数求解结合,大幅加速可满足实例。

非线性实数算术(NRA)的可满足性问题是模型检测、程序分析与软件测试等重要应用的基础,但由于计算复杂度高,开发高效求解算法一直面临巨大挑战。本文提出混合 SMT(NRA) 求解器 NRAgo,将基于梯度的优化方法的高效性与代数求解算法的完备性相结合,从而显著改善许多可满足实例上的实际性能。实验在现有先进 SMT 求解器也难以处理的挑战性 SMT(NRA) 基准上进行评估,结果表明 NRAgo 取得了显著的加速效果。

问题
SMT(NRA) 可满足性问题计算复杂度高,现有求解器在困难实例上的效率仍然不足。
方法
提出混合求解器 NRAgo,将基于梯度的优化方法与代数求解算法结合,在保持完备性的同时提升可满足实例的求解效率。
评估
在一组当前先进 SMT 求解器也难以求解的挑战性 SMT(NRA) 基准上进行实验评估,结果显示 NRAgo 取得了显著加速。
原文摘要(Abstract)

The satisfiability problem modulo the nonlinear real arithmetic (NRA) theory serves as the foundation for a wide range of important applications, such as model checking, program analysis, and software testing. However, due to the high computational complexity, developing efficient solving algorithms for this problem has consistently presented a substantial challenge. We present a hybrid SMT(NRA) solver, called NRAgo, which combines the efficiency of gradient-based optimization method with the completeness of algebraic solving algorithm. With our approach, the practical performance on many satisfiable instances is substantially improved. The experimental evaluation shows that NRAgo achieves remarkable acceleration effects on a set of challenging SMT(NRA) benchmarks that are hard to solve for state-of-the-art SMT solvers.

链接与引用

DOI 原文 · DBLP

BibTeX
@inproceedings{LiuLHHJZMZ23,
  title = {NRAgo: Solving SMT(NRA) Formulas with Gradient-Based Optimization},
  author = {Minghao Liu and Kunhang Lv and Pei Huang and Rui Han and Fuqi Jia and Yu Zhang and Feifei Ma and Jian Zhang},
  booktitle = {ASE},
  year = {2023},
  doi = {10.1109/ase56229.2023.00013}
}