{"created":"2025-01-19T01:15:22.703434+00:00","updated":"2025-01-19T16:33:50.737839+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214567","sets":["934:935:10774:10775"]},"path":["10775"],"owner":"44499","recid":"214567","title":["Automatic Optimize-time Validation for Binary Optimizers"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-01-05"},"_buckets":{"deposit":"a1ae0414-bae8-4c94-85dd-7eda2f10e838"},"_deposit":{"id":"214567","pid":{"type":"depid","value":"214567","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Automatic Optimize-time Validation for Binary Optimizers","author_link":["551506","551509","551508","551504","551512","551510","551511","551505","551513","551507"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Automatic Optimize-time Validation for Binary Optimizers"},{"subitem_title":"Automatic Optimize-time Validation for Binary Optimizers","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[通常論文] validation, binary optimizer, code generation","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2022-01-05","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"IBM Research - Tokyo"},{"subitem_text_value":"IBM Canada"},{"subitem_text_value":"IBM Research - Tokyo"},{"subitem_text_value":"IBM United Kingdom Limited"},{"subitem_text_value":"IBM Research - Tokyo"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"IBM Research - Tokyo","subitem_text_language":"en"},{"subitem_text_value":"IBM Canada","subitem_text_language":"en"},{"subitem_text_value":"IBM Research - Tokyo","subitem_text_language":"en"},{"subitem_text_value":"IBM United Kingdom Limited","subitem_text_language":"en"},{"subitem_text_value":"IBM Research - Tokyo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/214567/files/IPSJ-TPRO1501002.pdf","label":"IPSJ-TPRO1501002.pdf"},"date":[{"dateType":"Available","dateValue":"2024-01-05"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO1501002.pdf","filesize":[{"value":"1.6 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"df29dc29-973b-4a00-aeae-42e6658a067b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Motohiro, Kawahito"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Reid, Copeland"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toshihiko, Koju"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"David, Siegwart"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Moriyoshi, Ohara"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Motohiro, Kawahito","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Reid, Copeland","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toshihiko, Koju","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"David, Siegwart","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Moriyoshi, Ohara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464814","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7802","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We propose an approach called automatic optimize-time validation for binary optimizers. Our approach does not involve executing the whole program for validation but selecting a small part of code (1 to 100 instructions) for the target test code. It executes the target code and its optimized code with several input data during binary optimization. One benefit is that we can test a small part of an actual customer's code during binary optimization. Our approach can be used to test several input data not included in the target code, which is the most beneficial aspect of the approach. If the results are the same after execution, we will use the optimized code for the final output code. If the results differ, we can consider a couple of option, e.g., while developing a binary optimizer, we can abort the compilation with an error message to easily detect a bug. After a binary optimizer becomes generally available, we can use the input code for the final output code to maintain compatibility. Our goal is for the output binary code to be compatible, fast, and small. We focused on how to improve compatibility in this study. We implemented our approach in our binary optimizer and successfully detected one new bug. We used a very small binary program to observe the worst case of increased compilation time and output binary file size. Our implementation showed that our approach increases optimization time by only 0.02% and output binary file size by 8%.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.30(2022) (online)\n------------------------------","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose an approach called automatic optimize-time validation for binary optimizers. Our approach does not involve executing the whole program for validation but selecting a small part of code (1 to 100 instructions) for the target test code. It executes the target code and its optimized code with several input data during binary optimization. One benefit is that we can test a small part of an actual customer's code during binary optimization. Our approach can be used to test several input data not included in the target code, which is the most beneficial aspect of the approach. If the results are the same after execution, we will use the optimized code for the final output code. If the results differ, we can consider a couple of option, e.g., while developing a binary optimizer, we can abort the compilation with an error message to easily detect a bug. After a binary optimizer becomes generally available, we can use the input code for the final output code to maintain compatibility. Our goal is for the output binary code to be compatible, fast, and small. We focused on how to improve compatibility in this study. We implemented our approach in our binary optimizer and successfully detected one new bug. We used a very small binary program to observe the worst case of increased compilation time and output binary file size. Our implementation showed that our approach increases optimization time by only 0.02% and output binary file size by 8%.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.30(2022) (online)\n------------------------------","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2022-01-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"15"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214567,"links":{}}