F. Balasa, P. G. Kjeldsberg, M. Palkovic, A. Vandecappelle, and F. Catthoor, Loop transformation methodologies for array-oriented memory management, Proceedings of the IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06), pp.205-212, 2006.

P. Clauss, F. J. Fernandez, D. Gabervetsky, and S. Verdoolaege, Symbolic polynomial maximization over convex sets and its application to memory requirement estimation, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00504617

J. Collard, D. Barthou, and P. Feautrier, Fuzzy array dataflow analysis, Proceedings of 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PLDI'95), 1995.

A. Darte and G. Huard, Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology, vol.40, pp.35-55, 2005.

A. Darte, R. Schreiber, and G. Villard, Lattice-based memory allocation, 6th ACM International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES'03), pp.298-308, 2003.
URL : https://hal.archives-ouvertes.fr/hal-02101912

A. Darte, R. Schreiber, and G. Villard, Lattice-based memory allocation, IEEE Transactions on Computers, vol.54, issue.10, pp.1242-1257, 2005.
URL : https://hal.archives-ouvertes.fr/hal-02101912

E. De-greef, F. Catthoor, and H. De-man, Memory size reduction through storage order optimization for embedded parallel multimedia applications, Parallel Computing, vol.23, pp.1811-1837, 1997.

P. Feautrier, Parametric integer programming, RAIRO Recherche Opérationnelle, vol.22, issue.3, pp.243-268, 1988.

P. Feautrier, Data flow analysis of scalar and array references, International Journal of Parallel Programming, vol.20, issue.1, pp.23-53, 1991.

, GNU Free Software. GLPK

P. M. Gruber and C. G. Lekkerkerker, Geometry of Numbers, 1987.

V. Kathail, S. Aditya, R. Schreiber, B. R. Rau, D. C. Cronquist et al., PICO: Automatically designing custom computers, IEEE Computer, vol.35, issue.9, pp.39-47, 2002.

V. Lefebvre and P. Feautrier, Automatic storage management for parallel programs, Parallel Computing, vol.24, pp.649-671, 1998.

L. Lovász and H. E. Scarf, The generalized basis reduction algorithm, Mathematics of Operations Research, vol.17, issue.3, pp.751-764, 1992.

M. Newman, Integral Matrices, 1972.

. Pip/polylib, The Parametric Integer Programming's home

W. Pugh, The Omega test: A fast and practical integer programming algorithm for dependence analysis, Communications of the ACM, vol.8, pp.102-114, 1992.

F. Quilleré and S. Rajopadhye, Optimizing memory usage in the polyhedral model, ACM Transactions on Programming Languages and Systems, vol.22, issue.5, pp.773-815, 2000.

D. J. Quinlan, ROSE: Compiler support for object-oriented frameworks, Parallel Processing Letters, vol.10, issue.2/3, pp.215-226, 2000.

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

G. Silber and A. Darte, The Nestor library: A tool for implementing Fortran source to source transformations, High Performance Computing and Networking (HPCN'99), vol.1593, pp.653-662, 1999.
URL : https://hal.archives-ouvertes.fr/hal-02102034

Y. Song, R. Xu, C. Wang, and Z. Li, Improving data locality by array contraction, IEEE Transactions on Computers, vol.53, issue.9, pp.1073-1084, 2004.

M. M. Strout, L. Carter, J. Ferrante, and B. Simon, Schedule-independent storage mapping for loops, 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'98), pp.24-33, 1998.

W. Thies, F. Vivien, J. Sheldon, and S. Amarasinghe, A unified framework for schedule and storage optimization, International Conference on Programming Language Design and Implementation (PLDI'01), pp.232-242, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00808285

R. Tronçon, M. Bruynooghe, G. Janssens, and F. Catthoor, Storage size reduction by in-place mapping of arrays, Model Checking and Abstract Interpretation, Third International Workshop, vol.2294, pp.167-181, 2002.

A. Turjan, B. Kienhuis, and E. Deprettere, Translating affine nested-loop programs to process networks, 7th ACM International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES'04), pp.220-229, 2004.

S. Udayakumaran, A. Dominguez, and R. Barua, Dynamic allocation for scratch-pad memory using compile-time decisions, ACM Transactions on Embedded Computing Systems, vol.5, issue.2, pp.472-511, 2006.

S. Verdoolaege, H. Nikolov, and T. Stefanov, Improved derivation of process networks, 4th Workshop on Optimization for DSP and Embedded Systems (ODES-4), 2006.

M. E. Wolf and M. S. Lam, A data locality optimizing algorithm, Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation (PLDI'91), pp.30-44, 1991.

Y. Zhao and S. Malik, Exact memory size estimation for array computations without loop unrolling, DAC'99: Proceedings of the 36th ACM/IEEE conference on Design automation, pp.811-816, 1999.

H. Zhu, I. I. Luican, and F. Balasa, Memory size computation for multimedia processing applications, ASP-DAC'06: Proceedings of the 2006 conference on Asia South Pacific design automation, pp.802-807, 2006.