Integer Polyhedra for Program Analysis

interpretation. Polyhedral analysis is effective when the relationships be-tween variables are linear, but suffers from imprecision when it is neces-sary to take into account the integrality of the represented space. Impre-cision also arises when non-linear constraints occur. Moreover, in terms of tractability, even a space defined by linear constraints can become un-manageable owing to the excessive number of inequalities. Thus it is use-ful to identify those inequalities whose omission has least impact on the represented space. This paper shows how these issues can be addressed in a novel way by growing the integer hull of the space and approximating the number of integral points within a bounded polyhedron.