W. Achtziger and K. Zimmermann, Finding quadratic schedules for affine recurrence equations via nonsmooth optimization, Journal of VLSI Signal Processing, vol.25, pp.235-260, 2000.

M. Brion, Points entiers dans les polyedres convexes, Ann. Sci. Ecole Normale Supérieure, vol.21, issue.4, pp.653-663, 1988.

P. Clauss, Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientific programs, 10th ACM Int. Conf. on Supercomputing, ICS'96, 1996.
URL : https://hal.archives-ouvertes.fr/hal-01100306

P. Clauss, E. Altintas, and M. Kuhn, Automatic collapsing of non-rectangular loops, IEEE Int. Parallel and Distributed Processing Symposium (IPDPS), pp.778-787, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01581081

P. Clauss and I. Tchoupaeva, A symbolic approach to bernstein expansion for program analysis and optmization, LNCS, pp.120-133, 2004.

A. Cohen, A. Darte, and P. Feautrier, Static analysis of openstream programs, 6th International Workshop on Polyhedral Compilation Techniques, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01251845

A. Darte and A. Isoard, Exact and approximated data-reuse optimizations for tiling with parametric sizes, 24th Compiler Construction Int. Conf. (CC'15), part of ETAPS'15, pp.151-170, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01099017

E. Ehrhart, Polynomes arithmétiques et méthodes des polyèdres en combinatoire, International Series of Numerical Mathematics, vol.35, 1977.

P. Feautrier, Scalable and structured scheduling, International Journal of Parallel Programming, vol.34, issue.5, pp.459-487, 2006.

P. Feautrier, The power of polynomials, 5th International Workshop on Polyhedral Compilation Techniques, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01094787

P. Feautrier and C. Lengauer, The polyhedron model, Encyclopedia of Parallel Programming, 2011.

P. Feautrier, E. Violard, and A. Ketterlin, Improving the performance of x10 programs by clock removal, Compiler Construction CC 2014, number 8409 in LNCS, pp.113-132, 2014.

A. Größlinger, The Challenge of Non-linear Parameters and Variables in Automatic Loop Parallelisation, pp.739-17893, 2009.

A. Hartono, M. Muthu, C. Baskaran, A. Bastoul, S. Cohen et al., Parametric Multi-level Tiling of Imperfectly NestedLoops, Intl. Conf. on Supercomputing (ICS), pp.147-157, 2009.

G. Iooss, S. Rajopadhye, C. Alias, and Y. Zou, Cart: Constant aspect ratio tiling, Proceedings of the 4th International Workshop on Polyhedral Compilation Techniques, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00915827

A. Ketterlin, , 2017.

D. Kim, L. Renganarayanan, D. Rostron, S. Rajopadhye, and M. M. Strout, Multi-level tiling: M for the price of one, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing, SC '07, vol.51, pp.1-51, 2007.

V. Loechner, B. Meister, and P. Clauss, Precise datalocality optimization of nested loops, The Journal of Supercomputing, vol.21, issue.1, pp.37-76, 2002.

V. Maslov, Delinearization: An efficient way to break multiloop dependence equations, SIGPLAN Not, vol.27, issue.7, pp.152-161, 1992.

T. Nowatzki, M. Sartin-tarm, L. D. Carli, K. Sankaralingam, C. Estan et al., A scheduling framework for spatial architectures across multiple constraint-solving theories, ACM Trans. Program. Lang. Syst, vol.37, issue.1, 2014.

A. Pop and A. Cohen, Openstream: Expressiveness and Dataflow Compilation of, OpenMP Streaming Programs. ACM TACO, vol.9, issue.4, p.53, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00786675

V. Saraswat, B. Bloom, I. Peshansky, O. Tardieu, and D. Grove, X10 language specification version 2.2, 2012.

S. Verdoolaege, isl: An integer set library for the polyhedral model, International Congress on Mathematical Software (ICMS 2010), p.6327, 2010.

T. Yuki, Revisiting loop transformations with X10 clocks, Proceedings of the ACM SIGPLAN Workshop on X10, X10'15, pp.1-6, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01253630