Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships

DOI10.1007/978-3-642-03237-0_21MaRDI QIDQ3392932zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• An abstract domain to discover interval linear equalities
• Fast polyhedra abstract domain
• A class of polynomially solvable range constraints for interval analysis without widenings
• Generalizing the template polyhedral domain
• Inferring Min and Max Invariants Using Max-Plus Polyhedra

Cites work

• A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
• Calculation of exact bounds for the solution set of linear interval systems
• Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
• scientific article; zbMATH DE number 3610766 (Why is no real title available?)
• Inferring Min and Max Invariants Using Max-Plus Polyhedra
• Linear programming with interval coefficients
• Optimal domains for disjunctive abstract interpretation
• Programming Languages and Systems
• Rigorous Lower and Upper Bounds in Linear Programming
• Static analysis of arithmetical congruences
• SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
• Systematic design of program transformation frameworks by abstract interpretation
• The octagon abstract domain
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

Cited in

(24)

• Abstract interpretation with higher-dimensional ellipsoids and conic extrapolation
• Experimental evaluation of numerical domains for inferring ranges
• A new abstraction framework for affine transformers
• The octagon abstract domain for continuous constraints
• An abstract domain to infer symbolic ranges over nonnegative parameters
• Donut domains: efficient non-convex domains for abstract interpretation
• Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
• Block-wise abstract interpretation by combining abstract domains with SMT
• Linear absolute value relation analysis
• Generalizing the template polyhedral domain
• Cooperative query answering by abstract interpretation
• Two variables per linear inequality as an abstract domain
• Inferring Min and Max Invariants Using Max-Plus Polyhedra
• SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
• Program Analysis Using Symbolic Ranges
• An abstract domain to discover interval linear equalities
• Deciding floating-point logic with abstract conflict driven clause learning
• Reachability computation for polynomial dynamical systems
• Interprocedurally Analysing Linear Inequality Relations
• Extending constraint-only representation of polyhedra with Boolean constraints
• An efficient abstract domain for not necessarily closed polyhedra
• Invertible linear transforms of numerical abstract domains
• Dynamic interval analysis by abstract interpretation
• The two variable per inequality abstract domain

Describes a project that uses

Uses Software

• GLPK
• Apron

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)