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.
DOI : 10.1145/109625.109631

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.621.1073

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, N. Vasilache, A. Leung, B. Meister, D. Wohlford et al., Extended static control programs as a programming model for accelerators, a case study: Targetting clearspeed csx700 with the r-stream compiler, PMEA'09 Workshop on Programming Models for Emerging Architectures, pp.45-52, 2009.

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

T. Grosser, S. Verdoolaege, and A. Cohen, Polyhedral AST Generation Is More Than Scanning Polyhedra, ACM Transactions on Programming Languages and Systems, vol.37, issue.4
DOI : 10.1145/2743016

URL : https://hal.archives-ouvertes.fr/hal-01257239

W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman et al., The Omega library, 1996.

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.8696

M. and L. Fur, Scanning parameterized polyhedron using Fourier-Motzkin elimination. Concurrency -Practice and Experience, pp.445-460, 1996.

H. and L. Verge, Recurrences on lattice polyhedra and their applications Unpublished work based on a manuscript written by H. Le Verge just before his untimely death in, 1994.

V. Loechner and D. K. Wilde, Parameterized polyhedra and their vertices, International Journal of Parallel Programming, vol.25, issue.6, pp.525-549, 1997.
DOI : 10.1023/A:1025117523902

URL : https://hal.archives-ouvertes.fr/inria-00534851

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

N. Vasilache, C. Bastoul, and A. Cohen, Polyhedral Code Generation in the Real World, Proceedings of the International Conference on Compiler Construction (ETAPS CC'06), pp.185-201, 2006.
DOI : 10.1007/11688839_16

URL : https://hal.archives-ouvertes.fr/inria-00001106