ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(トランザクション)
  2. プログラミング(PRO)
  3. Vol.14
  4. No.1

A Method for Validating Binary Optimizers

https://ipsj.ixsq.nii.ac.jp/records/209339
https://ipsj.ixsq.nii.ac.jp/records/209339
46a05e87-b1d5-4c32-8faa-84283ba67706
名前 / ファイル ライセンス アクション
IPSJ-TPRO1401004.pdf IPSJ-TPRO1401004.pdf (29.8 kB)
Copyright (c) 2021 by the Information Processing Society of Japan
オープンアクセス
Item type Trans(1)
公開日 2021-01-27
タイトル
タイトル A Method for Validating Binary Optimizers
タイトル
言語 en
タイトル A Method for Validating Binary Optimizers
言語
言語 eng
キーワード
主題Scheme Other
主題 [発表概要, Unrefereed Presentatin Abstract]
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
IBM Research - Tokyo
著者所属
IBM Canada Software Lab - Toronto
著者所属
IBM Research - Tokyo
著者所属
IBM United Kingdom Limited
著者所属
IBM Research - Tokyo
著者所属(英)
en
IBM Research - Tokyo
著者所属(英)
en
IBM Canada Software Lab - Toronto
著者所属(英)
en
IBM Research - Tokyo
著者所属(英)
en
IBM United Kingdom Limited
著者所属(英)
en
IBM Research - Tokyo
著者名 Motohiro, Kawahito

× Motohiro, Kawahito

Motohiro, Kawahito

Search repository
Reid, Copeland

× Reid, Copeland

Reid, Copeland

Search repository
Toshihiko, Koju

× Toshihiko, Koju

Toshihiko, Koju

Search repository
David, Siegwart

× David, Siegwart

David, Siegwart

Search repository
Moriyoshi, Ohara

× Moriyoshi, Ohara

Moriyoshi, Ohara

Search repository
著者名(英) Motohiro, Kawahito

× Motohiro, Kawahito

en Motohiro, Kawahito

Search repository
Reid, Copeland

× Reid, Copeland

en Reid, Copeland

Search repository
Toshihiko, Koju

× Toshihiko, Koju

en Toshihiko, Koju

Search repository
David, Siegwart

× David, Siegwart

en David, Siegwart

Search repository
Moriyoshi, Ohara

× Moriyoshi, Ohara

en Moriyoshi, Ohara

Search repository
論文抄録
内容記述タイプ Other
内容記述 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%.
論文抄録(英)
内容記述タイプ Other
内容記述 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%.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA11464814
書誌情報 情報処理学会論文誌プログラミング(PRO)

巻 14, 号 1, p. 15-15, 発行日 2021-01-27
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7802
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-19 18:32:46.612971
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3