Generalizing the Template Polyhedral Domain
From MaRDI portal
Publication:3000579
DOI10.1007/978-3-642-19718-5_10zbMath1326.68088OpenAlexW1546399868MaRDI QIDQ3000579
Sriram Sankaranarayanan, Michael A. Colón
Publication date: 19 May 2011
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19718-5_10
Linear programming (90C05) Polytopes and polyhedra (52B99) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Finding Relevant Templates via the Principal Component Analysis ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs ⋮ The Abstract Domain of Parallelotopes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The octahedron abstract domain
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
- On the identification of the convex hull of a finite set of points in the plane
- Two Variables per Linear Inequality as an Abstract Domain
- Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis
- Automatic Modular Abstractions for Template Numerical Constraints
- Temporal Verification of Reactive Systems: Response
- Program Analysis Using Symbolic Ranges
- Logahedra: A New Weakly Relational Domain
- Verification, Model Checking, and Abstract Interpretation
- Static Analysis by Policy Iteration on Relational Domains
- Precise Fixpoint Computation Through Strategy Iteration
- A Reachability Predicate for Analyzing Low-Level Software
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Generalizing the Template Polyhedral Domain