{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:36:50Z","timestamp":1775054210614,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642198601","type":"print"},{"value":"9783642198618","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19861-8_4","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T13:39:26Z","timestamp":1300109966000},"page":"42-61","source":"Crossref","is-referenced-by-count":4,"title":["SSA-Based Register Allocation with PBQP"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Buchwald","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Zwinkau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Bersch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bouchez, F., Darte, A., Rastello, F.: On the complexity of register coalescing. In: CGO 2007: Proceedings of the International Symposium on Code Generation and Optimization, pp. 102\u2013114 (2007)","DOI":"10.1109\/CGO.2007.26"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-11970-5_12","volume-title":"Compiler Construction","author":"M. Braun","year":"2010","unstructured":"Braun, M., Mallon, C., Hack, S.: Preference-guided register assignment. In: Gupta, R. (ed.) CC 2010. LNCS, vol.\u00a06011, pp. 205\u2013223. Springer, Heidelberg (2010)"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/177492.177575","volume":"16","author":"P. Briggs","year":"1994","unstructured":"Briggs, P., Cooper, K.D., Torczon, L.: Improvements to graph coloring register allocation. ACM Trans. Program. Lang. Syst.\u00a016(3), 428\u2013455 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR4","volume-title":"14th International Workshop on Logic and Synthesis","author":"P. Brisk","year":"2005","unstructured":"Brisk, P., Dabiri, F., Macbeth, J., Sarrafzadeh, M.: Polynomial time graph coloring register allocation. In: 14th International Workshop on Logic and Synthesis. ACM Press, New York (2005)"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1878921.1878926","volume-title":"Proceedings of the 2010 International Conference on Compilers, Architectures and Synthesis for Embedded Systems, CASES 2010","author":"S. Buchwald","year":"2010","unstructured":"Buchwald, S., Zwinkau, A.: Instruction selection by graph transformation. In: Proceedings of the 2010 International Conference on Compilers, Architectures and Synthesis for Embedded Systems, CASES 2010, pp. 31\u201340. ACM, New York (2010)"},{"issue":"1","key":"4_CR6","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":"4_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G. Dirac","year":"1961","unstructured":"Dirac, G.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg\u00a025, 71\u201376 (1961)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1375657.1375663","volume-title":"LCTES 2008: Proceedings of the 2008 ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems","author":"D. Ebner","year":"2008","unstructured":"Ebner, D., Brandner, F., Scholz, B., Krall, A., Wiedermann, P., Kadlec, A.: Generalized instruction selection using SSA-graphs. In: LCTES 2008: Proceedings of the 2008 ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, pp. 31\u201340. ACM, New York (2008)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-39920-9_5","volume-title":"Software and Compilers for Embedded Systems","author":"E. Eckstein","year":"2003","unstructured":"Eckstein, E., K\u00f6nig, O., Scholz, B.: Code instruction selection based on SSA-graphs. In: Anshelevich, E. (ed.) SCOPES 2003. LNCS, vol.\u00a02826, pp. 49\u201365. Springer, Heidelberg (2003)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-71229-9_8","volume-title":"Compiler Construction","author":"D. Grund","year":"2007","unstructured":"Grund, D., Hack, S.: A fast cutting-plane algorithm for optimal coalescing. In: Adsul, B., Vetta, A. (eds.) CC 2007. LNCS, vol.\u00a04420, pp. 111\u2013125. Springer, Heidelberg (2007)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Hack, S.: Register allocation for programs in SSA form. Ph.D. thesis, Universit\u00e4t Karlsruhe (October 2007)","DOI":"10.1007\/11688839_20"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Hack, S., Goos, G.: Copy coalescing by graph recoloring. In: PLDI 2008: Proceedings of the 2008 ACM SIGPLAN Conference on Programming Language Design and Implementation (2008)","DOI":"10.1145\/1375581.1375610"},{"key":"4_CR13","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":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/11860990_21","volume-title":"Modular Programming Languages","author":"L. Hames","year":"2006","unstructured":"Hames, L., Scholz, B.: Nearly optimal register allocation with PBQP. In: Lightfoot, D.E., Ren, X.-M. (eds.) JMLC 2006. LNCS, vol.\u00a04228, pp. 346\u2013361. Springer, Heidelberg (2006)"},{"issue":"6","key":"4_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1273442.1250746","volume":"42","author":"N. Nethercote","year":"2007","unstructured":"Nethercote, N., Seward, J.: Valgrind: a framework for heavyweight dynamic binary instrumentation. SIGPLAN Not.\u00a042(6), 89\u2013100 (2007)","journal-title":"SIGPLAN Not"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Scholz, B., Eckstein, E.: Register allocation for irregular architectures. In: LCTES-SCOPES, pp. 139\u2013148 (2002)","DOI":"10.1145\/566225.513854"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19861-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:03:51Z","timestamp":1558422231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19861-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198601","9783642198618"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19861-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}