C. Alias, F. Baray, and A. Darte, Bee+Cl@k: An implementation of latticebased array contraction in the source-to-source translator Rose, egw gonfF on v—nE gu—gesD gompilersD —nd „ools for im˜edded ƒystems @vg„iƒ9HUA, 2007.

C. Alias, A. Darte, and A. Plesco, Optimizing remote accesses for ofoaded kernels: Application to high-level synthesis for fpga, egw ƒsqhe sntlF gonferE en™e on hesignD eutom—tion —nd „est in iurope @he„iA, 2013.

C. Alias, B. Pasca, and A. Plesco, Fpga-specic synthesis of loopnests with pipelined computational cores. wi™ropro™essors —nd wi™rosystems E im˜edded r—rdw—re hesign, p.606619, 2012.

C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, €ro™eedings of the „hird egw ƒsq€vex ƒymposium on €rin™iples 8 €r—™ti™e of €—r—llel €rogr—mming @€€y€€AD ‡illi—ms˜urgD †irgini—D …ƒeD epril PIEPRD IWWI, p.3950, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00752774

C. Bastoul, Ecient code generation for automatic parallelization and optimization, Pnd sntern—tion—l ƒymposium on €—r—llel —nd histri˜uted gomputing @sƒ€hg PHHQAD IQEIR y™to˜er PHHQD vju˜lj—n—D ƒloveni—, p.2330, 2003.

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A practical automatic polyhedral parallelizer and locality optimizer, €ro™eedings of the egw ƒsq€vex PHHV gonferen™e on €rogr—mming v—ngu—ge hesign —nd smplement—tionD „u™sonD eD …ƒeD tune UEIQD PHHV, p.101113, 2008.

P. Boulet and P. Feautrier, Scanning polyhedra without Do-loops, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192), p.49, 1998.
DOI : 10.1109/PACT.1998.727127

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

P. Clauss, Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientic programs, €ro™eedings of the IHth intern—tion—l ™onferen™e on ƒuper™omputingD sgƒ IWWTD €hil—delphi—D €eD …ƒeD w—y PSEPVD IWWT, p.278285, 1996.

B. Florent-de-dinechin and . Pasca, Designing custom arithmetic data paths with FloPoCo. siii hesign 8 „est of gomputers, p.1827, 2011.

P. Feautrier, Dataow analysis of array and scalar references. sntern—tion—l tourn—l of €—r—llel €rogr—mming, p.2353, 1991.

P. Feautrier and C. Lengauer, Polyhedron model, in™y™lopedi— of €—r—llel gomputing, p.15811592, 2011.

M. Lam, Software pipelining: An eective scheduling technique for vliw machines, €ro™eedings of the egw ƒsq€vex IWVV gonferen™e on €rogr—mming v—ngu—ge hesign —nd smplement—tion, PLDI '88, p.318328, 1988.

L. Pouchet, Polybench: The polyhedral benchmark suite. …‚vX httpXGGwwwF ™sF u™l—F eduG£ pou™hetGsoftw—reGpoly˜en™hG‘™ited tulyD“, 2012.

P. Quinton, Automatic synthesis of systolic arrays from uniform recurrent equations

M. Stephenson, J. Babb, and S. Amarasinghe, Bidwidth analysis with application to silicon compilation, egw ƒsq€vex xoti™es, p.108120, 2000.

T. Yuki, A. Morvan, and S. Derrien, Derivation of ecient FSM from loop nests, PHIQ sntern—tion—l gonferen™e on pieldE€rogr—mm—˜le „e™hnologyD p€„ PHIQD uyotoD t—p—nD he™em˜er WEIID PHIQ, p.286293, 2013.

W. Zuo, P. Li, D. Chen, L. Pouchet, S. Zhong et al., Improving polyhedral code generation for high-level synthesis, 2013 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS), 2013.
DOI : 10.1109/CODES-ISSS.2013.6659002