Abstract
Optimization Modulo Theories (OMT) is an important extension of SMT which allows for finding models that optimize given objective functions, typically consisting in linear-arithmetic or pseudo-Boolean terms. However, many SMT and OMT applications, in particular from SW and HW verification, require handling bit-precise representations of numbers, which in SMT are handled by means of the theory of Bit-Vectors (\(\mathcal {BV}\)) for the integers and that of Floating-Point Numbers (\(\mathcal {FP}\)) for the reals respectively. Whereas an approach for OMT with (unsigned) \(\mathcal {BV}\) has been proposed by Nadel & Ryvchin, unfortunately we are not aware of any existing approach for OMT with \(\mathcal {FP}\).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
