Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
DOI10.1007/978-3-642-03237-0_21zbMATH Open1248.68140OpenAlexW2114052185MaRDI QIDQ3392932FDOQ3392932
Authors: Liqian Chen, Antoine Miné, Ji Wang, Patrick Cousot 
Publication date: 18 August 2009
Published in: Static Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03237-0_21
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cites Work
- The octagon abstract domain
- Linear programming with interval coefficients
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Systematic design of program transformation frameworks by abstract interpretation
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
- Inferring Min and Max Invariants Using Max-Plus Polyhedra
- Static analysis of arithmetical congruences
- Programming Languages and Systems
- Verification, Model Checking, and Abstract Interpretation
- Rigorous Lower and Upper Bounds in Linear Programming
- Calculation of exact bounds for the solution set of linear interval systems
- Title not available (Why is that?)
- Verification, Model Checking, and Abstract Interpretation
- Optimal domains for disjunctive abstract interpretation
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
Cited In (23)
- Donut domains: efficient non-convex domains for abstract interpretation
- The octagon abstract domain for continuous constraints
- An abstract domain to infer symbolic ranges over nonnegative parameters
- Linear absolute value relation analysis
- Block-wise abstract interpretation by combining abstract domains with SMT
- Deciding floating-point logic with abstract conflict driven clause learning
- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
- An abstract domain to discover interval linear equalities
- Invertible linear transforms of numerical abstract domains
- Two variables per linear inequality as an abstract domain
- The two variable per inequality abstract domain
- A new abstraction framework for affine transformers
- Extending constraint-only representation of polyhedra with Boolean constraints
- Dynamic interval analysis by abstract interpretation
- Interprocedurally Analysing Linear Inequality Relations
- Cooperative query answering by abstract interpretation
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- An efficient abstract domain for not necessarily closed polyhedra
- Abstract interpretation with higher-dimensional ellipsoids and conic extrapolation
- Program Analysis Using Symbolic Ranges
- Generalizing the template polyhedral domain
- Inferring Min and Max Invariants Using Max-Plus Polyhedra
- Reachability computation for polynomial dynamical systems
Uses Software
This page was built for publication: Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392932)
