J. Ahn, S. Yoo, O. Mutlu, and K. Choi, Pim-enabled instructions: A low-overhead, locality-aware processing-in-memory architecture, 2015 ACM/IEEE 42nd Annual International Symposium on Computer Architecture (ISCA), pp.336-348, 2015.

L. Bagnères, O. Zinenko, S. Huot, and C. Bastoul, Opening Polyhedral Compiler's Black Box, CGO 2016-14th Annual IEEE/ACM International Symposium on Code Generation and Optimization, 2016.

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 '16, pp.128-138, 2016.

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

C. Bastoul, Mapping Deviation: A Technique to Adapt or to Guard Loop Transformation Intuitions for Legality, CC'2016 25th International Conference on Compiler Construction, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01271998

C. Bastoul, A. Cohen, S. Girbal, S. Sharma, and O. Temam, Putting polyhedral loop transformations to work, Languages and Compilers for Parallel Computing, pp.209-225, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071681

U. Bondhugula, S. Dash, O. Gunluk, and L. Renganarayanan, A model for fusion and code motion in an automatic parallelizing compiler, 19th International Conference on Parallel Architectures and Compilation Techniques (PACT), pp.343-352, 2010.

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A practical and fully automatic polyhedral program optimization system, ACM SIGPLAN PLDI, 2008.

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A Practical Automatic Polyhedral Parallelizer and Locality Optimizer, ACM SIGPLAN Notices, vol.43, issue.6, pp.101-113, 2008.

C. Chen, Polyhedra scanning revisited, Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '12, pp.499-508, 2012.

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

S. Donadio, J. Brodman, T. Roeder, K. Yotov, D. Barthou et al., A language for the compact representation of multiple program versions, Languages and Compilers for Parallel Computing, pp.136-151, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00141067

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

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

P. Feautrier and C. Lengauer, Polyhedron Model, pp.1581-1592, 2011.

R. Gareev, T. Grosser, and M. Kruse, High-performance generalized tensor operations: A compiler-oriented approach, ACM Trans. Archit. Code Optim, vol.15, issue.3, 2018.

S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello et al., Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies, Int. J. Parallel Program, vol.34, issue.3, pp.261-317, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01257288

T. Grosser, A. Cohen, J. Holewinski, P. Sadayappan, and S. Verdoolaege, Hybrid hexagonal/classical tiling for gpus, Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization, CGO '14, vol.66, pp.66-66, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00911177

T. Grosser, S. Verdoolaege, and A. Cohen, Polyhedral AST generation is more than scanning polyhedra, ACM Trans. Program. Lang. Syst, vol.37, issue.4, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01257239

T. Grosser, S. Verdoolaege, and A. Cohen, Polyhedral ast generation is more than scanning polyhedra, ACM Trans. Program. Lang. Syst, vol.37, issue.4, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01257239

. Inria,

T. Grosser, H. Zheng, R. Aloor, A. Simbürger, A. Größlinger et al., Polly-polyhedral optimization in llvm, Proceedings of the First International Workshop on Polyhedral Compilation Techniques (IMPACT), vol.2011, 2011.

R. Hadidi, L. Nai, H. Kim, and H. Kim, Cairo: A compiler-assisted technique for enabling instruction-level offloading of processing-in-memory, ACM Trans. Archit. Code Optim, vol.14, issue.4, 2017.

T. Henretty, K. Stock, L. Pouchet, F. Franchetti, J. Ramanujam et al., Data layout transformation for stencil computations on short-vector simd architectures, Proceedings of the 20th International Conference on Compiler Construction: Part of the Joint European Conferences on Theory and Practice of Software, CC'11/ETAPS'11, pp.225-245, 2011.

K. Hsieh, E. Ebrahim, G. Kim, N. Chatterjee, M. O'connor et al., Transparent offloading and mapping (tom): Enabling programmer-transparent near-data processing in gpu systems, 2016 ACM/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA), pp.204-216, 2016.

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

T. M. Low, F. D. Igual, T. M. Smith, and E. S. Quintana-orti, Analytical modeling is enough for high-performance blis, ACM Trans. Math. Softw, vol.43, issue.2, pp.1-12, 2016.

R. T. Mullapudi, V. Vasista, and U. Bondhugula, Polymage: Automatic optimization for image processing pipelines, SIGARCH Comput. Archit. News, vol.43, issue.1, pp.429-443, 2015.

