. Ch, Other applications S1: S2: Value range analysis: Might intersect GCD test: Might intersect S1: S2: S1: S2: Value range analysis: Do not intersect S1, S2: S1: S2: GCD test: Do not intersect S1, p.2

A. Adl-tabatabai, B. T. Lewis, V. Menon, B. R. Murphy, B. Saha et al., Compiler and runtime support for efficient software transactional memory, Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation, PLDI '06, pp.26-37, 2006.

R. Allen and K. Kennedy, Automatic translation of FORTRAN programs to vector form, ACM Transactions on Programming Languages and Systems, vol.9, issue.4, pp.491-542, 1987.
DOI : 10.1145/29873.29875

J. Ansel, C. Chan, Y. L. Wong, M. Olszewski, Q. Zhao et al., Petabricks: a language and compiler for algorithmic choice, PLDI '09, pp.38-49, 2009.

M. Arnold and B. G. Ryder, A framework for reducing the cost of instrumented code, Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, PLDI '01, pp.168-179, 2001.

V. Aslot, M. J. Domeika, R. Eigenmann, G. Gaertner, W. B. Jones et al., SPEComp: A New Benchmark Suite for Measuring Parallel Computer Performance, WOMPAT '01, pp.1-10, 2001.
DOI : 10.1007/3-540-44587-0_1

. Moshemaury, M. Bach, R. Charney, E. Cohn, T. Demikhovsky et al., Analyzing parallel programs with pin, Computer, vol.43, issue.3, pp.34-41, 2010.

V. Bala, E. Duesterwald, and S. Banerjia, Dynamo: a transparent dynamic optimization system, Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, PLDI '00, pp.1-12, 2000.

K. Utpal and . Banerjee, Loop Transformations for Restructuring Compilers: The Foundations, 1993.

C. Bastoul, Generating loops for scanning polyhedra, 2002.

C. Bastoul, A. Cohen, S. Girbal, S. Sharma, and O. Temam, Putting Polyhedral Loop Transformations to Work, LCPC'16 Intl. Workshop on Languages and Compilers for Parallel Computers, pp.209-225, 2003.
DOI : 10.1007/978-3-540-24644-2_14
URL : https://hal.archives-ouvertes.fr/inria-00071681

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

L. S. Blackford, J. Demmel, J. Dongarra, I. Duff, S. Hammarling et al., An updated set of basic linear algebra subprograms (BLAS), ACM Transactions on Mathematical Software, vol.28, issue.2, pp.135-151, 2001.
DOI : 10.1145/567806.567807

B. Blume, R. Eigenmann, K. Faigin, J. Grout, J. Hoeflinger et al., Polaris: The next generation in parallelizing compilers, Workshop on Languages and Compilers for Parallel Computing, pp.10-11

U. Bondhugula, M. Baskaran, S. Krishnamoorthy, J. Ramanujam, A. Rountev et al., Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model, Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction, CC'08/ETAPS'08, pp.132-146, 2008.
DOI : 10.1007/978-3-540-78791-4_9

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A practical automatic polyhedral parallelizer and locality optimizer, Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, PLDI, 2008.

U. Kumar and R. Bondhugula, Effective automatic parallelization and locality optimization using the polyhedral model, p.3325799, 2008.

G. Brooks, G. J. Hansen, and S. Simmons, A new approach to debugging optimized code, ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI, 1992.

D. Bruening, T. Garnett, and S. Amarasinghe, An infrastructure for adaptive dynamic optimization, International Symposium on Code Generation and Optimization, 2003. CGO 2003., 2003.
DOI : 10.1109/CGO.2003.1191551

D. Bruening, S. Devabhaktuni, and S. Amarasinghe, Softspec: Software-based speculative parallelism, ACM Workshop on Feedback-Directed and Dynamic Optimization, 2000.

M. Brukman, B. Jones, N. Begeman, and C. Lattner, Extending LLVM: Adding instructions, intrinsics, types, etc

B. Buck and J. K. Hollingsworth, An API for Runtime Code Patching, International Journal of High Performance Computing Applications, vol.14, issue.4, 2000.
DOI : 10.1177/109434200001400404

C. Cascaval, C. Blundell, M. Michael, H. W. Cain, P. Wu et al., Software transactional memory, Communications of the ACM, vol.51, issue.11, pp.46-58, 2008.
DOI : 10.1145/1400214.1400228

