{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T00:10:03Z","timestamp":1748563803889,"version":"3.41.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_42","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"609-626","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Modeling Universal Instruction Selection"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Hjort Blindell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Casta\u00f1eda Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mats","family":"Carlsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"unstructured":"Opturion CPX user\u2019s guide: Version 1.0.2. Tech. rep., Opturion Pty Ltd (2013)","key":"42_CR1"},{"issue":"4","key":"42_CR2","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1145\/69558.75700","volume":"11","author":"AV Aho","year":"1989","unstructured":"Aho, A.V., Ganapathi, M., Tjiang, S.W.K.: Code Generation Using Tree Matching and Dynamic Programming. Transactions on Programming Languages and Systems 11(4), 491\u2013516 (1989)","journal-title":"Transactions on Programming Languages and Systems"},{"doi-asserted-by":"crossref","unstructured":"Allen, J.R., Kennedy, K., Porterfield, C., Warren, J.: Conversion of Control Dependence to Data Dependence. In: ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 177\u2013189 (1983)","key":"42_CR3","DOI":"10.1145\/567067.567085"},{"doi-asserted-by":"crossref","unstructured":"Arslan, M.A., Kuchcinski, K.: Instruction Selection and Scheduling for DSP Kernels on Custom Architectures. In: EUROMICRO Conference on Digital System Design (2013)","key":"42_CR4","DOI":"10.1109\/DSD.2013.91"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-37051-9_2","volume-title":"Compiler Construction","author":"G Barany","year":"2013","unstructured":"Barany, G., Krall, A.: Optimal and Heuristic Global Code Motion for Minimal Spilling. In: Jhala, R., De Bosschere, K. (eds.) Compiler Construction. LNCS, vol. 7791, pp. 21\u201340. Springer, Heidelberg (2013)"},{"doi-asserted-by":"crossref","unstructured":"Bashford, S., Leupers, R.: Constraint Driven Code Selection for Fixed-Point DSPs. In: ACM\/IEEE Design Automation Conference, pp. 817\u2013822 (1999)","key":"42_CR6","DOI":"10.1145\/309847.310076"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/11823285_48","volume-title":"Euro-Par 2006 Parallel Processing","author":"A Bednarski","year":"2006","unstructured":"Bednarski, A., Kessler, C.W.: Optimal Integrated VLIW Code Generation with Integer Linear Programming. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol. 4128, pp. 461\u2013472. Springer, Heidelberg (2006)"},{"issue":"3","key":"42_CR8","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1145\/321958.321971","volume":"23","author":"J Bruno","year":"1976","unstructured":"Bruno, J., Sethi, R.: Code Generation for a One-Register Machine. Journal of the ACM 23(3), 502\u2013510 (1976)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Buchwald, S., Zwinkau, A.: Instruction Selection by Graph Transformation. In: International Conference on Compilers, Architectures and Synthesis for Embedded Systems, pp. 31\u201340 (2010)","key":"42_CR9","DOI":"10.1145\/1878921.1878926"},{"doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda Lozano, R., Carlsson, M., Blindell, G.H., Schulte, C.: Combinatorial spill code optimization and ultimate coalescing. In: Kulkarni, P. (ed.) Languages, Compilers, Tools and Theory for Embedded Systems, pp. 23\u201332. ACM Press, Edinburgh, UK (2014)","key":"42_CR10","DOI":"10.1145\/2666357.2597815"},{"key":"42_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1007\/978-3-642-33558-7_54","volume-title":"Principles and Practice of Constraint Programming","author":"RC Lozano","year":"2012","unstructured":"Lozano, R.C., Carlsson, M., Drejhammar, F., Schulte, C.: Constraint-Based Register Allocation and Instruction Scheduling. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 750\u2013766. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Click, C.: Global Code Motion\/Global Value Numbering. In: ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation, pp. 246\u2013257 (1995)","key":"42_CR12","DOI":"10.1145\/223428.207154"},{"issue":"10","key":"42_CR13","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"4","key":"42_CR14","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 13(4), 451\u2013490 (1991)","journal-title":"ACM TOPLAS"},{"doi-asserted-by":"crossref","unstructured":"Ebner, D., Brandner, F., Scholz, B., Krall, A., Wiedermann, P., Kadlec, A.: Generalized Instruction Selection Using SSA-Graphs. In: ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, pp. 31\u201340 (2008)","key":"42_CR15","DOI":"10.1145\/1379023.1375663"},{"key":"42_CR16","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. 2826, pp. 49\u201365. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Ertl, M.A.: Optimal Code Selection in DAGs. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 242\u2013249 (1999)","key":"42_CR17","DOI":"10.1145\/292540.292562"},{"doi-asserted-by":"crossref","unstructured":"Ertl, M.A., Casey, K., Gregg, D.: Fast and Flexible Instruction Selection with On-Demand Tree-Parsing Automata. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 52\u201360 (2006)","key":"42_CR18","DOI":"10.1145\/1133255.1133988"},{"doi-asserted-by":"crossref","unstructured":"Floch, A., Wolinski, C., Kuchcinski, K.: Combined Scheduling and Instruction Selection for Processors with Reconfigurable Cell Fabric. In: International Conference on Application-Specific Systems, Architectures and Processors, pp. 167\u2013174 (2010)","key":"42_CR19","DOI":"10.1109\/ASAP.2010.5540997"},{"unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)","key":"42_CR20"},{"doi-asserted-by":"crossref","unstructured":"Gebotys, C.H.: An Efficient Model for DSP Code Generation: Performance, Code Size, Estimated Energy. In: International Symposium on System Synthesis, pp. 41\u201347 (1997)","key":"42_CR21","DOI":"10.1109\/ISSS.1997.621674"},{"doi-asserted-by":"crossref","unstructured":"Glanville, R.S., Graham, S.L.: A New Method for Compiler Code Generation. In: ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 231\u2013254 (1978)","key":"42_CR22","DOI":"10.1145\/512760.512785"},{"unstructured":"Hjort Blindell, G.: Survey on Instruction Selection: An Extensive and Modern Literature Study. Tech. Rep. KTH\/ICT\/ECS\/R-13\/17-SE, KTH Royal Institute of Technology, Sweden (October 2013)","key":"42_CR23"},{"doi-asserted-by":"crossref","unstructured":"Johnson, N., Mycroft, A.: Combined Code Motion and Register Allocation Using the Value State Dependence Graph. In: International Conference of Compiler Construction, pp. 1\u201316 (2003)","key":"42_CR24","DOI":"10.1007\/3-540-36579-6_1"},{"doi-asserted-by":"crossref","unstructured":"Koes, D.R., Goldstein, S.C.: Near-Optimal Instruction Selection on DAGs. In: IEEE\/ACM International Symposium on Code Generation and Optimization, pp. 45\u201354 (2008)","key":"42_CR25","DOI":"10.1145\/1356058.1356065"},{"unstructured":"Lattner, C., Adve, V.: LLVM: A compilation framework for lifelong program analysis & transformation. In: IEEE\/ACM International Symposium on Code Generation and Optimization (2004)","key":"42_CR26"},{"issue":"1","key":"42_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"JL Lauri\u00e8re","year":"1978","unstructured":"Lauri\u00e8re, J.L.: A Language and a Program for Stating and Solving Combinatorial Problems. Artificial Intelligence 10(1), 29\u2013127 (1978)","journal-title":"Artificial Intelligence"},{"unstructured":"Lee, C., Potkonjak, M., Mangione-Smith, W.H.: MediaBench: A tool for evaluating and synthesizing multimedia and communications systems. In: IEEE MICRO-30, pp. 330\u2013335 (1997)","key":"42_CR28"},{"doi-asserted-by":"crossref","unstructured":"Leupers, R.: Code Selection for Media Processors with SIMD Instructions. In: Conference on Design, Automation and Test in Europe, pp. 4\u20138 (2000)","key":"42_CR29","DOI":"10.1145\/343647.343679"},{"doi-asserted-by":"crossref","unstructured":"Martin, K., Wolinski, C., Kuchcinski, K., Floch, A., Charot, F.: Constraint-Driven Instructions Selection and Application Scheduling in the DURASE System. In: International Conference on Application-Specific Systems, Architectures and Processors, pp. 145\u2013152 (2009)","key":"42_CR30","DOI":"10.1109\/ASAP.2009.19"},{"key":"42_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: Towards a Standard CP Modelling Language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Pelegr\u00ed-Llopart, E., Graham, S.L.: Optimal Code Generation for Expression Trees: An Application of BURS Theory. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 294\u2013308 (1988)","key":"42_CR32","DOI":"10.1145\/73560.73586"},{"unstructured":"Sweetman, D.: See MIPS Run, Second Edition. Morgan Kaufmann (2006)","key":"42_CR33"},{"doi-asserted-by":"crossref","unstructured":"Tanaka, H., Kobayashi, S., Takeuchi, Y., Sakanushi, K., Imai, M.: A Code Selection Method for SIMD Processors with PACK Instructions. In: International Workshop on Software and Compilers for Embedded Systems, pp. 66\u201380","key":"42_CR34","DOI":"10.1007\/978-3-540-39920-9_6"},{"unstructured":"\u017divojnovi\u0107, V., Mart\u00ednez Velarde, J., Schl\u00e4ger, C., Meyr, H.: DSPstone: A DSP-Oriented Benchmarking Methodology. In: Conference on Signal Processing Applications and Technology, pp. 715\u2013720 (1994)","key":"42_CR35"},{"doi-asserted-by":"crossref","unstructured":"Wilson, T., Grewal, G., Halley, B., Banerji, D.: An Integrated Approach to Retargetable Code Generation. In: International Symposium on High-Level Synthesis, pp. 70\u201375 (1994)","key":"42_CR36","DOI":"10.1109\/ISHLS.1994.302339"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:47:54Z","timestamp":1748562474000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}