M. W. Baldoni-silva, M. Beck, C. Cochet, and M. Vergne, Volume Computation for Polytopes and Partition Functions for Classical Root Systems, Discrete & Computational Geometry, vol.35, issue.4, pp.551-595, 2006.
DOI : 10.1007/s00454-006-1234-2

A. I. Barvinok, Computing the Ehrhart polynomial of a convex lattice polytope, Discrete & Computational Geometry, vol.295, issue.2, pp.35-48, 1994.
DOI : 10.1007/BF02574364

A. Barvinok and K. Woods, Short rational generating functions for lattice point problems, Journal of the American Mathematical Society, vol.16, pp.657-979, 2003.

A. I. Barvinok, A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed, Mathematics of Operations Research, vol.19, issue.4, pp.769-779, 1994.
DOI : 10.1287/moor.19.4.769

B. Boigelot and L. Latour, Counting the solutions of Presburger equations without enumerating them, Theoretical Computer Science, vol.313, issue.1, pp.17-29, 2004.
DOI : 10.1016/j.tcs.2003.10.002

P. Boulet and X. Redon, Communication pre-evaluation in HPF, EUROPAR'98, pp.263-272, 1998.
DOI : 10.1007/BFb0057861

URL : https://hal.archives-ouvertes.fr/inria-00565190

P. Clauss and V. Loechner, Parametric analysis of polyhedral iteration spaces, Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96, pp.179-194, 1998.
DOI : 10.1109/ASAP.1996.542833

URL : https://hal.archives-ouvertes.fr/inria-00534840

P. D-'alberto, A. Veidembaum, A. Nicolau, and R. Gupta, Static analysis of parameterized loop nests for energy efficient use of data caches, Workshop on Compilers and Operating Systems for Low Power (COLP01), 2001.

B. George, B. C. Dantzig, and . Eaves, Fourier-Motzkin elimination and its dual, J. Comb. Theory, Ser. A, vol.14, issue.3, pp.288-297, 1973.

A. Jesús, R. De-loera, J. Hemmecke, R. Tauzer, and . Yoshida, Effective lattice point counting in rational convex polytopes, Journal of Symbolic Computation, vol.38, issue.4, pp.1273-1302, 2004.

E. Ehrhart, Polynômes arithmétiques et méthode des polyèdres en combinatoire, International Series of Numerical Mathematics, vol.35, 1977.

P. Feautrier, J. Collard, and C. Bastoul, Solving systems of affine (in)equalities, 2002.

P. Feautrier, Parametric integer programming, RAIRO - Operations Research, vol.22, issue.3, pp.243-268, 1988.
DOI : 10.1051/ro/1988220302431

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Ghosh, M. Martonosi, and S. Malik, Cache miss equations: a compiler framework for analyzing and tuning memory behavior, ACM Transactions on Programming Languages and Systems, vol.21, issue.4, pp.703-746, 1999.
DOI : 10.1145/325478.325479

F. Heine and A. Slowik, Volume driven data distribution for NUMAmachines, Proceedings from the 6th International Euro-Par Conference on Parallel Processing, pp.415-424, 2000.

W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman et al., The Omega Library, 1996.

M. Köppe, S. Verdoolaege, and K. Woods, An implementation of the barvinok?woods integer projection algorithm, ITSL, pp.53-59, 2008.

G. Kreisel and J. L. Krevine, Elements of Mathematical Logic. The Netherlands, 1967.

A. Lasaruk and T. Sturm, Weak quantifier elimination for the full linear theory of the integers, Applicable Algebra in Engineering, Communication and Computing, vol.8, issue.2, pp.545-574, 2007.
DOI : 10.1007/s00200-007-0053-x

V. Loechner, Polylib: A library for manipulating parameterized polyhedra, 1999.

V. Loechner, B. Meister, and P. Clauss, Precise data locality optimization of nested loops, The Journal of Supercomputing, vol.21, issue.1, pp.37-76, 2002.
DOI : 10.1023/A:1013535431127

URL : https://hal.archives-ouvertes.fr/inria-00534831

B. Meister, Projecting periodic polyhedra for loop nest analysis, Proceedings of the 11th Workshop on Compilers for Parallel Computers (CPC 04), Kloster Seeon, pp.13-24, 2004.

S. , K. Nookala, and T. Risset, A library for Z-polyhedral operations, 1330.

E. Parker and S. Chatterjee, An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas, Compiler Construction, pp.104-119, 2004.
DOI : 10.1007/978-3-540-24723-4_8

W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis, Proceedings of the 1991 ACM/IEEE conference on Supercomputing , Supercomputing '91, pp.4-13, 1991.
DOI : 10.1145/125826.125848

W. Pugh, Counting solutions to Presburger formulas: how and why, SIGPLAN Conference on Programming Language Design and Implementation (PLDI'94), pp.121-134, 1994.

W. Pugh and D. Wonnacott, Experiences with constraint-based array dependence analysis, Principles and Practice of Constraint Programming, pp.312-325, 1994.
DOI : 10.1007/3-540-58601-6_109

P. Quinton, S. Rajopadhye, and T. Risset, On Manipulating Z-Polyhedra Using a Canonical Representation, Parallel Processing Letters, vol.07, issue.02, pp.181-194, 1997.
DOI : 10.1142/S012962649700019X

J. Ramanujam, J. Hong, M. Kandemir, and A. Narayan, Reducing memory requirements of nested loops for embedded systems, Proceedings of the 38th conference on Design automation , DAC '01, pp.359-364, 2001.
DOI : 10.1145/378239.378523

A. Schrijver, Theory of linear and integer programming, 1986.

R. Seghir and V. Loechner, Memory optimization by counting points in integer transformations of parametric polytopes, Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems , CASES '06, pp.74-82, 2006.
DOI : 10.1145/1176760.1176771

A. Turjan, B. Kienhuis, and E. Deprettere, Solving Out-of-Order Communication in Kahn Process Networks, Journal of VLSI signal processing systems for signal, image and video technology, vol.14, issue.3, pp.7-18, 2005.
DOI : 10.1007/s11265-005-4935-5

S. Verdoolaege, Barvinok: user guide, 2006.

S. Verdoolaege, K. Beyls, M. Bruynooghe, and F. Catthoor, Experiences with Enumeration of Integer Projections of Parametric Polytopes, Compiler Construction: 14th International Conference, pp.91-105, 2005.
DOI : 10.1007/978-3-540-31985-6_7

S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, and M. Bruynooghe, Analytical computation of Ehrhart polynomials, Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems , CASES '04, pp.248-258, 2004.
DOI : 10.1145/1023833.1023868

S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, and M. Bruynooghe, Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions, Algorithmica, vol.48, issue.1, pp.37-66, 2007.
DOI : 10.1007/s00453-006-1231-0

S. Verdoolaege and K. Woods, Counting with rational generating functions, Journal of Symbolic Computation, vol.43, issue.2, p.504059, 2005.
DOI : 10.1016/j.jsc.2007.07.007

Y. Zhao and S. Malik, Exact memory size estimation for array computations, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp.517-521, 2000.

H. Zhu, I. I. Luican, and F. Balasa, Memory Size Computation for Real-Time Multimedia Applications Based on Polyhedral Decomposition, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.89, issue.12, pp.89-3378, 2006.
DOI : 10.1093/ietfec/e89-a.12.3378