Deciding floating-point logic with abstract conflict driven clause learning by Brain, M, Silva, V, Griggio, A, Haller, L, Kroening, D

“…The generalisation of cdcl we propose is widely applicable and can be used to derive abstraction-based smt solvers for other theories.…”

Interpolation-based verification of floating-point programs with abstract CDCL by Brain, M, D'Silva, V, Griggio, A, Haller, L, Kroening, D

“…One approach for smt solvers to improve efficiency is to delegate reasoning to abstract domains. …”

An abstract interpretation of DPLL(T) by Brain, M, D'Silva, V, Haller, L, Griggio, A, Kroening, D

“…DPLL(T) is a central algorithm for Satisfiability Modulo Theories (SMT) solvers. The algorithm combines results of reasoning about the Boolean structure of a formula with reasoning about conjunctions of theory facts to decide satisfiability. …”

Deciding Floating−Point Logic with Systematic Abstraction by Haller, L, Griggio, A, Brain, M, Kroening, D

“…We present a natural-domain SMT approach that lifts the CDCL framework to operate directly over abstractions of floating-point assignments. …”