Numeric Bounds Analysis with Conflict-Driven Learning

This paper presents a sound and complete analysis for determining the range of floating-point variables in control software. Existing approaches to bounds analysis either use convex abstract domains and are efficient but imprecise, or use floating-point decision procedures, and are precise but do no...

Full description

Saved in:
Bibliographic Details
Published inTools and Algorithms for the Construction and Analysis of Systems pp. 48 - 63
Main Authors D’Silva, Vijay, Haller, Leopold, Kroening, Daniel, Tautschnig, Michael
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Abstract Domain
Abstract Interpretation
Bound Model Check
Decision Procedure
Interval Analysis
Online AccessGet full text

Cover

More Information
Summary:This paper presents a sound and complete analysis for determining the range of floating-point variables in control software. Existing approaches to bounds analysis either use convex abstract domains and are efficient but imprecise, or use floating-point decision procedures, and are precise but do not scale. We present a new analysis that elevates the architecture of a modern SAT solver to operate over floating-point intervals. In experiments, our analyser is consistently more precise than a state-of-the-art static analyser and significantly outperforms floating-point decision procedures.
Bibliography:Supported by the Toyota Motor Corporation, EPSRC project EP/H017585/1 and ERC project 280053.
ISBN:3642287557
9783642287558
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-28756-5_5