Numeric bounds analysis with conflict-driven learning
From MaRDI portal
Recommendations
Cited in
(12)- raSAT: an SMT solver for polynomial constraints
- Combining tools for optimization and analysis of floating-point computations
- Loop summarization using state and transition invariants
- An approximation framework for solvers and decision procedures
- Exploiting binary floating-point representations for constraint propagation
- SAT-Based Model Checking
- Abstract Interpretation as Automated Deduction
- Splitting the Control Flow with Boolean Flags
- scientific article; zbMATH DE number 2084728 (Why is no real title available?)
- Deciding floating-point logic with abstract conflict driven clause learning
- Interval slopes as a numerical abstract domain for floating-point variables
- Checking compatibility of bit sizes in floating point comparison operations
This page was built for publication: Numeric bounds analysis with conflict-driven learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894265)