J. Cavazos and M. F. O-'boyle, Method-specific dynamic compilation using logistic regression, ACM SIGPLAN Notices, vol.41, issue.10, pp.229-240, 2006.
DOI : 10.1145/1167515.1167492

S. Che, M. Boyer, J. Meng, D. Tarjan, J. W. Sheaffer et al., Rodinia: A benchmark suite for heterogeneous computing, 2009 IEEE International Symposium on Workload Characterization (IISWC), pp.44-54, 2009.
DOI : 10.1109/IISWC.2009.5306797

J. Ding-kai-chen, P. C. Torrellas, and . Yew, An efficient algorithm for the run-time parallelization of DOACROSS loops, Proceedings of Supercomputing '94, pp.518-527, 1994.
DOI : 10.1109/SUPERC.1994.344315

X. Chen and S. Long, Adaptive Multi-versioning for OpenMP Parallelization via Machine Learning, 2009 15th International Conference on Parallel and Distributed Systems, 2009.
DOI : 10.1109/ICPADS.2009.77

T. Chilimbi and M. Hirzel, Dynamic hot data stream prefetching for generalpurpose programs, ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI, 2002.

M. Cintra and D. R. Llanos, Toward efficient and robust software speculative parallelization on multiprocessors, Proceedings of the ninth ACM SIG- PLAN symposium on Principles and practice of parallel programming, PPoPP '03, pp.13-24, 2003.

P. Clauss, Counting solutions to linear and nonlinear constraints through ehrhart polynomials: applications to analyze and transform scientific programs, Proceedings of the 10th international conference on Supercomputing, ICS '96, pp.278-285, 1996.
URL : https://hal.archives-ouvertes.fr/hal-01100306

A. Cohen, S. Girbal, and O. Temam, A Polyhedral Approach to Ease the Composition of Program Transformations, Euro-Par'04, no. 3149 in LNCS, pp.292-303, 2004.
DOI : 10.1007/978-3-540-27866-5_38
URL : https://hal.archives-ouvertes.fr/hal-01257301

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems, vol.13, issue.4, pp.451-490, 1991.
DOI : 10.1145/115372.115320

F. H. Dang, H. Yu, and L. Rauchwerger, The R-LRPD test: speculative parallelization of partially parallel loops, Proceedings 16th International Parallel and Distributed Processing Symposium, p.318, 2002.
DOI : 10.1109/IPDPS.2002.1015493

A. Darte, Y. Robert, and F. Vivien, Scheduling and Automatic Parallelization, 2000.
DOI : 10.1007/978-1-4612-1362-8
URL : https://hal.archives-ouvertes.fr/hal-00856645

L. Daverio, C. Ancourt, F. Coelho, S. Even, S. Guelton et al., PIPS ? An Interprocedural, Extensible, Source-to-Source Compiler Infrastructure for Code Transformations and Instrumentations, Tutorial at PPoPP Tutorial at CGO, 2010.

Z. Du, C. Lim, X. Li, and C. Yang, Qingyu Zhao, and Tin- Fook Ngai. A cost-driven compilation framework for speculative parallelization of sequential programs, Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, PLDI '04, pp.71-81, 2004.

B. Dufour, G. Barbara, G. Ryder, and . Sevitsky, Blended analysis for performance understanding of framework-based applications, Proceedings of the 2007 international symposium on Software testing and analysis, ISSTA '07, 2007.
DOI : 10.1145/1273463.1273480

A. Edwards, A. Srivastava, and H. Vo, Vulcan binary transformation in a distributed environment, 2001.

P. Feautrier, Parametric integer programming, RAIRO - Operations Research, vol.22, issue.3, pp.243-268, 1988.
DOI : 10.1051/ro/1988220302431
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9957

P. Feautrier, Dataflow analysis of array and scalar references, International Journal of Parallel Programming, vol.24, issue.4, pp.23-53, 1991.
DOI : 10.1007/BF01407931

P. Feautrier, Array expansion, In In ACM Int. Conf. on Supercomputing, pp.429-441, 1988.
DOI : 10.1145/2591635.2667159
URL : https://hal.archives-ouvertes.fr/hal-01099746

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, 1992.
DOI : 10.1007/BF01379404

P. Feautrier, Automatic parallelization in the polytope model Université de Versailles St-Quentin en Yvelines, 45, avenue des États- Unis, F-78035 Versailles Cedex, Laboratoire PRiSM, pp.79-103, 1996.

E. Jay-feigin, A case for automatic run-time code optimization, 1999.

