raSAT: An SMT Solver for Polynomial Constraints

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9706)

Abstract

This paper presents the raSAT SMT solver for polynomial constraints, which aims to handle them over both reals and integers with simple unified methodologies: (1) raSATloop for inequalities, which extends the interval constraint propagation with testing to accelerate SAT detection, and (2) a non-constructive reasoning for equations over reals, based on the generalized intermediate value theorem.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Japan Advanced Institute of Science and TechnologyNomiJapan
  2. 2.University of Engineering and TechnologyVietnam National UniversityHanoiVietnam

Personalised recommendations