K. Faxén and K. Popov, Embla-data dependence profiling for parallel programming, Complex, Intelligent and Software Intensive Systems, pp.780-785, 2008.

P. Feautrier, Parametric integer programming, RAIROOperations Research, vol.22, pp.243-268, 1988.

P. Feautrier and C. Lengauer, Polyhedron model, Encyclopedia of Parallel Computing, pp.1581-1592, 2011.

N. Sylvain-girbal, C. Vasilache, A. Bastoul, D. Cohen, M. Parello et al., Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies, Intl. J. of Parallel Programming, vol.34, issue.3, 2006.

L. Susan, . Graham, B. Peter, M. K. Kessler, and . Mckusick, Gprof: A call graph execution profiler, ACM Sigplan Notices, vol.17, pp.120-126, 1982.

B. Gregg, The flame graph, Commun. ACM, vol.59, pp.48-57, 2016.

A. Griffith, GCC: the complete reference, 2002.

T. Grosser, A. Groesslinger, and C. Lengauer, Polly -Performing polyhedral optimizations on a low-level intermediate representation, Parallel Processing Letters, vol.22, p.4, 2012.

F. Gruber, M. Selva, D. Sampaio, C. Guillon, L. Pouchet et al., Building of a Polyhedral Representation from an Instrumented Execution: Making Dynamic Analyses of non-Affine Programs Scalable, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01967828

C. Guillon, Program Instrumentation with QEMU, Proceedings of the International QEMU User's Forum, 2011.

P. Havlak, Nesting of Reducible and Irreducible Loops, ACM Trans. Program. Lang. Syst, vol.19, issue.4, 1997.

L. John and . Henning, SPEC CPU2006 Benchmark Descriptions, SIGARCH Comput. Archit. News, vol.34, pp.1-17, 2006.

J. Holewinski, R. Ramamurthi, and M. Ravishankar, Dynamic trace-based analysis of vectorization potential of applications, ACM SIGPLAN Notices, vol.47, pp.371-382, 2012.

A. Jimborean, L. Mastrangelo, V. Loechner, and P. Clauss, VMAD: An Advanced Dynamic Program Analysis and Instrumentation Framework, 2012.

W. Kelly and W. Pugh, A unifying framework for iteration reordering transformations, Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing, 1995.

A. Ketterlin and P. Clauss, Prediction and Trace Compression of Data Access Addresses Through Nested Loop Recognition, Proceedings of the 6th Annual IEEE/ACM International Symposium on Code Generation and Optimization (CGO '08), 2008.
URL : https://hal.archives-ouvertes.fr/inria-00504597

A. Ketterlin and P. Clauss, Profiling Data-Dependence to Assist Parallelization: Framework, Scope, and Optimization, p.45, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00780782

, Annual IEEE/ACM International Symposium on Microarchitecture, pp.437-448

M. Kim, H. Kim, and C. Luk, Prospector: A dynamic data-dependence profiler to help parallel programming, HotPar'10: Proceedings of the USENIX workshop on Hot Topics in parallelism, 2010.

M. Kim, B. Nagesh, H. Lakshminarayana, C. Kim, and . Luk, SD3: An Efficient Dynamic Data-Dependence Profiling Mechanism, IEEE Trans. Comput, vol.62, pp.2516-2530, 2013.

Y. Sato, Y. Inoguchi, and T. Nakamura, On-thefly Detection of Precise Loop Nests Across Procedures on a Dynamic Binary Translation System, Proceedings of the 8th ACM International Conference on Computing Frontiers (CF '11), 2011.

M. Schordan, P. Lin, D. Quinlan, and L. Pouchet, Verification of polyhedral optimizations with constant loop bounds in finite state space computations, International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, pp.493-508, 2014.

K. Serebryany, D. Bruening, A. Potapenko, and D. Vyukov, AddressSanitizer: A Fast Address Sanity Checker, USENIX Annual Technical Conference, pp.309-318, 2012.