U. Bondhugula, V. Bandishti, and A. Cohen, Tiling and optimizing time-iterated computations over periodic domains, Proceedings of the 23rd International Conference on Parallel Architecture and Compilation Techniques (PACT '14, pp.39-50, 2014.

A. Cohen, A. Darte, and P. Feautrier, Static Analysis of OpenStream Programs, Proceedings of the 6th International Workshop on Polyhedral Compilation Techniques (IMPACT '16), 2016.
URL : https://hal.archives-ouvertes.fr/hal-01251845

P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, I, One-dimensional Time, International Journal of Parallel Programming, vol.21, pp.313-348, 1992.

P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, II, Multidimensional Time, International Journal of Parallel Programming, vol.21, pp.389-420, 1992.

P. Feautrier, The Power of Polynomials, Proceedings of the 5th International Workshop on Polyhedral Compilation Techniques (IMPACT '15), 2015.
URL : https://hal.archives-ouvertes.fr/hal-01094787

P. Feautrier and A. Cohen, On Polynomial Code Generation, Proceedings of the 8th International Workshop on Polyhedral Compilation Techniques (IMPACT '18), 2018.
URL : https://hal.archives-ouvertes.fr/hal-01958096

P. Feautrier and C. Lengauer, The Polyhedron Model, Encyclopedia of Parallel Programming, 2011.

M. Griebl, P. Feautrier, and C. Lengauer, Index Set Splitting, International Journal of Parallel Programming, vol.28, issue.6, pp.607-631, 2000.

D. Handelman, Representing polynomials by positive linear functions on compact convex polyhedra, Pacific J. Math, vol.132, pp.35-62, 1988.

J. Lasserre, Global Optimization with Polynomials and the Problem of Moments, SIAM Journal on Optimization, vol.11, pp.796-817, 2001.

J. B. Lasserre, Semidefinite Programming vs, LP Relaxations for Polynomial Programming. Mathematics of Operations Research, vol.27, issue.2, pp.347-360, 2002.

M. Laurent, Sums of Squares, Moment Matrices and Optimization Over Polynomials, pp.157-270, 2009.

R. Teja-mullapudi and U. Bondhugula, Tiling for Dynamic Scheduling, Proceedings of the 4th International Workshop on Polyhedral Compilation Techniques (IMPACT '14), 2014.

J. Nie and M. Schweighofer, On the complexity of Putinar's Positivstellensatz, Journal of Complexity, vol.23, pp.135-150, 2007.

N. Diogo, L. Sampaio, F. Pouchet, and . Rastello, Simplification and Runtime Resolution of Data Dependence Constraints for Loop Transformations, Proceedings of the International Conference on Supercomputing (ICS '17), vol.10, 2017.

C. Scheiderer, Positivity and Sums of Squares: A Guide to Recent Results, pp.271-324, 2009.

, The K-moment problem for compact semialgebraic sets, Math. Ann, vol.289, pp.203-206, 1991.

M. Schweighofer, An algorithmic approach to Schmüdgen's Positivstellensatz, Journal of Pure and Applied Algebra, vol.166, pp.307-319, 2002.

M. Schweighofer, On the complexity of Schmüdgen's Positivstellensatz, Journal of Complexity, vol.20, pp.529-543, 2004.

D. Hanif, C. H. Sherali, and . Tuncbilek, A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique, Journal of Global Optimization, vol.2, pp.101-112, 1992.

Y. Yaacoby and P. R. Cappello, Converting affine recurrence equations to quasi-uniform recurrence equations, VLSI Algorithms and Architectures, pp.319-328, 1988.