Numeric Bounds Analysis with Conflict-Driven Learning

DOI10.1007/978-3-642-28756-5_5zbMath1352.68060OpenAlexW2154687874MaRDI QIDQ2894265

Michael Tautschnig, Daniel Kroening, Leopold Haller, Vijay D'Silva

Publication date: 29 June 2012

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28756-5_5

Mathematics Subject Classification ID

General methods in interval analysis (65G40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

An approximation framework for solvers and decision procedures ⋮ SAT-Based Model Checking ⋮ Abstract Interpretation as Automated Deduction ⋮ raSAT: an SMT solver for polynomial constraints ⋮ Deciding floating-point logic with abstract conflict driven clause learning ⋮ Loop summarization using state and transition invariants ⋮ Exploiting Binary Floating-Point Representations for Constraint Propagation

This page was built for publication: Numeric Bounds Analysis with Conflict-Driven Learning