C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, Proc. of the Third ACM/SIGPLAN Symp. on Principles and Practice of Parallel Programming, pp.39-50, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00752774

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

A. Beletska, D. Barthou, W. Bielecki, and A. Cohen, Computing the Transitive Closure of a Union of Affine Integer Tuple Relations, Proc. of the Third Annual Conference on Combinatorial Optimization and Applications (COCOA'2009), pp.98-109, 2009.
DOI : 10.1007/978-3-642-02026-1_9
URL : https://hal.archives-ouvertes.fr/hal-00575959

A. Beletska, W. Bielecki, K. Siedlecki, S. Pietro, and P. , Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops, Proc. of ICCSA, pp.871-886, 2008.
DOI : 10.1007/978-3-540-69848-7_69

A. Beletska, W. Bielecki, S. Pietro, and P. , Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework, Sixth International Symposium on Parallel and Distributed Computing (ISPDC'07), p.29, 2007.
DOI : 10.1109/ISPDC.2007.21

A. Beletska, S. Pietro, and P. , Extracting Coarse-Grained Parallelism with the Affine Transformation Framework and its Limitations. Electronic Modelling, 2006.

W. Bielecki, A. Beletska, S. Pietro, and P. , Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations, Proc. of ICA3PP, pp.185-195, 2008.
DOI : 10.1007/978-3-540-69501-1_20

W. Bielecki, T. Klimek, and K. Trifunovic, Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation, Electronic Notes in Discrete Mathematics, vol.33, pp.7-14, 2009.
DOI : 10.1016/j.endm.2009.03.002

B. Boigelot and P. Wolper, Symbolic verification with periodic sets, Proc. of the 6th conference on Computer-Aided Verification, pp.55-76, 1994.
DOI : 10.1007/3-540-58179-0_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.6568

P. Boulet, A. Darte, G. A. Silber, and F. Vivien, Loop parallelization algorithms: From parallelism extraction to code generation, Parallel Computing, vol.24, issue.3-4, pp.421-444, 1998.
DOI : 10.1016/S0167-8191(98)00020-9
URL : https://hal.archives-ouvertes.fr/inria-00565000

H. Comon and Y. Jurski, Multiple counters automata, safety analysis and presburger arithmetic, Proc. Computer Aided Verification, pp.268-279, 1998.
DOI : 10.1007/BFb0028751
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.6334

R. A. Van-engelen, Efficient Symbolic Analysis for Optimizing Compilers, Proc of the Intl. Conf. on Compiler Construction (ETAPS CC'01), pp.118-132, 2001.
DOI : 10.1007/3-540-45306-7_9

P. Feautrier, Some efficient solutions to the affine scheduling problem. I. One-dimensional time, International Journal of Parallel Programming, vol.40, issue.6, pp.313-348, 1992.
DOI : 10.1007/BF01407835

P. Feautrier, Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time, International Journal of Parallel Programming, vol.2, issue.4, pp.389-420, 1992.
DOI : 10.1007/BF01379404

P. Feautrier and P. Boulet, Scanning polyhedra without DO-loops, Parallel Architectures and Compilation Techniques (PACT'98, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00564990

T. A. Henzinger, The theory of hybrid automata, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1996.
DOI : 10.1109/LICS.1996.561342

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

W. Kelly, Optimization within a Unified Transformation Framework, 1996.

W. Kelly, W. Pugh, E. Rosser, and T. Shpeisman, Transitive Closure of Infinite Graphs and Its Applications, International Journal of Parallel Programming, vol.36, issue.12, pp.579-598, 1996.
DOI : 10.1007/BF03356760

W. Kelly, W. Pugh, and E. Rosser, Code generation for multiple mappings. Frontiers'95 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

A. W. Lim and M. Lam, Maximizing parallelism and minimizing synchronization with affine transforms, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.201-214, 1997.
DOI : 10.1145/263699.263719
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.6838

D. Pean, H. Chua, and C. Chen, A Release Combined Scheduling Scheme for Non-Uniform Dependence Loops, J. Inf. Sci. Eng. (JISE), vol.18, issue.2, pp.223-255, 2002.

S. R. Prakash and Y. N. Srikant, Hyperplane partitioning: an approach to global data partitioning for distributed memory machines, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999, p.744, 1999.
DOI : 10.1109/IPPS.1999.760559

W. Pugh and D. Wonnacott, An exact method for analysis of value-based array data dependences, 1993.
DOI : 10.1007/3-540-57659-2_31

W. Pugh and E. Rosser, Iteration space slicing and its application to communication optimization, Proceedings of the 11th international conference on Supercomputing , ICS '97, pp.221-228, 1997.
DOI : 10.1145/263580.263637

F. Quillere, S. Rajopadhye, and D. Wilde, Generation of efficient nested loops from polyhedra, Intl, Journal of Parallel Programming, vol.28, 2000.

Z. Shen, Z. Li, and P. Yew, An empirical study of Fortran programs for parallelizing compilers, IEEE Transactions on Parallel and Distributed Systems, vol.1, issue.3, pp.356-364, 1990.
DOI : 10.1109/71.80162

N. Vasilache, C. Bastoul, and A. Cohen, Polyhedral Code Generation in the Real World, Proc. of the Intl. Conf. on Compiler Construction (ETAPS CC'06), pp.185-201, 2006.
DOI : 10.1007/11688839_16
URL : https://hal.archives-ouvertes.fr/inria-00001106

M. J. Wolfe, Beyond induction variables, Symp. on Programming Languages and Implementation (PLDI'92), pp.162-174, 1992.
DOI : 10.1145/143103.143131
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.1292

Y. Yu and E. H. D-'hollander, Non-Uniform Dependences Partitioned by Recurrence Chains, Proc. the 2004 International Conference on Parallel Processing, pp.100-107, 2004.