Corpus ID: 147704305

Optimization Modulo the Theories of Signed Bit-Vectors and Floating-Point Numbers

@article{Trentin2019OptimizationMT,
  title={Optimization Modulo the Theories of Signed Bit-Vectors and Floating-Point Numbers},
  author={Patrick Trentin and Roberto Sebastiani},
  journal={ArXiv},
  year={2019},
  volume={abs/1905.02838}
}
  • Patrick Trentin, Roberto Sebastiani
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • 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 (BV) for the integers and that of Floating-Point Numbers (FP) for the reals respectively… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES
    An SMT-LIB Theory of Binary Floating-Point Arithmetic ∗
    52
    Optimization Modulo Theories with Linear Rational Costs
    52
    Exploring Approximations for Floating-Point Arithmetic using UppSAT
    10
    An Efficient and Trustworthy Theory Solver for Bit-vectors in Satisfiability Modulo Theories
    10
    Bit-Precise Reasoning Beyond Bit-Blasting
    2
    Bit-Vector Optimization
    16
    Efficient SMT solving for bit vectors and the extensional theory of arrays
    20
    Deciding floating-point logic with systematic abstraction
    54
    Encoding RTL Constructs for MathSAT: a Preliminary Report
    31