{"created":"2021-03-01T05:52:58.454331+00:00","id":1259,"links":{},"metadata":{"_buckets":{"deposit":"9ccc0825-3ffe-4313-a017-0aa517970565"},"_deposit":{"id":"1259","owners":[],"pid":{"revision_id":0,"type":"depid","value":"1259"},"status":"published"},"_oai":{"id":"oai:repository.nii.ac.jp:00001259","sets":["136"]},"author_link":[],"control_number":"1259","item_5_biblio_info_30":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2009-07-09","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"14","bibliographicPageStart":"1","bibliographic_titles":[{"bibliographic_title":"NIIテクニカル・レポート","bibliographic_titleLang":"ja"},{"bibliographic_title":"NII Technical Report","bibliographic_titleLang":"en"}]}]},"item_5_description_28":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Reynolds' separation logical system for pointer program verification is investigated. This paper proves its completeness theorem as well as the expressiveness theorem of Peano arithmetic language for the system under the standard interpretation. This paper also introduces the predicate that represents the next new cell, and proves the completeness and the soundness of the extended system under deterministic semantics.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_5_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.20736/0000001259","subitem_identifier_reg_type":"JaLC"}]},"item_5_publisher_31":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"国立情報学研究所","subitem_publisher_language":"ja"}]},"item_5_source_id_32":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1346-5597","subitem_source_identifier_type":"ISSN"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"龍田, 真","creatorNameLang":"ja"},{"creatorName":"Tatsuta, Makoto","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Chin, Wei-Ngan","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Ameen, Mahmudul Faisal Al","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-03-12"}],"displaytype":"detail","filename":"09-013E.pdf","filesize":[{"value":"253.4 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"NII Technical Report (NII-2009-013E)：Completeness of Pointer Program Verification by Separation Logic","url":"https://repository.nii.ac.jp/record/1259/files/09-013E.pdf"},"version_id":"36ad564e-0274-4845-a08f-3306e33fbe0e"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"テクニカルレポート","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"Technical Report","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"NII Technical Report (NII-2009-013E)：Completeness of Pointer Program Verification by Separation Logic","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"NII Technical Report (NII-2009-013E)：Completeness of Pointer Program Verification by Separation Logic","subitem_title_language":"en"}]},"item_type_id":"5","owner":"1","path":["136"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2019-03-12"},"publish_date":"2019-03-12","publish_status":"0","recid":"1259","relation_version_is_last":true,"title":["NII Technical Report (NII-2009-013E)：Completeness of Pointer Program Verification by Separation Logic"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-06T08:33:15.652346+00:00"}