TY  - JOUR
ID  - SisLab2543
UR  - http://dx.doi.org/10.1007/s10703-017-0284-9
A1  - Tung, Vu Xuan
A1  - To, Van Khanh
A1  - Ogawa, Mizuhito
Y1  - 2017/06/27/
N2  - This paper presents raSAT SMT solver, which is aimed to handle polynomial constraints over both reals and integers with simple unified methodologies. Its three main features are (1) a raSAT loop for inequalities, which adds testing to interval constraint propagation to accelerate SAT detection, (2) a non-constructive reasoning for equations over reals based on the generalized intermediate value theorem, and (3) soundness of floating-point arithmetic that is guaranteed by (a) rounding up/down over-approximations of intervals, and (b) confirmation of a satisfying instance detected by testing using the iRRAM package, which guarantees error bounds.
PB  - Springer
JF  - Formal Methods in System Design
SN  - 1572-8102
TI  - raSAT: an SMT solver for polynomial constraints
SP  - 1
AV  - none
EP  - 38
ER  -