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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Formal methods in system design Ročník 45; číslo 2; s. 213 - 245
Hlavní autori: Brain, Martin, D’Silva, Vijay, Griggio, Alberto, Haller, Leopold, Kroening, Daniel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.10.2014
Predmet:
Algorithms
Arithmetic
Benchmarks
CAE) and Design
Circuits and Systems
Computer-Aided Engineering (CAD
Electrical Engineering
Encoding
Engineering
Floating point arithmetic
Intervals
Learning
Software Engineering/Programming and Operating Systems
Solvers
Abstract interpretation
SMT
Decision procedures
Floating-point logic
ISSN:0925-9856, 1572-8102
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 to reason about the ranges of variables, which allows us to directly handle arithmetic and is more efficient than encoding a formula as a bit-vector as in current floating-point solvers. Interval reasoning alone is incomplete, and we obtain completeness by developing a conflict analysis algorithm that reasons natively about intervals. We have implemented this method in the mathsat5 smt solver and evaluated it on assertion checking problems that bound the values of program variables. Our new technique is faster than a bit-vector encoding approach on 80 % of the benchmarks, and is faster by one order of magnitude or more on 60 % of the benchmarks. The generalisation of cdcl we propose is widely applicable and can be used to derive abstraction-based smt solvers for other theories.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0925-9856
1572-8102
DOI:10.1007/s10703-013-0203-7