eprintid: 2543
rev_number: 9
eprint_status: archive
userid: 329
dir: disk0/00/00/25/43
datestamp: 2017-07-04 02:52:33
lastmod: 2017-07-04 02:52:33
status_changed: 2017-07-04 02:52:33
type: article
metadata_visibility: show
creators_name: Tung, Vu Xuan
creators_name: To, Van Khanh
creators_name: Ogawa, Mizuhito
creators_id: khanhtv@vnu.edu.vn
title: raSAT: an SMT solver for polynomial constraints
ispublished: pub
subjects: IT
subjects: isi
divisions: fac_fit
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.
date: 2017-06-27
date_type: published
publisher: Springer
official_url: http://dx.doi.org/10.1007/s10703-017-0284-9
full_text_status: none
publication: Formal Methods in System Design
pagerange: 1-38
refereed: TRUE
issn: 1572-8102
citation:   Tung, Vu Xuan and To, Van Khanh and Ogawa, Mizuhito  (2017) raSAT: an SMT solver for polynomial constraints.  Formal Methods in System Design .   pp. 1-38.  ISSN 1572-8102