C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp.39-50, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00752774

C. Bastoul, Efficient code generation for automatic parallelization and optimization, Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings., pp.23-30, 2003.
DOI : 10.1109/ISPDC.2003.1267639

C. Bastoul, A. Cohen, S. Girbal, S. Sharma, and O. Temam, Putting Polyhedral Loop Transformations to Work, LCPC'16 International Workshop on Languages and Compilers for Parallel Computers, pp.209-225, 2003.
DOI : 10.1007/978-3-540-24644-2_14
URL : https://hal.archives-ouvertes.fr/inria-00071681

Y. Bouchebaba, Optimisation des transferts de données pour le traitement du signal: pavage, fusion et réallocation des tableaux, 2002.

P. Boulet, A. Darte, G. Silber, and F. Vivien, Loop parallelization algorithms: From parallelism extraction to code generation, Parallel Computing, vol.24, issue.3-4, pp.421-444, 1998.
DOI : 10.1016/S0167-8191(98)00020-9
URL : https://hal.archives-ouvertes.fr/hal-00856896

P. Clauss, Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs, Int. Conference on Supercomputing, pp.278-285, 1996.
URL : https://hal.archives-ouvertes.fr/hal-01100306

J. Collard, T. Risset, and P. Feautrier, CONSTRUCTION OF DO LOOPS FROM SYSTEMS OF AFFINE CONSTRAINTS, Parallel Processing Letters, vol.05, issue.03, pp.421-436, 1995.
DOI : 10.1142/S0129626495000394

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-97, 1978.
DOI : 10.1145/512760.512770

A. Darte and Y. Robert, Mapping uniform loop nests onto distributed memory architectures, Parallel Computing, vol.20, issue.5, pp.679-710, 1994.
DOI : 10.1016/0167-8191(94)90001-9
URL : https://hal.archives-ouvertes.fr/hal-00857077

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

P. Feautrier, Dataflow analysis of array and scalar references, International Journal of Parallel Programming, vol.24, issue.4, pp.23-53, 1991.
DOI : 10.1007/BF01407931

P. Feautrier, Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time, International Journal of Parallel Programming, vol.2, issue.4, pp.389-420, 1992.
DOI : 10.1007/BF01379404

M. Griebl, P. Feautrier, and C. Lengauer, On index set splitting, 1999 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00425), pp.607-631, 2000.
DOI : 10.1109/PACT.1999.807572

M. Griebl, C. Lengauer, and S. Wetzel, Code generation in the polytope model, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192), pp.106-111, 1998.
DOI : 10.1109/PACT.1998.727179

W. Kelly, W. Pugh, and E. Rosser, Code generation for multiple mappings, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation, 1995.
DOI : 10.1109/FMPC.1995.380437

D. Kuck, The Structure of Computers and Computations [17] M. Le Fur. Parcours de polyèdres paramétrés avec l'´ elimination de Fourier-Motzkin, 1978.

H. and L. Verge, A note on Chernikova's algorithm, 1992.

H. , L. Verge, V. Van-dongen, and D. Wilde, Loop nest synthesis using the polyhedral library, 1994.
URL : https://hal.archives-ouvertes.fr/inria-00074384

W. Li and K. Pingali, A singular loop transformation framework based on non-singular matrices, International Journal of Parallel Programming, vol.16, issue.4, pp.183-205, 1994.
DOI : 10.1007/BF02577874

F. Quilleré, S. Rajopadhye, and D. Wilde, Generation of efficient nested loops from polyhedra, International Journal of Parallel Programming, vol.28, issue.5, pp.469-498, 2000.
DOI : 10.1023/A:1007554627716

J. Ramanujam, Beyond unimodular transformations, The Journal of Supercomputing, vol.3, issue.5, pp.365-389, 1995.
DOI : 10.1007/BF01206273

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

Y. Slama and M. Jemni, Vers l'extension du modèle polyédrique aux transformationsirrégulì eres, CARI'5 International Conference on African Research in Computer Science, 2000.

S. Wetzel, Automatic code generation in the polytope model, 1995.

D. Wilde, A LIBRARY FOR DOING POLYHEDRAL OPERATIONS, Parallel Algorithms and Applications, vol.15, issue.3-4, 1993.
DOI : 10.1007/BF02574699
URL : https://hal.archives-ouvertes.fr/inria-00074515

J. Xue, Automating non-unimodular loop transformations for massive parallelism, Parallel Computing, vol.20, issue.5, pp.711-728, 1994.
DOI : 10.1016/0167-8191(94)90002-7

J. Xue, Transformations of nested loops with non-convex iteration spaces, Parallel Computing, vol.22, issue.3, pp.339-368, 1996.
DOI : 10.1016/0167-8191(95)00069-0