{"id":21432,"updated":"2025-01-22T21:19:34.614041+00:00","links":{},"created":"2025-01-18T22:53:22.777293+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00021432","sets":["1164:1384:1414:1418"]},"path":["1418"],"owner":"1","recid":"21432","title":["制限された動的情報を用いたブロック単位スライシング手法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-03-07"},"_buckets":{"deposit":"f04a9a2e-983d-45ac-9e21-5904cb5d7c59"},"_deposit":{"id":"21432","pid":{"type":"depid","value":"21432","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"制限された動的情報を用いたブロック単位スライシング手法の提案","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"制限された動的情報を用いたブロック単位スライシング手法の提案"},{"subitem_title":"A Block Slicing Method Using Lightweight Dynamic Information","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2002-03-07","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":"Graduate School of Engineering Science","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering Science","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/21432/files/IPSJ-SE01136010.pdf"},"date":[{"dateType":"Available","dateValue":"2004-03-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SE01136010.pdf","filesize":[{"value":"97.2 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":"12"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f95d794b-f916-4f3b-828d-dd49325b767e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 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":"Tomonori, Takada","creatorNameLang":"en"},{"creatorName":"Katsuro, Inoue","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112981","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":"大規模なプログラムのデバッグを行なう際，プログラム全体からバグがあると思われる部分を小さな範囲に限定することができれば作業効率が向上する．静的スライシングはプログラムから抽出したスライスが大きくなり，動的スライシングは実行オーバヘッドが大きくなるという問題がある．これまでに依存キャッシュスライシング手法の提案を行なったが，実際のデバッグ段階で使用するためにはさらにオーバヘッドを削減することが求められている．そこで，依存キャッシュスライシングのオーバヘッドを削減させたブロック単位スライシングの提案を行い，実行データの収集を行なった．この結果，は依存キャッシュスライシングに比べ約50%実行時オーバヘッドを削減することが可能であった．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"When we try to debug a large program effectively, it is very important to separate suspicious program portions from the overall source program. Static slicing sometimes produces a large portion of the source program, especially for a program with array and pointer variables. Dynamic slicing requires unacceptably huge run-time overhead. we proposed a dependence-cache slicing method which uses both static and dynamic information. However, the further reduction of the run-time overhead is required.  We propose a slicing method named a block slicing which can reduce the run-time overhead compared to a dependence-cache slicing, and execution data for sample programs have been collected. The result shows block slicing reduces the run-time overhead by about 50% from the dependence-cache slicing.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"78","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告ソフトウェア工学（SE） "}],"bibliographicPageStart":"71","bibliographicIssueDates":{"bibliographicIssueDate":"2002-03-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"23(2001-SE-136)","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}