Deciding floating-point logic with abstract conflict driven clause learning
We present a bit-precise decision procedure for the theory of floating-point arithmetic. The core of our approach is a non-trivial, lattice-theoretic generalisation of the conflict-driven clause learning algorithm in modern sat solvers to lattice-based abstractions. We use floating-point intervals t...
| Huvudupphovsmän: | , , , , |
|---|---|
| Materialtyp: | Journal article |
| Publicerad: |
Springer Verlag
2014
|