C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, Proc. third SIGPLAN Symp. 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, ISPDC'03 IEEE International Symposium on Parallel and Distributed Computing, 2003.
DOI : 10.1109/ispdc.2003.1267639

A. Benveniste, P. Caspi, N. Halbwachs, and P. L. Guernic, Dataflow synchronous languages, A Decade of Concurrency, Reflexions and Perspective. REX School / Symposium, vol.803, pp.1-45, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00074583

A. J. Bernstein, Analysis of programs for parallel processing, IEEE Trans. on El. Computers, p.15, 1966.
DOI : 10.1109/pgec.1966.264565

A. Darte, R. Schreiber, and G. Villard, Lattice-based memory allocation, 6th ACM International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES 2003), 2003.
DOI : 10.1145/951710.951749

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

P. Feautrier, Semantical analysis and mathematical programming; application to parallelization and vectorization, Workshop on Parallel and Distributed Algorithms, pp.309-320, 1989.

P. Feautrier, Some efficient solutions to the affine scheduling problem, I, one dimensional time, Int. J. of Parallel Programming, vol.21, issue.5, pp.313-348, 1992.
DOI : 10.1007/bf01407835

P. Feautrier, Some efficient solutions to the affine scheduling problem, II, multidimensional time, Int. J. of Parallel Programming, vol.21, issue.6, pp.389-420, 1992.
DOI : 10.1007/bf01379404

M. Griebl, P. Feautrier, and C. Lengauer, Index set splitting, Int. J. of Parallel Programming, vol.28, issue.6, pp.607-631, 2000.
DOI : 10.1109/pact.1999.807572

C. A. Hoare, Communicating sequential processes, Communications of the ACM, vol.21, 1978.

G. Kahn, The semantics of a simple language for parallel programming, vol.94, pp.471-475, 1974.

V. Lefebvre and P. Feautrier, Optimizing storage size for static control programs in automatic parallelizers, Europar'97, vol.1300, pp.356-363, 1997.
DOI : 10.1007/bfb0002757

H. Leverge, C. Mauras, and P. Quinton, The alpha language and its use for the design of systolic arrays, Journal of VLSI Signal Processing, vol.3, pp.173-182, 1991.

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.

P. Quinton and T. Risset, Structured scheduling of recurrence equations: Theory and practice, Proc. of the System Architecture MOdelling and Simulation Workshop, 2001.
DOI : 10.1007/3-540-45874-3_7

P. Quinton, The systematic design of systolic arrays, Automata networks in Computer Science, pp.229-260, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00076342

A. Schrijver, Theory of linear and integer programming, 1986.

R. E. Tarjan, Graph theory and gaussian elimination, Sparse Matrix Computations, 1976.

R. Triolet, F. Irigoin, and P. Feautrier, Automatic parallelization of FOR-TRAN programs in the presence of procedure calls, ESOP 1986, vol.213, 1986.

D. Wilde, A library for doing polyhedral operations, Irisa, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00074515