J. Allen and K. Kennedy, Automatic translation of FORTRAN programs to vector form, ACM Transactions on Programming Languages and Systems, vol.9, issue.4, pp.491-542, 1987.
DOI : 10.1145/29873.29875

L. Bagnères, O. Zinenko, S. Huot, and C. Bastoul, Opening polyhedral compiler's black box, Proceedings of the 2016 International Symposium on Code Generation and Optimization, CGO 2016, 2016.
DOI : 10.1145/2854038.2854048

C. Bastoul, Code generation in the polyhedral model is easier than you think, Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004., pp.7-16, 2004.
DOI : 10.1109/PACT.2004.1342537
URL : https://hal.archives-ouvertes.fr/hal-00017260

C. Bastoul, Contributions to High-Level Program Optimization. Habilitation Thesis, 2012.

C. Bastoul and P. Feautrier, Adjusting a program transformation for legality. Parallel processing letters, pp.3-17, 2005.

M. Benabderrahmane, L. Pouchet, A. Cohen, and C. Bastoul, The Polyhedral Model Is More Widely Applicable Than You Think, Proceedings of the Intl. Conf. on Compiler Construction (ETAPS CC'10), pp.283-303, 2010.
DOI : 10.1007/978-3-642-11970-5_16
URL : https://hal.archives-ouvertes.fr/inria-00551087

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A practical automatic polyhedral parallelizer and locality optimizer, Proc. of the 2008 ACM Conf. on Programming language design and implementation (PLDI'08), 2008.

C. Chen, J. Chame, and M. Hall, A framework for composing highlevel loop transformations, 2008.

A. Darte, G. Silber, and F. Vivien, Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling, Parallel Processing Letters, vol.07, issue.04, pp.379-392, 1997.
DOI : 10.1142/S0129626497000383
URL : https://hal.archives-ouvertes.fr/hal-00856890

J. Doerfert, C. Hammacher, K. Streit, and S. Hack, SPolly: Speculative Optimizations in the Polyhedral Model, Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques, pp.55-60, 2013.

S. Donadio, J. Brodman, T. Roeder, K. Yotov, D. Barthou et al., A Language for the Compact Representation of Multiple Program Versions, Intl. Workshop on Languages and Compilers for Parallel Computing (LCPC), pp.136-151, 2005.
DOI : 10.1007/978-3-540-69330-7_10
URL : https://hal.archives-ouvertes.fr/hal-00141067

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=10.1.1.30.9957

P. Feautrier, Array expansion, ICS, pp.429-441, 1988.
DOI : 10.1145/2591635.2667159
URL : https://hal.archives-ouvertes.fr/hal-01099746

P. Feautrier, Some efficient solutions to the affine scheduling problem. I. One-dimensional time, International Journal of Parallel Programming, vol.40, issue.6, pp.313-348, 1992.
DOI : 10.1007/BF01407835

P. Feautrier and C. Lengauer, Polyhedron model, Encyclopedia of Parallel Computing, pp.1581-1592, 2011.

S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello et al., Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies, International Journal of Parallel Programming, vol.20, issue.1, pp.261-317, 2006.
DOI : 10.1007/s10766-006-0012-3
URL : https://hal.archives-ouvertes.fr/hal-01257288

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

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

T. Grosser, H. Zheng, R. Aloor, A. Simbürger, A. Grösslinger et al., Polly-polyhedral optimization in llvm, IMPACT 2011 First International Workshop on Polyhedral Compilation Techniques, 2011.

F. Irigoin, Dependence abstractions, Encyclopedia of Parallel Computing, pp.552-556, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00881133

F. Irigoin and R. Triolet, Computing dependence direction vectors and dependence cones with linear systems, 1987.

W. Kelly and W. Pugh, A framework for unifying reordering transformations, 1993.

V. Lefebvre and P. Feautrier, Automatic storage management for parallel programs, Parallel Computing, vol.24, issue.3-4, pp.649-671, 1998.
DOI : 10.1016/S0167-8191(98)00029-5

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

A. Lim, Improving Parallelism and Data Locality with Affine Partitioning, 2001.

K. Mckinley, S. Carr, and C. Tseng, Improving data locality with loop transformations, ACM Transactions on Programming Languages and Systems, vol.18, issue.4, pp.424-453, 1996.
DOI : 10.1145/233561.233564

A. Morvan, S. Derrien, and P. Quinton, Efficient nested loop pipelining in high level synthesis using polyhedral bubble insertion, 2011 International Conference on Field-Programmable Technology, 2011.
DOI : 10.1109/FPT.2011.6132715
URL : https://hal.archives-ouvertes.fr/hal-00746434

R. Müller-pfefferkorn, W. Nagel, and B. Trenkler, Optimizing Cache Access: A Tool for Source-to-Source Transformations and Real-Life Compiler Tests, Euro-Par 2004 Parallel Processing, 10th International Euro-Par Conference, pp.72-81, 2004.
DOI : 10.1007/978-3-540-27866-5_10

L. Pouchet, C. Bastoul, A. Cohen, and J. Cavazos, Iterative optimization in the polyhedral model: Part II, multidimensional time, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'08), pp.90-100, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01257273

L. Pouchet, U. Bondhugula, C. Bastoul, A. Cohen, J. Ramanujam et al., Combined Iterative and Model-driven Optimization in an Automatic Parallelization Framework, 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, 2010.
DOI : 10.1109/SC.2010.14
URL : https://hal.archives-ouvertes.fr/inria-00551067

L. Pouchet, U. Bondhugula, C. Bastoul, A. Cohen, J. Ramanujam et al., Loop transformations: Convexity, pruning and optimization, 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (PoPL'11), pp.549-562, 2011.
DOI : 10.1145/1925844.1926449
URL : https://hal.archives-ouvertes.fr/inria-00551077

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

K. Stock, M. Kong, T. Grosser, L. Pouchet, F. Rastello et al., A framework for enhancing data reuse via associative reordering, ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '14, p.10, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01016093

K. Trifunovic, A. Cohen, D. Edelsohn, F. Li, T. Grosser et al., Graphite two years after: First lessons learned from real-world polyhedral compilation, GCC Research Opportunities Workshop (GROW'10), 2010.
URL : https://hal.archives-ouvertes.fr/inria-00551516

N. Vasilache, C. Bastoul, S. Girbal, and A. Cohen, Violated dependence analysis, Proceedings of the 20th annual international conference on Supercomputing , ICS '06, pp.335-344, 2006.
DOI : 10.1145/1183401.1183448
URL : https://hal.archives-ouvertes.fr/hal-01257290

N. Vasilache, A. Cohen, and L. Pouchet, Automatic Correction of Loop Transformations, 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), pp.292-304, 2007.
DOI : 10.1109/PACT.2007.4336220
URL : https://hal.archives-ouvertes.fr/hal-01257283

A. Venkat, M. Shantharam, M. Hall, and M. M. Strout, Non-affine Extensions to Polyhedral Code Generation, Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization, CGO '14, pp.185-194, 2014.
DOI : 10.1145/2581122.2544141

S. Verdoolaege, isl: An Integer Set Library for the Polyhedral Model, Mathematical Software -ICMS 2010, Third International Congress on Mathematical Software, pp.299-302, 2010.
DOI : 10.1007/978-3-642-15582-6_49

S. Verdoolaege, J. C. Juega, A. Cohen, J. I. Gómez, C. Tenllado et al., Polyhedral parallel code generation for CUDA, ACM Transactions on Architecture and Code Optimization, vol.9, issue.4, p.2013
DOI : 10.1145/2400682.2400713
URL : https://hal.archives-ouvertes.fr/hal-00786677

M. Wolf and M. Lam, A data locality optimizing algorithm, ACM SIGPLAN'91 Conf. on Programming Language Design and Implementation, pp.30-44, 1991.

M. J. Wolfe, Optimizing supercompilers for supercomputers, 1982.

Y. Yang, C. Ancourt, and F. Irigoin, Minimal data dependence abstractions for loop transformations, International Journal of Parallel Programming, vol.23, issue.4, pp.359-388, 1995.
DOI : 10.1007/BFb0025880

O. Zinenko, S. Huot, and C. Bastoul, Clint: A direct manipulation tool for parallelizing compute-intensive program parts, 2014 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), pp.109-112, 2014.
DOI : 10.1109/VLHCC.2014.6883031
URL : https://hal.archives-ouvertes.fr/hal-01055788