M. Feng, R. Gupta, and Y. Hu, Spicec: scalable parallelism via implicit copying and explicit commit, Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, pp.69-80, 2011.

G. Fursin, A. Cohen, M. O. Boyle, and O. Temam, A Practical Method for Quickly Evaluating Program Optimizations, Proceedings of the International Conference on High Performance Embedded Architectures and Compilers, pp.29-46, 2005.
DOI : 10.1007/11587514_4
URL : https://hal.archives-ouvertes.fr/inria-00001054

G. Fursin, C. Miranda, S. Pop, A. Cohen, and O. Temam, Practical Run-time Adaptation with Procedure Cloning to Enable Continuous Collective Compilation, GCC Developers' Summit, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01257279

G. Fursin and O. Temam, Collective optimization, ACM Transactions on Architecture and Code Optimization, vol.7, issue.4, 2010.
DOI : 10.1145/1880043.1880047
URL : https://hal.archives-ouvertes.fr/inria-00445326

X. Gao, M. Laurenzano, B. Simon, and A. Snavely, Reducing overheads for acquiring dynamic memory traces, Workload Characterization Symposium, 2005.

T. Grosser, H. Zheng, A. Raghesh, and A. Simbürger, Armin Grösslinger, and Louis-Noël Pouchet. Polly -polyhedral optimization in llvm, First International Workshop on Polyhedral Compilation Techniques (IM- PACT'11), 2011.

M. Hauswirth and T. M. Chilimbi, Low-overhead memory leak detection using adaptive statistical profiling, 11th Int. Conf. on Architectural support for programming languages and operating systems, ASPLOS-XI, 2004.

M. Herrmann, Machine virtuelle d'analyse et d'optimisation dynamique de programmes, 2010.

M. Hirzel and T. Chilimbi, Bursty tracing: A framework for lowoverhead temporal profiling, 4th ACM Workshop on FeedbackDirected and Dynamic Optimization FDDO4, 2001.

Y. Huang, L. Peng, C. Wu, Y. Kashnikov, J. Rennecke et al., Transforming GCC into a research-friendly environment: plugins for optimization tuning and reordering, function cloning and program instrumentation, 2nd Int. Workshop on GCC Research Opportunities (GROW'10), 2010.
URL : https://hal.archives-ouvertes.fr/inria-00451106

C. Jaramillo, R. Gupta, and M. L. Soffa, FULLDOC: A Full Reporting Debugger for Optimized Code, 7th International Symposium on Static Analysis, SAS '00, 2000.
DOI : 10.1007/978-3-540-45099-3_13

A. Jimborean, M. Herrmann, V. Loechner, and P. Clauss, VMAD: A virtual machine for advanced dynamic analysis of programs, (IEEE ISPASS) IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE, pp.125-126, 2011.
DOI : 10.1109/ISPASS.2011.5762725
URL : https://hal.archives-ouvertes.fr/inria-00544501

T. A. Johnson, R. Eigenmann, and T. N. Vijaykumar, Speculative thread decomposition through empirical optimization, Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming , PPoPP '07, pp.205-214, 2007.
DOI : 10.1145/1229428.1229474

A. Ketterlin and P. Clauss, Prediction and trace compression of data access addresses through nested loop recognition, Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization , CGO '08, pp.94-103, 2008.
DOI : 10.1145/1356058.1356071
URL : https://hal.archives-ouvertes.fr/inria-00504597

M. Ahmad-khan, H. Charles, and D. Barthou, Improving performance of optimized kernels through fast instantiations of templates, Concurrency and Computation: Practice and Experience, vol.35, issue.5, pp.59-70, 2009.
DOI : 10.1002/cpe.1333

H. Kim, N. P. Johnson, J. W. Lee, S. A. Mahlke, and D. I. August, Automatic speculative DOALL for clusters, Proceedings of the Tenth International Symposium on Code Generation and Optimization, CHO '12, pp.94-103, 2012.
DOI : 10.1145/2259016.2259029

J. Kim, S. Yoo, and C. Kyung, Program phase and runtime distribution-aware online dvfs for combined vdd/vbb scaling, Proceedings of the Conference on Design, Automation and Test in Europe, DATE '09 European Design and Automation Association, pp.417-422, 2009.

M. Kim, H. Kim, and C. Luk, SD3: A Scalable Approach to Dynamic Data-Dependence Profiling, 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture, pp.535-546, 2010.
DOI : 10.1109/MICRO.2010.49

T. Kotzmann, C. Wimmer, H. Mössenböck, T. Rodriguez, K. Russell et al., Design of the java hotspot client compiler for java 6, ACM Trans. Archit. Code Optim, vol.5, 2008.

M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala et al., Optimistic parallelism requires abstractions, Communications of the ACM, vol.52, issue.9, pp.89-97, 2009.
DOI : 10.1145/1562164.1562188

N. Kumar, B. Childers, and M. L. Soffa, Transparent Debugging of Dynamically Optimized Code, 2009 International Symposium on Code Generation and Optimization, 2009.
DOI : 10.1109/CGO.2009.28

J. R. Larus, Loop-level parallelism in numeric and symbolic programs, IEEE Transactions on Parallel and Distributed Systems, vol.4, issue.7, pp.812-826, 1993.
DOI : 10.1109/71.238302

C. Lattner and V. Adve, LLVM language reference manual

M. Laurenzano, M. Tikir, L. Carrington, and A. Snavely, PEBIL: Efficient static binary instrumentation for Linux, 2010 IEEE International Symposium on Performance Analysis of Systems & Software (ISPASS), 2010.
DOI : 10.1109/ISPASS.2010.5452024

X. Li, C. Yang, Z. Du, and T. Ngai, Exploiting threadlevel speculative parallelism with software value prediction, Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture, ACSAC'05, pp.367-388, 2005.

W. Liu, J. Tuck, L. Ceze, W. Ahn, K. Strauss et al., POSH, Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming , PPoPP '06, pp.158-167, 2006.
DOI : 10.1145/1122971.1122997

C. Luk, R. Cohn, R. Muth, H. Patil, A. Klauser et al., Pin: building customized program analysis tools with dynamic instrumentation, Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, PLDI '05, pp.190-200, 2005.

L. Luo, Y. Chen, C. Wu, S. Long, and G. Fursin, Finding representative sets of optimizations for adaptive multiversioning applications, International Workshop on Statistical and Machine learning approaches to ARchitectures and compilaTion, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00436034

Y. Luo, V. Packirisamy, W. Hsu, and A. Zhai, Dynamic performance tuning for speculative threads, ACM SIGARCH Computer Architecture News, vol.37, issue.3, pp.462-473, 2009.
DOI : 10.1145/1555815.1555812

J. Mak and A. Mycroft, Limits of parallelism using dynamic dependency graphs, Proceedings of the Seventh International Workshop on Dynamic Analysis, WODA '09, pp.42-48, 2009.
DOI : 10.1145/2134243.2134253

D. Marino, M. Musuvathi, and S. Narayanasamy, Literace: effective sampling for lightweight data-race detection, ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI, 2009.

J. Mars and R. Hundt, Scenario Based Optimization: A Framework for Statically Enabling Online Optimizations, 2009 International Symposium on Code Generation and Optimization, pp.169-179, 2009.
DOI : 10.1109/CGO.2009.24

M. Mehrara, J. Hao, P. Hsu, and S. Mahlke, Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory, ACM SIGPLAN Notices, vol.44, issue.6, pp.166-176, 2009.
DOI : 10.1145/1543135.1542495

M. Philippsen, N. Tillmann, and D. Brinkers, Double Inspection for Run-Time Loop Parallelization, Proceedings of the 24th International Workshop on Languages and Compilers for Parallel Computing, 2011.
DOI : 10.1007/978-3-642-36036-7_4

N. Nethercote and J. Seward, Valgrind: A framework for heavyweight dynamic binary instrumentation, PLDI '07: Proc. of ACM SIGPLAN Conf. on Programming Language Design and Implementation, 2007.

F. Noël, L. Hornof, C. Consel, and J. L. Lawall, Automatic, template-based run-time specialization: implementation and experimental study, Proceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225), pp.132-142, 1998.
DOI : 10.1109/ICCL.1998.674164

E. Cosmin, A. Oancea, and . Mycroft, Languages and compilers for parallel computing, LCPC, chapter Set-Congruence Dynamic Analysis for Thread-Level Speculation (TLS), pp.156-171, 2008.

E. Cosmin, A. Oancea, T. Mycroft, and . Harris, A lightweight in-place implementation for software thread-level speculation, Proceedings of the twentyfirst annual symposium on Parallelism in algorithms and architectures, SPAA '09, pp.223-232, 2009.

. Ompscr, OpenMP source code repository

E. Park, S. Kulkarni, and J. Cavazos, An evaluation of different modeling techniques for iterative compilation, Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems, CASES '11, pp.65-74, 2011.
DOI : 10.1145/2038698.2038711

D. Patel and L. Rauchwerger, Implementation Issues of Loop-Level Speculative Run-Time Parallelization, Compiler Construction, pp.1-99, 1999.
DOI : 10.1007/978-3-540-49051-7_13

. Polylib, u-strasbg.fr/PolyLib. [97] Louis-Noël Pouchet. FM: the Fourier-Motzkin library

L. Pouchet, U. Bondhugula, C. Bastoul, A. Cohen, J. Ramanujam et al., Loop transformations: convexity , pruning and optimization, Proceedings of the 38th annual ACM SIGPLAN- SIGACT symposium on Principles of programming languages, pp.549-562, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00551077

K. Manohar, K. Prabhu, and . Olukotun, Using thread-level speculation to simplify manual parallelization, Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming, PPoPP '03, pp.1-12, 2003.

B. Pradelle, Static and dynamic methods of polyhedral compilation for an efficient execution in multicore environments, 2011.
URL : https://hal.archives-ouvertes.fr/tel-00733856

P. Benoit-pradelle, V. Clauss, and . Loechner, Adaptive Runtime Selection of Parallel Schedules in the Polytope Model, High Performance Computing Symposium, 2011.

C. García-quiñones, C. Madriles, J. Sánchez, P. Marcuello, A. González et al., Mitosis compiler: an infrastructure for speculative threading based on pre-computation slices, Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation , PLDI '05, pp.269-279, 2005.

A. Raman, H. Kim, T. R. Mason, T. B. Jablin, and D. I. August, Speculative parallelization using software multi-threaded transactions, Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems, ASPLOS '10, pp.65-76, 2010.

E. Raman, N. Va-hharajani, R. Rangan, and D. I. August, Spice, Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization , CGO '08, pp.175-184, 2008.
DOI : 10.1145/1356058.1356082

L. Rauchwerger and D. Padua, The LRPD test: speculative runtime parallelization of loops with privatization and reduction parallelization, Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, PLDI '95, pp.218-232, 1995.

G. Rudy, M. M. Khan, M. Hall, C. Chen, and J. Chame, A Programming Language Interface to Describe Transformations and Code Generation, Proceedings of the 23rd international conference on Languages and compilers for parallel computing, pp.136-150, 2011.
DOI : 10.1145/1809028.1806606

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

T. Sherwood, E. Perelman, G. Hamerly, S. Sair, and B. Calder, Discovering and exploiting program phases, IEEE Micro, vol.23, issue.6, pp.84-93, 2003.
DOI : 10.1109/MM.2003.1261391
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.4012

F. Smith, D. Grossman, G. Morrisett, L. Hornof, and T. Jim, Compiling for template-based run-time code generation, Journal of Functional Programming, vol.13, issue.3, pp.677-708, 2003.
DOI : 10.1017/S095679680200463X

V. Spiliopoulos, S. Kaxiras, and G. Keramidas, Green governors: A framework for Continuously Adaptive DVFS, 2011 International Green Computing Conference and Workshops, pp.1-8, 2011.
DOI : 10.1109/IGCC.2011.6008552

J. , G. Steffan, C. B. Colohan, A. Zhai, and T. C. Mowry, A scalable approach to thread-level speculation, Proceedings of the 27th annual international symposium on Computer architecture, ISCA '00, pp.1-12, 2000.

M. Süsskraut, S. Weigert, U. Schiffel, T. Knauth, M. Nowack et al., Speculation for parallelizing runtime checks, Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS '09, pp.698-710, 2009.

N. Thomas, G. Tanase, O. Tkachyshyn, J. Perdue, N. M. Amato et al., A framework for adaptive algorithm selection in STAPL, Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming , PPoPP '05, pp.277-288, 2005.
DOI : 10.1145/1065944.1065981

C. Tian, M. Feng, and R. Gupta, Speculative parallelization using state separation and multiple value prediction, Proceedings of the 2010 international symposium on Memory management, ISMM '10, pp.63-72, 2010.
DOI : 10.1145/1806651.1806663
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.193.3128

C. Tian, M. Feng, and R. Gupta, Supporting speculative parallelization in the presence of dynamic data structures, Proceedings of the 2010 ACM SIG- PLAN conference on Programming language design and implementation, PLDI '10, pp.62-73, 2010.

C. Tian, M. Feng, V. Nagarajan, and R. Gupta, Copy or discard execution model for speculative parallelization on multicores, Proceedings of the 41st annual IEEE/ACM International Symposium on Microarchitecture, MICRO 41, pp.330-341, 2008.

C. Tian, M. Feng, V. Nagarajan, and R. Gupta, Speculative Parallelization of Sequential Loops on Multicores, International Journal of Parallel Programming, vol.40, issue.5, pp.508-535, 2009.
DOI : 10.1007/s10766-009-0111-z

C. Tian, C. Lin, M. Feng, and R. Gupta, Enhanced speculative parallelization via incremental recovery, Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, pp.189-200, 2011.
DOI : 10.1145/2038037.1941580
URL : http://alumni.cs.ucr.edu/~tianc/publications/ppopp11.pdf

G. Tournavitis, Z. Wang, B. Franke, and M. F. O-'boyle, Towards a holistic approach to auto-parallelization: integrating profile-driven parallelism detection and machine-learning based mapping, Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation , PLDI '09, pp.177-187, 2009.

A. Udupa, K. Rajan, and W. Thies, Alter: exploiting breakable dependences for parallelization, Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation, PLDI '11, pp.480-491, 2011.

A. Van-deursen, P. Klint, and F. Tip, Origin tracking, Journal of Symbolic Computation, vol.15, issue.5-6, 1993.
DOI : 10.1016/S0747-7171(06)80004-0

H. Vandierendonck, S. Rul, and K. De-bosschere, The Paralax infrastructure, Proceedings of the 19th international conference on Parallel architectures and compilation techniques, PACT '10, pp.389-400, 2010.
DOI : 10.1145/1854273.1854322

N. T. Vasilache, Scalable Program Optimization Techniques in the Polyhedral Model, 2007.

S. Verdoolaege, isl: An Integer Set Library for the Polyhedral Model, In Lecture Notes in Computer Science, 2010.
DOI : 10.1007/978-3-642-15582-6_49

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, pp.37-66, 2007.
DOI : 10.1007/s00453-006-1231-0

C. Von-praun, R. Bordawekar, and C. Cascaval, Modeling optimistic concurrency using quantitative dependence analysis, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.185-196, 2008.
DOI : 10.1145/1345206.1345234

J. Michael, R. Voss, and . Eigemann, High-level adaptive program optimization with ADAPT, PPoPP '01, pp.93-102, 2001.

R. P. Weicker and J. L. Henning, Subroutine profiling results for the CPU2006 benchmarks, ACM SIGARCH Computer Architecture News, vol.35, issue.1, 2007.
DOI : 10.1145/1241601.1241621

R. Wilson, R. French, C. Wilson, S. Amarasinghe, J. Anderson et al., The suif compiler system: a parallelizing and optimizing research compiler, 1994.

M. E. Wolf and M. S. Lam, A loop transformation theory and an algorithm to maximize parallelism, IEEE Transactions on Parallel and Distributed Systems, vol.2, issue.4, pp.452-471, 1991.
DOI : 10.1109/71.97902

P. Wu, A. Kejariwal, and C. Ca?caval, Languages and compilers for parallel computing, LCPC, chapter Compiler- Driven Dependence Profiling to Guide Program Parallelization, pp.232-248

J. Yao, H. Shimada, Y. Nakashima, S. Mori, and S. Tomita, Program Phase Detection Based Dynamic Control Mechanisms for Pipeline Stage Unification Adoption, Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems, ISHPC'05/ALPS'06, pp.494-507, 2008.
DOI : 10.1007/978-3-540-77704-5_46

X. Zhang, A. Navabi, and S. Jagannathan, Alchemist: A Transparent Dependence Distance Profiling Infrastructure, 2009 International Symposium on Code Generation and Optimization
DOI : 10.1109/CGO.2009.15

H. Zhong, M. Mehrara, S. A. Lieberman, and S. A. Mahlke, Uncovering hidden loop level parallelism in sequential applications, HPCA, pp.290-301, 2008.

C. Zhu and P. Yew, A scheme to enforce data dependence on large multiprocessor systems, IEEE Trans. Softw. Eng, vol.13, pp.726-739, 1987.

L. Zuck, A. Pnueli, B. Goldberg, C. Barrett, Y. Fang et al., Translation and Run-Time Validation of Loop Transformations, Formal Methods in System Design, vol.9, issue.3, pp.335-360, 2005.
DOI : 10.1007/s10703-005-3402-z

A. Chacp%%pf, A AACADAAAAIAQ)-EPPPPPP88 FGHACPFDAAFGHACPP%