L. Nai, R. Hadidi, J. Sim, H. Kim, P. Kumar et al., Graphpim: Enabling instruction-level pim offloading in graph computing frameworks, 2017 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp.457-468, 2017.

R. Nair, S. F. Antao, C. Bertolli, P. Bose, J. R. Brunheroto et al.,

C. H. Cher, J. Costa, C. Doi, B. M. Evangelinos, T. W. Fleischer et al., Active memory cube: A processing-in-memory architecture for exascale systems, IBM Journal of Research and Development, vol.59, issue.2/3, 2015.

A. Pattnaik, X. Tang, A. Jog, O. Kayiran, A. K. Mishra et al., Scheduling techniques for gpu architectures with O. Zinenko & L. Chelini & T. Grosser processing-in-memory capabilities, 2016 International Conference on Parallel Architecture and Compilation Techniques (PACT), pp.31-44, 2016.

S. Pop, A. Cohen, C. Bastoul, S. Girbal, G. Silber et al., Graphite: Polyhedral analyses and optimizations for gcc, Proceedings of the 2006 GCC Developers Summit, p.2006, 2006.

G. Rudy, CUDA-CHiLL: A programming language interface for GPGPU optimizations and code generation, 2010.

G. Rudy, M. M. Khan, M. Hall, C. Chen, and J. Chame, A Programming Language Interface to Describe Transformations and Code Generation, Languages and Compilers for Parallel Computing, number 6548 in Lecture Notes in Computer Science, pp.136-150, 2010.

N. Vasilache, O. Zinenko, T. Theodoridis, P. Goyal, Z. Devito et al., Tensor comprehensions: Framework-agnostic high-performance machine learning abstractions, 2018.

N. Vasilache, O. Zinenko, T. Theodoridis, P. Goyal, Z. Devito et al., Tensor comprehensions: Framework-agnostic high-performance machine learning abstractions, 2018.

S. Verdoolaege, Isl: An integer set library for the polyhedral model, Proceedings of the Third International Congress Conference on Mathematical Software, ICMS'10, pp.299-302, 2010.

S. Verdoolaege, Counting affine calculator and applications, First International Workshop on Polyhedral Compilation Techniques (IMPACT'11), 2011.

S. Verdoolaege, J. C. Juega, A. Cohen, J. I. Gómez, C. Tenllado et al., Polyhedral parallel code generation for cuda, ACM Trans. Archit. Code Optim, vol.9, issue.4, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00786677

S. Verdoolaege and T. Grosser, Polyhedral extraction tool, Second Int. Workshop on Polyhedral Compilation Techniques (IMPACT'12), 2012.

S. Verdoolaege, S. Guelton, T. Grosser, and A. Cohen, Schedule Trees, 4th Workshop on Polyhedral Compilation Techniques (IMPACT, Associated with HiPEAC), p.9, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00911894

S. Verdoolaege and A. Isoard, Consecutivity in the isl polyhedral scheduler, 2017.

M. J. Wolfe, High Performance Compilers for Parallel Computing, 1995.

Q. Yi, Poet: A scripting language for applying parameterized source-tosource program transformations, Softw. Pract. Exper, vol.42, issue.6, pp.675-706, 2012.

T. Yuki, G. Gupta, D. Kim, T. Pathan, and S. Rajopadhye, Alphaz: A system for design space exploration in the polyhedral model, International Workshop on Languages and Compilers for Parallel Computing, pp.17-31, 2012.

J. Zhao, M. Kruse, and A. Cohen, A polyhedral compilation framework for loops with dynamic data-dependent bounds, Proceedings of the 27th International Conference on Compiler Construction, CC 2018, pp.14-24, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01720368

O. Zinenko, Interactive Program Restructuring, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01414770

O. Zinenko, S. Verdoolaege, C. Reddy, J. Shirako, T. Grosser et al., Unified Polyhedral Modeling of Temporal and Spatial Locality, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01628798

O. Zinenko, S. Verdoolaege, C. Reddy, J. Shirako, T. Grosser et al., Modeling the conflicting demands of parallelism and temporal/spatial locality in affine scheduling, Proceedings of the 27th International Conference on Compiler Construction, pp.3-13, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01751823