Logic-based Binding Time Analysis for Java Using Reaching Definitions

• Item type: Trans(1)
• 公開日: 2005-01-15
• タイトル: Logic-based Binding Time Analysis for Java Using Reaching Definitions
• タイトル / 言語: en
• タイトル: Logic-based Binding Time Analysis for Java Using Reaching Definitions
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 通常論文
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Fukuoka Laboratory for Emerging & Enabling Technology of SoC Fukuoka Industry Science & Technology Foundation Graduate School of Information Science and Electrical Engineering Kyushu University
• 著者所属: freelance
• 著者所属: Fukuoka Laboratory for Emerging & Enabling Technology of SoC Fukuoka Industry Science & Technology Foundation Graduate School of Information Science and Electrical Engineering Kyushu University
• 著者所属: Graduate School of Information Science and Electrical Engineering Kyushu University System LSI Research Center Kyushu University Computing and Communications Center Kyushu University
• 著者所属: Graduate School of Information Science and Electrical Engineering Kyushu University
• 著者所属: Graduate School of Information Science and Electrical Engineering Kyushu University Computing and Communications Center Kyushu University
• 著者所属(英): en
• 著者所属(英): Fukuoka Laboratory for Emerging & Enabling Technology of SoC, Fukuoka Industry, Science & Technology Foundation,Graduate School of Information Science and Electrical Engineering, Kyushu University
• 著者所属(英): en
• 著者所属(英): freelance
• 著者所属(英): en
• 著者所属(英): Fukuoka Laboratory for Emerging & Enabling Technology of SoC, Fukuoka Industry, Science & Technology Foundation,Graduate School of Information Science and Electrical Engineering, Kyushu University
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Science and Electrical Engineering, Kyushu University,System LSI Research Center, Kyushu University,Computing and Communications Center, Kyushu University,
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Science and Electrical Engineering, Kyushu University
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Science and Electrical Engineering, Kyushu University,Computing and Communications Center, Kyushu University
• 著者名: Susumu, Yamazaki; Takayuki, Kando; Michihiro, Matsumoto; Tsuneo, Nakanishi; Teruaki, Kitasuka; Akira, Fukuda
• 著者名(英): Susumu, Yamazaki; Takayuki, Kando; Michihiro, Matsumoto; Tsuneo, Nakanishi; Teruaki, Kitasuka; Akira, Fukuda
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: A recent trend in program development is the employment of generic software components such as libraries and frameworks. Typically however it is difficult to achieve both genericity and runtime execution efficiency simultaneously. Therefore many researchers have studied program specialization which is one technique to translate a generic program automatically into an efficient program specialized for a specific runtime environment. However it is very difficult to implement a system that can specialize practical applications. Although some possible reasons exist for the problem this paper focuses on the problems of instructiondependent processes. Each necessary analysis for existing program specializer systems must include instruction-dependent processes. Therefore not only does the code size of the specializer get larger but maintainability and reliability are also degraded. Then we propose a new algorithm of logic-based binding time analysis using reaching definitions analysis which is widely used among many other analyses. We also evaluate how this technique improves the implementation simplicity of binding time analyzer: the code size is reduced by about 10%. Especially instruction-dependent processes are almost entirely eliminated.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: A recent trend in program development is the employment of generic software components such as libraries and frameworks. Typically, however, it is difficult to achieve both genericity and runtime execution efficiency simultaneously. Therefore, many researchers have studied program specialization, which is one technique to translate a generic program automatically into an efficient program specialized for a specific runtime environment. However, it is very difficult to implement a system that can specialize practical applications. Although some possible reasons exist for the problem, this paper focuses on the problems of instructiondependent processes. Each necessary analysis for existing program specializer systems must include instruction-dependent processes. Therefore, not only does the code size of the specializer get larger, but maintainability and reliability are also degraded. Then, we propose a new algorithm of logic-based binding time analysis using reaching definitions analysis, which is widely used among many other analyses. We also evaluate how this technique improves the implementation simplicity of binding time analyzer: the code size is reduced by about 10%. Especially, instruction-dependent processes are almost entirely eliminated.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11464814
• 書誌情報: 情報処理学会論文誌プログラミング（PRO）; 巻 46, 号 SIG1(PRO24), p. 121-133, 発行日 2005-01-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7802
• 出版者 / 言語: ja
• 出版者: 情報処理学会