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

A. W. Appel and J. Palsberg, Modern Compiler Implementation in Java, 2002.
DOI : 10.1017/CBO9780511811432

V. C. Sreedhar, R. D. Ju, D. M. Gillies, and V. Santhanam, Translating Out of Static Single Assignment Form, Static Analysis Symposium (SAS'99), Italy, pp.194-204, 1999.
DOI : 10.1007/3-540-48294-6_13

A. Adl-tabatabai, M. Cierniak, G. Lueh, V. M. Parikh, and J. M. Stichnoth, Fast, effective code generation in a just-in-time java compiler, International Conference on Programming Language Design and Implementation (PLDI'98, pp.280-290, 1998.

M. Poletto and V. Sarkar, Linear scan register allocation, ACM Transactions on Programming Languages and Systems, vol.21, issue.5, pp.895-913, 1999.
DOI : 10.1145/330249.330250
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.2462

O. Traub, G. Holloway, and M. D. Smith, Quality and speed in linearscan register allocation, Int. Conf. on Programming Language Design and Implementation (PLDI'98, pp.142-151, 1998.

C. Wimmer and H. Mössenböck, Optimized interval splitting in a linear scan register allocator, Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments , VEE '05, pp.132-141, 2005.
DOI : 10.1145/1064979.1064998

V. Sarkar and R. Barik, Extended Linear Scan: An Alternate Foundation for Global Register Allocation, International Conference on Compiler Construction (CC'07), ser. LNCS, pp.141-155, 2007.
DOI : 10.1007/978-3-540-71229-9_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4590

B. Dupont-de-dinechin, Inter-block Scoreboard Scheduling in a JIT Compiler for VLIW Processors, Euro-Par 2008 -Parallel Processing, 14th International Euro-Par Conference, ser, pp.370-381, 2008.
DOI : 10.1007/978-3-540-85451-7_40

J. Cavazos and J. E. Moss, Inducing heuristics to decide whether to schedule, International Conference on Programming Language Design and Implementation (PLDI'04, pp.183-194, 2004.
DOI : 10.1145/996841.996864
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.8122

V. Tang, J. Siu, A. Vasilevskiy, and M. Mitran, A framework for reducing instruction scheduling overhead in dynamic compilers, Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research , CASCON '06, p.5, 2006.
DOI : 10.1145/1188966.1188973

P. Briggs, K. D. Cooper, T. J. Harvey, and L. T. Simpson, Practical improvements to the construction and destruction of static single assignment form, Software ? Practice and Experience, pp.859-881, 1998.
DOI : 10.1002/(SICI)1097-024X(19980710)28:8<859::AID-SPE188>3.0.CO;2-8

V. C. Sreedhar and G. R. Gao, A linear time algorithm for placing ??-nodes, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '95, pp.62-73, 1995.
DOI : 10.1145/199448.199464

A. Gal, C. W. Probst, and M. Franz, Structural Encoding of Static Single Assignment Form, Electronic Notes in Theoretical Computer Science, vol.141, issue.2, pp.85-102, 2005.
DOI : 10.1016/j.entcs.2005.02.045

Z. Budimli´cbudimli´c, K. D. Cooper, T. J. Harvey, K. Kennedy, T. S. Oberg et al., Fast copy coalescing and live-range identification, International Conference on Programming Language Design and Implementation (PLDI'02, pp.25-32, 2002.

B. Boissinot, S. Hack, D. Grund, B. D. De-dinechin, and F. Rastello, Fast liveness checking for ssa-form programs, Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization , CGO '08, pp.35-44, 2008.
DOI : 10.1145/1356058.1356064
URL : https://hal.archives-ouvertes.fr/inria-00192219

G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins et al., Register allocation via coloring, Computer Languages, vol.6, issue.1, pp.47-57, 1981.
DOI : 10.1016/0096-0551(81)90048-5

A. Leung, L. George, and C. Guillon, Static single assignment form for machine code Optimizing translation out of SSA using renaming constraints, International Conference on Programming Language Design and Implementation (PLDI'99 International Symposium on Code Generation and Optimization, pp.204-214, 1999.

F. Bouchez, A. Darte, and F. Rastello, On the Complexity of Register Coalescing, International Symposium on Code Generation and Optimization (CGO'07), pp.102-114, 2007.
DOI : 10.1109/CGO.2007.26

L. George and A. W. Appel, Iterated register coalescing, ACM Transactions on Programming Languages and Systems, vol.18, issue.3, 1996.
DOI : 10.1145/229542.229546
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4803

M. D. Smith, G. Ramsey, and . Holloway, A generalized algorithm for graph-coloring register allocation, International Conference on Programming Language Design and Implementation (PLDI'04, pp.277-288, 2004.

G. J. Chaitin, Register allocation & spilling via graph coloring, SIGPLAN Symp. on Compiler Construction (CC'82), pp.98-101, 1982.
DOI : 10.1145/800230.806984

B. Alpern, M. N. Wegman, and F. K. Zadeck, Detecting equality of variables in programs, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.1-11, 1988.
DOI : 10.1145/73560.73561

F. Bouchez, A. Darte, C. Guillon, and F. Rastello, Register allocation and spill complexity under SSA, pp.2005-2038, 2005.

B. Dupont-de-dinechin, F. De-ferrière, C. Guillon, and A. Stoutchinin, Code generator optimizations for the ST120 DSP-MCU core, Proceedings of the international conference on Compilers, architectures, and synthesis for embedded systems , CASES '00, pp.93-103, 2000.
DOI : 10.1145/354880.354894

P. Briggs, K. D. Cooper, and L. Torczon, Improvements to graph coloring register allocation, Software ? Practice and Experience, pp.428-455, 1994.
DOI : 10.1145/177492.177575

C. May, The parallel assignment problem redefined, IEEE Transactions on Software Engineering, vol.15, issue.6, pp.821-824, 1989.
DOI : 10.1109/32.24735