Polyhedral Analysis Using Parametric Objectives

摘要

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 permits anytime approximation of the output.