Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from imprecision when it is necessary to take into account the integrality of the represented space. Imprecision also arises when non-linear constraints occur. Moreover, in terms of tractability, even a space defined by linear constraints can become unmanageable owing to the excessive number of inequalities. Thus it is useful 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.
Unable to display preview. Download preview PDF.
- 2.Barvinok, A.: Computing the Volume, Computing Integral Points, and Exponential Sums. In: Computational Geometry, pp. 161–170. ACM Press, New York (1992)Google Scholar
- 6.Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints Among Variables of a Program. In: Principles of Programming Languages, pp. 84–96. ACM Press, New York (1978)Google Scholar
- 9.Eisenbrand, F.: Gomory-Chvátal Cutting Planes and the Elementary Closure of Polyhedra. PhD thesis, Universität des Saarlandes (2000)Google Scholar
- 10.Hartmann, M.E.: Cutting Planes and the Complexity of the Integer Hull. PhD thesis, School of Operations Research and Industrial Engineering, Cornell University (1988); Technical Report 819Google Scholar
- 19.Seghir, R., Loechner, V.: Memory Optimization by Counting Points in Integer Transformations of Parametric Polytopes. In: Compilers, Architectures, and Synthesis for Embedded Systems, pp. 74–82. ACM Press, New York (2006)Google Scholar
- 23.Wilde, D.K.: A Library for Doing Polyhedral Operations. Technical Report PI-785, IRISA (1993)Google Scholar