{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:38:10Z","timestamp":1725601090410},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232251"},{"type":"electronic","value":"9783642232268"}],"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-23226-8_35","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T12:37:59Z","timestamp":1313584679000},"page":"268-273","source":"Crossref","is-referenced-by-count":0,"title":["Game Model Based Register Allocation"],"prefix":"10.1007","author":[{"given":"Chen","family":"Yong","sequence":"first","affiliation":[]},{"given":"He","family":"Yanxiang","sequence":"additional","affiliation":[]},{"given":"Wu","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Li","family":"Qing\u2019an","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Chaitin, G.J.: Register allocation and spilling via graph coloring. US Patent 4,571,678 (February 18, 1986)"},{"issue":"1","key":"35_CR2","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":"35_CR3","doi-asserted-by":"crossref","unstructured":"Hames, L., Scholz, B.: Nearly optimal register allocation with PBQP. Modular Programming Languages, pp. 346\u2013361 (2006)","DOI":"10.1007\/11860990_21"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/CGO.2005.4","volume-title":"Proceedings of the International Symposium on Code Generation and Optimization","author":"D. Koes","year":"2005","unstructured":"Koes, D., Goldstein, S.C.: A progressive register allocator for irregular architectures. In: Proceedings of the International Symposium on Code Generation and Optimization, pp. 269\u2013280. IEEE Computer Society, Los Alamitos (2005)"},{"issue":"1-3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.tcs.2008.05.025","volume":"407","author":"J.K. Lee","year":"2008","unstructured":"Lee, J.K., Palsberg, J., Pereira, F.M.Q.: Aliased register allocation for straight-line programs is NP-complete. Theoretical Computer Science\u00a0407(1-3), 258\u2013273 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"35_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/972627.972635","volume":"3","author":"M. Naik","year":"2004","unstructured":"Naik, M., Palsberg, J.: Compiling with code-size constraints. ACM Transactions on Embedded Computing Systems (TECS)\u00a03(1), 163\u2013181 (2004)","journal-title":"ACM Transactions on Embedded Computing Systems (TECS)"},{"key":"35_CR7","unstructured":"Palsberg, J., Pereira, F.M.Q.: Register allocation by puzzle solving. US Patent App. 12\/234,635 (September 20, 2008)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Pereira, F., Palsberg, J.: Register allocation via coloring of chordal graphs. Programming Languages and Systems, pp. 315\u2013329 (2005)","DOI":"10.1007\/11575467_21"},{"issue":"5","key":"35_CR9","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1145\/330249.330250","volume":"21","author":"M. Poletto","year":"1999","unstructured":"Poletto, M., Sarkar, V.: Linear scan register allocation. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a021(5), 895\u2013913 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"35_CR10","first-page":"67","volume-title":"MICRO42. 42nd Annual IEEE\/ACM International Symposium on Microarchitecture 2009","author":"H. Rong","year":"2010","unstructured":"Rong, H.: Tree register allocation. In: MICRO42. 42nd Annual IEEE\/ACM International Symposium on Microarchitecture 2009, pp. 67\u201377. IEEE, Los Alamitos (2010)"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/996841.996875","volume-title":"Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation","author":"M.D. Smith","year":"2004","unstructured":"Smith, M.D., Ramsey, N., Holloway, G.: A generalized algorithm for graph-coloring register allocation. In: Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, pp. 277\u2013288. ACM, New York (2004)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/277650.277714","volume-title":"Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation","author":"O. Traub","year":"1998","unstructured":"Traub, O., Holloway, G., Smith, M.D.: Quality and speed in linearscan register allocation. In: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, pp. 142\u2013151. ACM, New York (1998)"},{"key":"35_CR13","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/1772954.1772979","volume-title":"Proceedings of the 8th Annual IEEE\/ACM International Symposium on Code Generation and Optimization","author":"C. Wimmer","year":"2010","unstructured":"Wimmer, C., Franz, M.: Linear scan register allocation on SSA form. In: Proceedings of the 8th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, pp. 170\u2013179. ACM, New York (2010)"}],"container-title":["Communications in Computer and Information Science","Applied Informatics and Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23226-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T23:08:22Z","timestamp":1638313702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23226-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232251","9783642232268"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23226-8_35","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}