{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00209339","sets":["934:935:10452:10453"]},"path":["10453"],"owner":"44499","recid":"209339","title":["A Method for Validating Binary Optimizers"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-01-27"},"_buckets":{"deposit":"5e6c7b72-b3a8-495d-91dc-25755bba6ddc"},"_deposit":{"id":"209339","pid":{"type":"depid","value":"209339","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"A Method for Validating Binary Optimizers","author_link":["527440","527439","527443","527441","527444","527442","527447","527446","527438","527445"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Method for Validating Binary Optimizers"},{"subitem_title":"A Method for Validating Binary Optimizers","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[発表概要, Unrefereed Presentatin Abstract] ","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2021-01-27","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"IBM Research - Tokyo"},{"subitem_text_value":"IBM Canada Software Lab - Toronto"},{"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 Software Lab - Toronto","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/209339/files/IPSJ-TPRO1401004.pdf","label":"IPSJ-TPRO1401004.pdf"},"date":[{"dateType":"Available","dateValue":"2023-01-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO1401004.pdf","filesize":[{"value":"29.8 kB"}],"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":"4a9ddd78-93cb-40e2-9909-f9db28a81dbd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":"In this presentation, we propose a method for validating binary optimizers. Our approach does not execute the whole program for validation but selects 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 multiple 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 use the input code for the final output code to maintain compatibility. We implemented our approach in our binary optimizer and successfully detected one bug. We used a very small binary program to observe the worst case of increased in compilation time and output binary file size. Our experiment showed that our approach increases optimization time by only 0.02% and output binary file size by 8%.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this presentation, we propose a method for validating binary optimizers. Our approach does not execute the whole program for validation but selects 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 multiple 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 use the input code for the final output code to maintain compatibility. We implemented our approach in our binary optimizer and successfully detected one bug. We used a very small binary program to observe the worst case of increased in compilation time and output binary file size. Our experiment showed that our approach increases optimization time by only 0.02% and output binary file size by 8%.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"15","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"15","bibliographicIssueDates":{"bibliographicIssueDate":"2021-01-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"14"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":209339,"updated":"2025-01-19T18:32:47.318568+00:00","links":{},"created":"2025-01-19T01:10:39.350733+00:00"}