{"created":"2025-01-18T22:58:45.536022+00:00","updated":"2025-01-22T17:56:44.145127+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00028720","sets":["1164:2240:2241:2246"]},"path":["2246"],"owner":"1","recid":"28720","title":["BDDを利用したＣプログラムのfield-sensitiveなポインタ解析"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-03-05"},"_buckets":{"deposit":"69d17bef-e582-4b55-89a7-3d5f8895d3ec"},"_deposit":{"id":"28720","pid":{"type":"depid","value":"28720","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"BDDを利用したＣプログラムのfield-sensitiveなポインタ解析","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"BDDを利用したＣプログラムのfield-sensitiveなポインタ解析"},{"subitem_title":"Field-sensitive Points-to Analysis for C Programs using BDDs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2008-03-05","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京工業大学大学院'情報理工学研究科数理・計算科学専攻"},{"subitem_text_value":"東京工業大学大学院'情報理工学研究科数理・計算科学専攻　　"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Dept. of Mathematical and Computing Sciences, Tokyo Institute of Tecnology","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Mathematical and Computing Sciences, Tokyo Institute of Tecnology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/28720/files/IPSJ-HPC08114023.pdf"},"date":[{"dateType":"Available","dateValue":"2010-03-05"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC08114023.pdf","filesize":[{"value":"450.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":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"3513c53a-0078-4c9c-8b69-31633a5f5fcd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"吉羽, 和之"},{"creatorName":"佐々, 政孝"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuyuki, Yoshiba","creatorNameLang":"en"},{"creatorName":"Masataka, Sassa","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10463942","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"精度の高いポインタ解析は、プログラムの最適化を行う上で重要である。しかし、精度の高い解析や大きいプログラムを対象とした解析はコストが大きくなる。本論文ではfield-sensitiveなポインタ解析を定式化した。field-sensitiveな解析は構造体の各メンバを区別して扱うので精度の良い結果を得ることができる。しかし、それによって解析で扱う集合が大きくなり、メモリ使用量や解析時間が増大することが考えられる。そこで、WhaleyらがJava言語を対象にして行った研究を参考にし、集合の表現にBDDを用いたfield-sensitiveなポインタ解析を実装し実験を行った。その結果、BDDを使うことでメモリ使用量を減らすことでき、素朴な集合を用いては解析できないプログラムも解析できることを示すことができた。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A precise points-to analysis is important for program optimizations. However, the costs for the precise analysis and the analysis for large programs are high. In this paper, we formalize a fieldsensitive points-to analysis. Because field-sensitive analysis treats members of structure independently, a precise result can be obtained. However, it is thought that as the set treated by the analysis grows, the memory usage and analysis time increase. Then, referring to the research of Whaley targeted to the Java language, we implemented and experimented a field-sensitive points-to analysis using BDDs to represent sets. As a result, we show that the memory usage decreases and programs that cannot be analyzed by using simple sets can be analyzed by using BDDs.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"138","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"133","bibliographicIssueDates":{"bibliographicIssueDate":"2008-03-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"19(2008-HPC-114)","bibliographicVolumeNumber":"2008"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":28720,"links":{}}