Deciding floating-point logic with systematic abstraction

@article{Haller2012DecidingFL,
  title={Deciding floating-point logic with systematic abstraction},
  author={Leopold Haller and Alberto Griggio and Martin Brain and Daniel Kroening},
  journal={2012 Formal Methods in Computer-Aided Design (FMCAD)},
  year={2012},
  pages={131-140}
}
We present a bit-precise decision procedure for the theory of binary floating-point arithmetic. The core of our approach is a non-trivial generalisation of the conflict analysis algorithm used in modern SAT solvers to lattice-based abstractions. Existing complete solvers for floating-point arithmetic employ bit-vector encodings. Propositional solvers based on the Conflict Driven Clause Learning (CDCL) algorithm are then used as a backend. We present a natural-domain SMT approach that lifts the… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

57 Citations

01020'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…