VNU-UET Repository

raSAT: an SMT solver for polynomial constraints

Vu Xuan Tung and Van Khanh To and Mizuhito Ogawa (2017) raSAT: an SMT solver for polynomial constraints. Formal Methods in System Design . pp. 1-38. ISSN 1572-8102

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/s10703-017-0284-9

Abstract

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.

Item Type:Article
Subjects:Information Technology (IT)
ISI-indexed journals
Divisions:Faculty of Information Technology (FIT)
ID Code:2543
Deposited By: Tô V�n Khánh
Deposited On:04 Jul 2017 02:52
Last Modified:04 Jul 2017 02:52

Repository Staff Only: item control page