W. Andrew, L. Appel, and . George, Optimal spilling for cisc machines with few registers, Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, pp.243-253, 2000.

M. Bahi and C. Eisenbeis, Rematerialization-based register allocation through reverse computing, Proceedings of the 8th ACM International Conference on Computing Frontiers, CF '11, p.24, 2011.
DOI : 10.1145/2016604.2016632

N. Beldiceanu and S. Demassey, Global constraint catalog, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00485396

S. Bollapragada, O. Ghattas, and J. N. Hooker, Optimal Design of Truss Structures by Logic-Based Branch and Cut, Operations Research, vol.49, issue.1, pp.42-51, 2001.
DOI : 10.1287/opre.49.1.42.11196

F. Bouchez, A. Darte, and F. Rastello, On the complexity of spill everywhere under ssa form, LCTES'07, pp.103-112, 2007.
URL : https://hal.archives-ouvertes.fr/ensl-00180322

P. Briggs, K. D. Cooper, and L. Torczon, Rematerialization, ACM SIGPLAN Notices, vol.27, issue.7, pp.311-321, 1992.
DOI : 10.1145/143103.143143

D. Callahan, S. Carr, and K. Kennedy, Improving register allocation for subscripted variables, Proceedings of the ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, PLDI '90, pp.53-65, 1990.

G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins et al., Register allocation via graph coloring, Journal of Computer Languages, vol.6, pp.45-57, 1981.

D. R. Chase, M. Wegman, and F. K. Zadeck, Analysis of pointers and structures, Proceedings of the ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, PLDI '90, pp.296-310, 1990.

F. Chow and J. Hennessy, Register allocation by priority-based coloring, ACM SIGPLAN Notices, vol.39, issue.4, pp.91-103, 2004.
DOI : 10.1145/989393.989406

Q. Colombet, F. Brandner, and A. Darte, Studying optimal spilling in the light of ssa Architectures and Synthesis for Embedded Systems, Proceedings of the 14th International Conference on Compilers, pp.25-34, 2011.

L. Domagaa-la, Application of CLP to instruction modulo scheduling for VLIW processors

E. Duesterwald, R. Gupta, and M. L. Soffa, Register pipelining: An integrated approach to register allocation for scalar and subscripted variables, Proceedings of the 4th International Conference on Compiler Construction, CC '92, pp.192-206, 1992.
DOI : 10.1007/3-540-55984-1_18

M. Farach-colton and V. Liberatore, On Local Register Allocation, Journal of Algorithms, vol.37, issue.1, pp.37-65, 2000.
DOI : 10.1006/jagm.2000.1095

P. Feautrier, Compiler optimizations for scalable parallel systems. chapter Array Dataflow Analysis, pp.173-219, 2001.

L. George and A. W. Appel, Iterated register coalescing, ACM Transactions on Programming Languages and Systems, vol.18, issue.3, pp.300-324, 1996.
DOI : 10.1145/229542.229546

S. Hack, D. Grund, and G. Goos, Register Allocation for Programs in SSA-Form, Compiler Construction, pp.247-262, 2006.
DOI : 10.1007/11688839_20

V. Jain and I. E. Grossmann, Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems, INFORMS Journal on Computing, vol.13, issue.4, pp.258-276, 2001.
DOI : 10.1287/ijoc.13.4.258.9733

K. Kuchcinski, Constraints-driven scheduling and resource assignment, ACM Transactions on Design Automation of Electronic Systems, vol.8, issue.3, pp.355-383, 2003.
DOI : 10.1145/785411.785416

R. Lo, F. Chow, R. Kennedy, S. Liu, and P. Tu, Register promotion by sparse partial redundancy elimination of loads and stores, ACM SIGPLAN Notices, vol.33, issue.5, pp.26-37, 1998.
DOI : 10.1145/277652.277659

Y. Ma, Register Pressure Guided Loop Optimization, 2007.

R. Motwani, V. Krishna, V. Palem, S. Sarkar, and . Reyen, Combining register allocation and instruction scheduling. Courant Institute, 1995.

G. Ottosson and E. S. Thorsteinsson, Linear relaxations and reduced-cost based propagation of continuous variable subscripts, CP-AI-OR'00 Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, 2000.

C. Quimper, A. López-ortiz, P. Beek, and A. Golynski, Improved Algorithms for the Global Cardinality Constraint, Principles and Practice of Constraint Programming ? CP 2004, pp.542-556, 2004.
DOI : 10.1007/978-3-540-30201-8_40

J. Régin, Generalized arc consistency for global cardinality constraint, Proceedings of the thirteenth national conference on Artificial intelligence AAAI'96, pp.209-215, 1996.

J. Régin, A filtering algorithm for constraints of difference in csps, Proceedings of the Twelfth National Conference on Artificial Intelligence AAAI '94, pp.362-367, 1994.

U. Lakshminarayanan-renganarayanan, S. V. Ramakrishna, and . Rajopadhye, Combined ilp and register tiling: Analytical model and optimization framework, LCPC, pp.244-258, 2005.

F. Rossi, P. Van-beek, and T. Walsh, Handbook of Constraint Programming (Foundations of Artificial Intelligence), 2006.

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, CP '98, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30

P. Van-beek and X. Chen, Cplan: A constraint programming approach to planning American Association for Artificial Intelligence, Proceedings of the Sixteenth National Conference on Artificial Intelligence and the Eleventh Innovative Applications of Artificial Intelligence Conference Innovative Applications of Artificial Intelligence, AAAI '99/IAAI '99, pp.585-590, 1999.

R. N°-8541 and R. Centre-grenoble-?-rhône-alpes, Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria, pp.249-6399