Polyhedral Analysis Using Parametric Objectives

@inproceedings{Howe2012PolyhedralAU,
  title={Polyhedral Analysis Using Parametric Objectives},
  author={Jacob M. Howe and Andy King},
  booktitle={SAS},
  year={2012}
}
The abstract domain of polyhedra lies at the heart of many program analysis techniques. However, its operations can be expensive, precluding their application to polyhedra that involve many variables. This paper describes a new approach to computing polyhedral domain operations. The core of this approach is an algorithm to calculate variable elimination (projection) based on parametric linear programming. The algorithm enumerates only non-redundant inequalities of the projection space, hence… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 38 references

The Computational Algorithm for the Parametric Objective Function

  • S. Gass, T. Saaty
  • Naval Research Logistics Quarterly, 2(1-2):39–45,
  • 1955
Highly Influential
13 Excerpts

A Note on Chernikova’s algorithm

  • H. Le Verge
  • Technical Report 1662, Institut de Recherche en…
  • 1992
Highly Influential
5 Excerpts

Algorithm for Discovering the Set of All the Solutions of a Linear Programming Problem

  • N. V. Chernikova
  • Computational Mathematics and Mathematical…
  • 1968
Highly Influential
4 Excerpts

Über Homogene Lineare Ungleichungssysteme

  • E. Burger
  • Zeitschrift für Angewandte Mathematik und…
  • 1956
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…