K. Yelick, L. Semenzato, G. Pike, C. Miyamoto, B. Liblit et al., Titanium: a high-performance Java dialect, Concurrency: Practice and Experience, vol.10, issue.11-13, pp.11-13, 1998.
DOI : 10.1002/(SICI)1096-9128(199809/11)10:11/13<825::AID-CPE383>3.0.CO;2-H

B. Chamberlain, D. Callahan, and H. Zima, Parallel Programmability and the Chapel Language, International Journal of High Performance Computing Applications, vol.21, issue.3, pp.291-312, 2007.
DOI : 10.1177/1094342007078442

R. W. Numrich and J. Reid, Co-array Fortran for parallel programming, ACM SIGPLAN Fortran Forum, vol.17, issue.2, pp.1-31, 1998.
DOI : 10.1145/289918.289920

U. Consortium, UPC language specifications, Lawrence Berkeley National Lab Tech Report LBNL?, vol.59208, 2005.

V. Cavé, J. Zhao, J. Shirako, and V. Sarkar, Habanero-Java, Proceedings of the 9th International Conference on Principles and Practice of Programming in Java, PPPJ '11, pp.51-61, 2011.
DOI : 10.1145/2093157.2093165

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

T. Yuki, P. Feautrier, S. Rajopadhye, and V. Saraswat, Array dataflow analysis for polyhedral X10 programs, In: PPoPP, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00761537

S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, and M. Bruynooghe, Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions, Algorithmica, vol.48, issue.1, 2007.
DOI : 10.1007/s00453-006-1231-0

J. Lee, D. A. Padua, and S. P. Midkiff, Basic compiler algorithms for parallel programs, PPoPP '99, pp.1-12, 1999.

P. Clauss, Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs, ICS '96, pp.278-285, 1996.
DOI : 10.1145/2591635.2667172

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

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. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, Proc. third SIGPLAN Symp. on Principles and Practice of Parallel Programming, pp.39-50, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00752774

A. Aiken and D. Gay, Barrier inference, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '98, pp.342-354, 1998.
DOI : 10.1145/268946.268974

A. Kamil and K. Yelick, Concurrency Analysis for Parallel Programs with Textually Aligned Barriers, In: LCPC, 2005.
DOI : 10.1007/978-3-540-69330-7_13

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

A. Darte and R. Schreiber, A linear-time algorithm for optimal barrier placement, Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming , PPoPP '05, pp.26-35, 2005.
DOI : 10.1145/1065944.1065949

N. Vasudevan, O. Tardieu, J. Dolby, and S. A. Edwards, Compile-Time Analysis and Specialization of Clocks in Concurrent Programs, Compiler Construction. CC '09, pp.48-62, 2009.
DOI : 10.1007/978-3-642-00722-4_5

C. W. Tseng, Compiler optimizations for eliminating barrier synchronization, PPoPP '95, pp.144-155, 1995.

D. A. Padua and Y. Paek, Compiling for scalable multiprocessors with Polaris, Parallel Processing Letters, vol.07, issue.04, pp.425-436, 1997.

J. Zhao, J. Shirako, V. K. Nandivada, and V. Sarkar, Reducing task creation and termination overhead in explicitly parallel programs, Proceedings of the 19th international conference on Parallel architectures and compilation techniques, PACT '10, pp.169-180, 2010.
DOI : 10.1145/1854273.1854298