Generalizing the template polyhedral domain
DOI10.1007/978-3-642-19718-5_10zbMATH Open1326.68088OpenAlexW1546399868MaRDI QIDQ3000579FDOQ3000579
Authors: Michael A. Colón, Sriram Sankaranarayanan 
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
Recommendations
Linear programming (90C05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Polytopes and polyhedra (52B99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Program Analysis Using Symbolic Ranges
- Title not available (Why is that?)
- Temporal verification of reactive systems: response
- A Reachability Predicate for Analyzing Low-Level Software
- On the identification of the convex hull of a finite set of points in the plane
- Static Analysis by Policy Iteration on Relational Domains
- Precise Fixpoint Computation Through Strategy Iteration
- Two variables per linear inequality as an abstract domain
- Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
- Logahedra: a new weakly relational domain
- The octahedron abstract domain
- Title not available (Why is that?)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
- Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
- Automatic modular abstractions for template numerical constraints
Cited In (13)
- Title not available (Why is that?)
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Finding relevant templates via the principal component analysis
- Verification, Model Checking, and Abstract Interpretation
- Template polyhedra and bilinear optimization
- Title not available (Why is that?)
- A note on the inversion join for polyhedral analysis
- Template polyhedra with a twist
- The abstract domain of parallelotopes
- The two variable per inequality abstract domain
- A complexity perspective on entailment of parameterized linear constraints
- Counterexample-Guided Refinement of Template Polyhedra
- Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs
Uses Software
This page was built for publication: Generalizing the template polyhedral domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000579)
