Generalizing the template polyhedral domain

DOI10.1007/978-3-642-19718-5_10MaRDI QIDQ3000579zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Linear programming (90C05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Polytopes and polyhedra (52B99)

Recommendations

• Template polyhedra and bilinear optimization
• Template polyhedra with a twist
• Verification, Model Checking, and Abstract Interpretation
• Fast polyhedra abstract domain
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3610766 (Why is no real title available?)
• scientific article; zbMATH DE number 1948398 (Why is no real title available?)
• scientific article; zbMATH DE number 1953274 (Why is no real title available?)
• scientific article; zbMATH DE number 1738295 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3078984 (Why is no real title available?)
• A Reachability Predicate for Analyzing Low-Level Software
• Automatic modular abstractions for template numerical constraints
• Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
• Logahedra: a new weakly relational domain
• On the identification of the convex hull of a finite set of points in the plane
• Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
• Precise Fixpoint Computation Through Strategy Iteration
• Program Analysis Using Symbolic Ranges
• Static Analysis by Policy Iteration on Relational Domains
• Temporal verification of reactive systems: response
• The octahedron abstract domain
• Two variables per linear inequality as an abstract domain
• Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

Cited in

(13)

• The abstract domain of parallelotopes
• scientific article; zbMATH DE number 1615255 (Why is no real title available?)
• The two variable per inequality abstract domain
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
• Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs
• Verification, Model Checking, and Abstract Interpretation
• Template polyhedra and bilinear optimization
• A complexity perspective on entailment of parameterized linear constraints
• A note on the inversion join for polyhedral analysis
• scientific article; zbMATH DE number 2090856 (Why is no real title available?)
• Finding relevant templates via the principal component analysis
• Template polyhedra with a twist
• Counterexample-Guided Refinement of Template Polyhedra

Describes a project that uses

Uses Software

• Apron
• HyTech
• z3
• PPL
• InvGen
• ASTREE
• FAST

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)