{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:30Z","timestamp":1772163990953,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,12]],"date-time":"2008-06-12T00:00:00Z","timestamp":1213228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,12]]},"DOI":"10.1145\/1375657.1375663","type":"proceedings-article","created":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T09:49:02Z","timestamp":1213696142000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Generalized instruction selection using\n                    <i>SSA<\/i>\n                    -graphs"],"prefix":"10.1145","author":[{"given":"Dietmar","family":"Ebner","sequence":"first","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]},{"given":"Florian","family":"Brandner","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]},{"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[{"name":"University of Sydney, Sydney, Australia"}]},{"given":"Andreas","family":"Krall","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]},{"given":"Peter","family":"Wiedermann","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]},{"given":"Albrecht","family":"Kadlec","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2008,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.05.001"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321970"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(90)90006-B"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115320"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11688839_18"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Erik\n      Eckstein Oliver\n      K\u00f6nig and \n      Bernhard\n      Scholz\n    .\n  Code Instruction Selection Based on SSA-Graphs\n  . In Andreas Krall editor SCOPES volume \n  2826\n   of \n  Lecture Notes in Computer Science pages \n  49\n  --\n  65\n  . \n  Springer 2003\n  .  Erik Eckstein Oliver K\u00f6nig and Bernhard Scholz. Code Instruction Selection Based on SSA-Graphs. In Andreas Krall editor SCOPES volume 2826 of Lecture Notes in Computer Science pages 49--65. Springer 2003.","DOI":"10.1007\/978-3-540-39920-9_5"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292562"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133988"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/131080.131089"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/151640.151642"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/200994.201003"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823285_31"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11860990_21"},{"key":"e_1_3_2_1_16_1","volume-title":"Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (TH),Germany","author":"Jakschitsch Hannes","year":"2004","unstructured":"Hannes Jakschitsch . \" Befehlsauswahl auf SSA-Graphen\". Master's thesis , Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (TH),Germany , 2004 . Hannes Jakschitsch. \"Befehlsauswahl auf SSA-Graphen\". Master's thesis, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (TH),Germany, 2004."},{"key":"e_1_3_2_1_17_1","unstructured":"SPEC2000 Website. http:\/\/www.spec.org.  SPEC2000 Website. http:\/\/www.spec.org."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/362652.362661"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/224841.225071"},{"key":"e_1_3_2_1_21_1","unstructured":"MiBench Website. http:\/\/www.eecs.umich.edu\/mibench\/.  MiBench Website. http:\/\/www.eecs.umich.edu\/mibench\/."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050099"},{"key":"e_1_3_2_1_23_1","unstructured":"Todd A. Proebsting. Least-Cost Instruction Selection in DAGs is NP-Complete. http:\/\/research.microsoft.com\/~toddpro\/papers\/proof.htm 1998.  Todd A. Proebsting. Least-Cost Instruction Selection in DAGs is NP-Complete. http:\/\/research.microsoft.com\/~toddpro\/papers\/proof.htm 1998."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1269843.1269857"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/513829.513854"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the International Conference on Signal Processing and Technology (ICSPAT'94)","author":"Vojin","year":"1994","unstructured":"Vojin \u017eivojnovi#263;, Juan M. Velarde , Christian Schl\u00e4ger , and Heinrich Meyr . DSPSTONE : A DSP-oriented benchmarking methodology . In Proceedings of the International Conference on Signal Processing and Technology (ICSPAT'94) , 1994 . Vojin \u017eivojnovi#263;, Juan M. Velarde, Christian Schl\u00e4ger, and Heinrich Meyr. DSPSTONE: A DSP-oriented benchmarking methodology. In Proceedings of the International Conference on Signal Processing and Technology (ICSPAT'94), 1994."}],"event":{"name":"LCTES08: ACM SIGPLAN\/SIGBED 2008 Conference on Languages, Compilers, and Tools for Embedded Systems","location":"Tucson AZ USA","acronym":"LCTES08","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGBED ACM Special Interest Group on Embedded Systems","SIGDA ACM Special Interest Group on Design Automation","SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1375657.1375663","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1375657.1375663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:17Z","timestamp":1750243637000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1375657.1375663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,12]]},"references-count":25,"alternative-id":["10.1145\/1375657.1375663","10.1145\/1375657"],"URL":"https:\/\/doi.org\/10.1145\/1375657.1375663","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1379023.1375663","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,6,12]]},"assertion":[{"value":"2008-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}