{"updated":"2025-01-21T08:56:10.114389+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00107876","sets":["6504:6505:7804"]},"path":["7804"],"owner":"6748","recid":"107876","title":["証明支援系を用いたMorrisの2分木走査アルゴリズムの実装の検証"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-03-02"},"_buckets":{"deposit":"a2cabc9b-a18d-4f7b-aed0-dc059974a00f"},"_deposit":{"id":"107876","pid":{"type":"depid","value":"107876","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"証明支援系を用いたMorrisの2分木走査アルゴリズムの実装の検証","author_link":["18739","18741","18738","18740"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"証明支援系を用いたMorrisの2分木走査アルゴリズムの実装の検証"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2011-03-02","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東工大"},{"subitem_text_value":"東工大"},{"subitem_text_value":"東工大"},{"subitem_text_value":"東工大"}]},"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/107876/files/IPSJ-Z73-6L-7.pdf"},"date":[{"dateType":"Available","dateValue":"2014-12-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-Z73-6L-7.pdf","filesize":[{"value":"216.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"fc9beeaf-91e8-4813-ab90-ff4010a3157f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山田一宏"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"森口草介"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"渡部卓雄"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"西崎真也"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"我々は，Morrisの2分木走査アルゴリズムのCによる実装を対象として，証明支援系を用いた正当性の検証を試みた．本論文はその手法と結果に関する報告である．Morrisのアルゴリズムは，ポインタの書き換えを行うことで再帰やスタックを用いずに2分木走査を行う方法のひとつである．また他のポインタ反転法と異なり節点に印を付けるためのビットを設ける必要もないのが特徴である．我々は，入力および走査結果についての仕様を事前・事後条件として与え，C用の検証支援ツールであるCaduceusによって検証条件を生成した．ループ不変条件は必要に応じて適宜与えた．生成された検証条件を自動検証ツールSimplifyおよび証明支援系Coqを用いて証明した．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"506","bibliographic_titles":[{"bibliographic_title":"第73回全国大会講演論文集"}],"bibliographicPageStart":"505","bibliographicIssueDates":{"bibliographicIssueDate":"2011-03-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2011"}]},"relation_version_is_last":true,"weko_creator_id":"6748"},"created":"2025-01-18T23:50:54.590103+00:00","id":107876,"links":{}}