{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T21:49:22Z","timestamp":1786744162930,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642335570","type":"print"},{"value":"9783642335587","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_54","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:32:47Z","timestamp":1349231567000},"page":"750-766","source":"Crossref","is-referenced-by-count":21,"title":["Constraint-Based Register Allocation and Instruction Scheduling"],"prefix":"10.1007","author":[{"given":"Roberto Casta\u00f1eda","family":"Lozano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mats","family":"Carlsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frej","family":"Drejhammar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"54_CR1","unstructured":"Lattner, C., Adve, V.: LLVM: A compilation framework for lifelong program analysis & transformation. In: CGO (March 2004)"},{"key":"54_CR2","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1002\/(SICI)1097-024X(199608)26:8<929::AID-SPE40>3.0.CO;2-T","volume":"26","author":"D.W. Goodwin","year":"1996","unstructured":"Goodwin, D.W., Wilken, K.D.: Optimal and near-optimal global register allocations using 0-1 integer programming. Software \u2013 Practice and Experience\u00a026, 929\u2013965 (1996)","journal-title":"Software \u2013 Practice and Experience"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/381694.378854","volume":"36","author":"A.W. Appel","year":"2001","unstructured":"Appel, A.W., George, L.: Optimal spilling for CISC machines with few registers. SIGPLAN Not.\u00a036, 243\u2013253 (2001)","journal-title":"SIGPLAN Not."},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/566225.513854","volume":"37","author":"B. Scholz","year":"2002","unstructured":"Scholz, B., Eckstein, E.: Register allocation for irregular architectures. SIGPLAN Not.\u00a037, 139\u2013148 (2002)","journal-title":"SIGPLAN Not."},{"key":"54_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-54444-5_89","volume-title":"Programming Language Implementation and Logic Programming","author":"M. Anton Ertl","year":"1991","unstructured":"Anton Ertl, M., Krall, A.: Optimal Instruction Scheduling Using Constraint Logic Programming. In: Ma\u0142uszy\u0144ski, J., Wirsing, M. (eds.) PLILP 1991. LNCS, vol.\u00a0528, pp. 75\u201386. Springer, Heidelberg (1991)"},{"issue":"1","key":"54_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1142\/S0218213008003765","volume":"17","author":"A.M. Malik","year":"2008","unstructured":"Malik, A.M., McInnes, J., van Beek, P.: Optimal basic block instruction scheduling for multiple-issue processors using constraint programming. International Journal on Artificial Intelligence Tools\u00a017(1), 37\u201354 (2008)","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/92.555991","volume":"5","author":"R. Leupers","year":"1997","unstructured":"Leupers, R., Marwedel, P.: Time-constrained code compaction for DSP\u2019s. IEEE Transactions on Very Large Scale Integration Systems\u00a05, 112\u2013122 (1997)","journal-title":"IEEE Transactions on Very Large Scale Integration Systems"},{"key":"54_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/358438.349318","volume":"35","author":"K. Wilken","year":"2000","unstructured":"Wilken, K., Liu, J., Heffernan, M.: Optimal instruction scheduling using integer programming. SIGPLAN Not.\u00a035, 121\u2013133 (2000)","journal-title":"SIGPLAN Not."},{"key":"54_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-85958-1_7","volume-title":"Principles and Practice of Constraint Programming","author":"A.M. Malik","year":"2008","unstructured":"Malik, A.M., Chase, M., Russell, T., van Beek, P.: An Application of Constraint Programming to Superblock Instruction Scheduling. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 97\u2013111. Springer, Heidelberg (2008)"},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"Winkel, S.: Exploring the performance potential of Itanium processors with ILP-based scheduling. In: CGO, pp. 189\u2013200. IEEE (2004)","DOI":"10.1109\/CGO.2004.1281674"},{"key":"54_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/71.372778","volume":"6","author":"H.C. Chou","year":"1995","unstructured":"Chou, H.C., Chung, C.P.: An optimal instruction scheduler for superscalar processor. IEEE Transactions on Parallel and Distributed Systems\u00a06, 303\u2013313 (1995)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Shobaki, G., Wilken, K.: Optimal superblock scheduling using enumeration. In: MICRO, pp. 283\u2013293. IEEE (2004)","DOI":"10.1109\/MICRO.2004.27"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Gebotys, C.H., Elmasry, M.I.: Simultaneous scheduling and allocation for cost constrained optimal architectural synthesis. In: DAC, pp. 2\u20137. ACM (1991)","DOI":"10.1145\/127601.127609"},{"key":"54_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-45245-1_5","volume-title":"Languages, Compilers, and Tools for Embedded Systems","author":"D. K\u00e4stner","year":"2001","unstructured":"K\u00e4stner, D.: PROPAN: A Retargetable System for Postpass Optimisations and Analyses. In: Davidson, J., Min, S.L. (eds.) LCTES 2000. LNCS, vol.\u00a01985, pp. 63\u201380. Springer, Heidelberg (2001)"},{"key":"54_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1145\/785411.785416","volume":"8","author":"K. Kuchcinski","year":"2003","unstructured":"Kuchcinski, K.: Constraints-driven scheduling and resource assignment. ACM Trans. Des. Autom. Electron. Syst.\u00a08, 355\u2013383 (2003)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"54_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-71229-9_9","volume-title":"Compiler Construction","author":"S.G. Nagarakatte","year":"2007","unstructured":"Nagarakatte, S.G., Govindarajan, R.: Register Allocation and Optimal Spill Code Scheduling in Software Pipelined Loops Using 0-1 Integer Linear Programming Formulation. In: Adsul, B., Vetta, A. (eds.) CC 2007. LNCS, vol.\u00a04420, pp. 126\u2013140. Springer, Heidelberg (2007)"},{"key":"54_CR17","doi-asserted-by":"crossref","unstructured":"Bashford, S., Leupers, R.: Phase-coupled mapping of data flow graphs to irregular data paths. Design Automation for Embedded Systems, 119\u2013165 (1999)","DOI":"10.1023\/A:1008966522714"},{"key":"54_CR18","doi-asserted-by":"crossref","unstructured":"Wilson, T., Grewal, G., Halley, B., Banerji, D.: An integrated approach to retargetable code generation. In: ISSS, pp. 70\u201375. IEEE (1994)","DOI":"10.1109\/ISHLS.1994.302339"},{"key":"54_CR19","doi-asserted-by":"crossref","unstructured":"Eriksson, M.V., Skoog, O., Kessler, C.W.: Optimal vs. heuristic integrated code generation for clustered VLIW architectures. In: SCOPES, pp. 11\u201320 (2008)","DOI":"10.1145\/1361096.1361099"},{"key":"54_CR20","unstructured":"Sweetman, D.: See MIPS Run, 2nd edn. Morgan Kaufmann (2006)"},{"issue":"4","key":"54_CR21","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM TOPLAS\u00a013(4), 451\u2013490 (1991)","journal-title":"ACM TOPLAS"},{"key":"54_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-48294-6_13","volume-title":"Static Analysis","author":"V.C. Sreedhar","year":"1999","unstructured":"Sreedhar, V.C., Ju, R.D.-C., Gillies, D.M., Santhanam, V.: Translating Out of Static Single Assignment Form. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 194\u2013210. Springer, Heidelberg (1999)"},{"key":"54_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11688839_20","volume-title":"Compiler Construction","author":"S. Hack","year":"2006","unstructured":"Hack, S., Grund, D., Goos, G.: Register Allocation for Programs in SSA-Form. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 247\u2013262. Springer, Heidelberg (2006)"},{"key":"54_CR24","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/996893.996875","volume":"39","author":"M.D. Smith","year":"2004","unstructured":"Smith, M.D., Ramsey, N., Holloway, G.: A generalized algorithm for graph-coloring register allocation. SIGPLAN Not.\u00a039, 277\u2013288 (2004)","journal-title":"SIGPLAN Not."},{"issue":"4","key":"54_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/278283.278285","volume":"33","author":"A.W. Appel","year":"1998","unstructured":"Appel, A.W.: SSA is functional programming. SIGPLAN Not.\u00a033(4), 17\u201320 (1998)","journal-title":"SIGPLAN Not."},{"key":"54_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-46423-9_8","volume-title":"Compiler Construction","author":"J. Aycock","year":"2000","unstructured":"Aycock, J., Horspool, N.: Simple Generation of Static Single-Assignment Form. In: Watt, D.A. (ed.) CC 2000. LNCS, vol.\u00a01781, pp. 110\u2013124. Springer, Heidelberg (2000)"},{"key":"54_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45578-7_26","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N., Carlsson, M.: Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 377\u2013391. Springer, Heidelberg (2001)"},{"key":"54_CR28","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/1379022.1375609","volume":"43","author":"F. Pereira","year":"2008","unstructured":"Pereira, F., Palsberg, J.: Register allocation by puzzle solving. SIGPLAN Not.\u00a043, 216\u2013226 (2008)","journal-title":"SIGPLAN Not."},{"issue":"7","key":"54_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling\u00a017(7), 57\u201373 (1993)","journal-title":"Mathematical and Computer Modelling"},{"key":"54_CR30","doi-asserted-by":"crossref","unstructured":"Kessler, C.W.: Compiling for VLIW DSPs. In: Handbook of Signal Processing Systems, pp. 603\u2013638. Springer (2010)","DOI":"10.1007\/978-1-4419-6345-1_22"},{"issue":"1","key":"54_CR31","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"G.J. Chaitin","year":"1981","unstructured":"Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W.: Register allocation via coloring. Computer Languages\u00a06(1), 47\u201357 (1981)","journal-title":"Computer Languages"},{"key":"54_CR32","doi-asserted-by":"crossref","unstructured":"Boissinot, B., Hack, S., Grund, D., Dupont de Dinechin, B., Rastello, F.: Fast liveness checking for SSA-form programs. In: CGO, pp. 35\u201344. ACM (2008)","DOI":"10.1145\/1356058.1356064"},{"key":"54_CR33","unstructured":"Gecode Team: Gecode: generic constraint development environment (2006), http:\/\/www.gecode.org"},{"issue":"6","key":"54_CR34","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1145\/502949.502896","volume":"19","author":"F. Chow","year":"1984","unstructured":"Chow, F., Hennessy, J.: Register allocation by priority-based coloring. SIGPLAN Not.\u00a019(6), 222\u2013232 (1984)","journal-title":"SIGPLAN Not."},{"key":"54_CR35","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01205181","volume":"7","author":"B.R. Rau","year":"1993","unstructured":"Rau, B.R., Fisher, J.A.: Instruction-level parallel processing: history, overview, and perspective. J. Supercomput.\u00a07, 9\u201350 (1993)","journal-title":"J. Supercomput."},{"issue":"1","key":"54_CR36","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Mathematical Programming\u00a096(1), 33\u201360 (2003)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T22:14:19Z","timestamp":1744236859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}