Search Strategies for Floating Point Constraint Systems

Zitoun, Heytem; Michel, Claude; Rueher, Michel; Michel, Laurent

doi:10.1007/978-3-319-66158-2_45

Cited by 7 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A third strand of convergent evolution in the development of interval based techniques comes from the constraint programming community. FPCS [43] uses intervals with sophisticated back-propagation rules [4] and smart partitioning heuristics [59]. Colibri [42] takes a slightly different approach, using a more expressive constraint representation of difference bounded matrices 6 .…”

Section: Techniquesmentioning

confidence: 99%

“…CBMC 54 problems (7.4% UNSAT, 92.6% unknown). Non-trivial benchmarks from SV-COMP's floating-point collection [7], fp-bench [21] benchmarks that contained checkable post-conditions, the benchmarks used by [5], and the sample programs from [59]. The benchmarks are provided in SMT-LIB and the original C program for comparing to CBMC's floating-point solver.…”

Section: Benchmarksmentioning

confidence: 99%

See 1 more Smart Citation

Building Better Bit-Blasting for Floating-Point Problems

Brain

Schanda

Sun

2019

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

An effective approach to handling the theory of floatingpoint is to reduce it to the theory of bit-vectors. Implementing the required encodings is complex, error prone and requires a deep understanding of floating-point hardware. This paper presents SymFPU, a library of encodings that can be included in solvers. It also includes a verification argument for its correctness, and experimental results showing that its use in CVC4 out-performs all previous tools. As well as a significantly improved performance and correctness, it is hoped this will give a simple route to add support for the theory of floating-point.

show abstract

Section: Techniquesmentioning

confidence: 99%