Sound bit-precise numerical domains
From MaRDI portal
Publication:2961585
Recommendations
- scientific article; zbMATH DE number 1738295
- Fast polyhedra abstract domain
- Automatic abstraction for bit-vectors using decision procedures
- Non-disjunctive Numerical Domain for Array Predicate Abstraction
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
Cites work
- scientific article; zbMATH DE number 3938547 (Why is no real title available?)
- scientific article; zbMATH DE number 3610766 (Why is no real title available?)
- scientific article; zbMATH DE number 1948392 (Why is no real title available?)
- Automatic abstraction for intervals using Boolean formulae
- Automatic modular abstractions for template numerical constraints
- Computer Aided Verification
- Donut domains: efficient non-convex domains for abstract interpretation
- Fully Bounded Polyhedral Analysis of Integers with Wrapping
- Program Analysis Using Weighted Pushdown Systems
- Static Analysis in Disjunctive Numerical Domains
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- Taming the Wrapping of Integer Arithmetic
- The octagon abstract domain
- Theory of Computer Addition and Overflows
- Transfer function synthesis without quantifier elimination
- Two-level semantics and abstract interpretation
- Verification, Model Checking, and Abstract Interpretation
- Weighted pushdown systems and their application to interprocedural dataflow analysis
Cited in
(2)
This page was built for publication: Sound bit-precise numerical domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961585)