{"updated":"2025-01-23T02:20:33.197949+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00011221","sets":["581:651:659"]},"path":["659"],"owner":"1","recid":"11221","title":["充足可能性判定を利用した最適コード生成手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2003-05-15"},"_buckets":{"deposit":"3db01f7e-089b-4d97-976f-f8654063d2c0"},"_deposit":{"id":"11221","pid":{"type":"depid","value":"11221","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"充足可能性判定を利用した最適コード生成手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"充足可能性判定を利用した最適コード生成手法"},{"subitem_title":"Optimal Code Generation Based on Boolean Satisfiability","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"特集：システムLSIの設計技術と設計自動化","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2003-05-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学工学部電子工学科"},{"subitem_text_value":"東京大学工学部電子工学科"},{"subitem_text_value":"東京大学大規模集積システム設計教育研究センター"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Electronics Engineering, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Department of Electronics Engineering, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"VDEC, The University of Tokyo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/11221/files/IPSJ-JNL4405003.pdf"},"date":[{"dateType":"Available","dateValue":"2005-05-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4405003.pdf","filesize":[{"value":"144.8 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"dabb4755-c2a9-4735-81b4-eaea48993844","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2003 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"瀬戸, 謙修"},{"creatorName":"藤田, 昌宏"},{"creatorName":"浅田, 邦博"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kenshu, Seto","creatorNameLang":"en"},{"creatorName":"Masahiro, Fujita","creatorNameLang":"en"},{"creatorName":"Kunihiro, Asada","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"充足可能性判定（SAT）を利用した最適なコード生成手法を提案する．まずコード生成問題を有限状態機械（FSM）を利用して定式化する（瀬戸ほか，2002）．次にFSMを組合せ回路へと展開し（Biereほか，1999），最適コード生成問題を充足可能性判定（SAT）問題として解く．最新のSATソルバ（Moskewiczほか，2001）を使用した実験結果から，SATベースのコード生成手法がBDDベースのコード生成（瀬戸ほか，2002）よりも効果的であることが示される．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We present a method for optimal code generationbased on Boolean satisfiability (SAT).First, code generation is formulated based on a finite statemachine (FSM) (Seto, et al., 2002). Next, we unroll the FSM to a combinational circuit (Biere, et al., 1999),so that optimal code generation problem is solved as a SAT problem.Experimental results using a state-of-the-art SATsolver (Moskewicz, et al., 2001) demonstrate that SAT-based optimalcode generation is more effective than BDD-based symbolic approach (Seto, et al., 2002).","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1205","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1202","bibliographicIssueDates":{"bibliographicIssueDate":"2003-05-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"44"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"テクニカルノート ハードウェア/ソフトウェア協調設計"}]},"weko_creator_id":"1"},"created":"2025-01-18T22:45:54.744609+00:00","id":11221,"links":{}}