机构:
SRI Int, 333 Ravenswood Ave, Menlo Pk, CA 94025 USASRI Int, 333 Ravenswood Ave, Menlo Pk, CA 94025 USA
Jovanovic, Dejan
[1
]
机构:
[1] SRI Int, 333 Ravenswood Ave, Menlo Pk, CA 94025 USA
来源:
VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2017
|
2017年
/
10145卷
基金:
美国国家科学基金会;
关键词:
SAT-SOLVER;
D O I:
10.1007/978-3-319-52234-0_18
中图分类号:
TP31 [计算机软件];
学科分类号:
081202 ;
0835 ;
摘要:
We present a new method for solving nonlinear integer arithmetic constraints. The method relies on the MCSat approach to solving nonlinear constraints, while using branch and bound in a conflict-directed manner. We report encouraging experimental results where the new procedure outperforms state-of-the-art SMT solvers based on bit-blasting.