Donut Domains: Efficient Non-convex Domains for Abstract Interpretation
From MaRDI portal
Publication:2891416
DOI10.1007/978-3-642-27940-9_16zbMath1326.68094OpenAlexW1541337995MaRDI QIDQ2891416
Franjo Ivančić, Gogul Balakrishnan, Aarti Gupta, Khalil Ghorbal, Naoto Maeda
Publication date: 15 June 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27940-9_16
Related Items (3)
Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT ⋮ Sound Bit-Precise Numerical Domains ⋮ Abstract neural networks
Uses Software
Cites Work
- A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
- Inner and outer approximations of polytopes using boxes.
- Exact join detection for convex polyhedra and other numerical abstractions
- Not necessarily closed convex polyhedra and the double description method
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Inferring Min and Max Invariants Using Max-Plus Polyhedra
- Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis
- Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic
- Static Analysis of Numerical Algorithms
- Boxes: A Symbolic Abstract Domain of Boxes
- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
- Convex Analysis
- Verification, Model Checking, and Abstract Interpretation
- Convexity recognition of the union of polyhedra
- Unnamed Item
- Unnamed Item
This page was built for publication: Donut Domains: Efficient Non-convex Domains for Abstract Interpretation
