{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T17:50:04Z","timestamp":1749577804607},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>SMT solvers use simplex-based decision procedures to solve decision problems whose formulas  are quantifier-free and atoms are linear constraints over the rationals. State-of-art SMT solvers use rational (exact) simplex implementations, which have shown good performance for typical software, hardware or protocol verification problems over the years.<\/jats:p><jats:p>Yet, most other scientific and technical fields use (inexact) floating-point computations, which are deemed far more efficient than exact ones.<\/jats:p><jats:p>It is therefore tempting to use a floating-point simplex implementation inside an SMT solver, though special precautions must be taken to avoid unsoundness.<\/jats:p><jats:p>In this work, we describe experimental results, over common benchmarks (SMT-LIB) of the integration of a mature floating-point implementation of the simplex algorithm (GLPK) into an existing SMT solver (OpenSMT).<\/jats:p><jats:p>We investigate whether commonly cited reasons for and against the use of floating-point truly apply to real cases from verification problems.<\/jats:p>","DOI":"10.29007\/j7x4","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:59:08Z","timestamp":1516730348000},"page":"19-8","source":"Crossref","is-referenced-by-count":1,"title":["Experiments on the feasibility of using a floating-point simplex in an SMT solver"],"prefix":"10.29007","volume":"21","author":[{"given":"Diego","family":"Caminha Barbosa de Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Monniaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:59:09Z","timestamp":1516730349000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/NqS"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/j7x4","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}