{"created":"2023-05-15T12:35:12.215655+00:00","id":124,"links":{},"metadata":{"_buckets":{"deposit":"c4b472e5-f113-4822-8f08-a738615c9c6e"},"_deposit":{"created_by":2,"id":"124","owners":[2],"pid":{"revision_id":0,"type":"depid","value":"124"},"status":"published"},"_oai":{"id":"oai:kutarr.kochi-tech.ac.jp:00000124","sets":["5"]},"author_link":["445","447","446","448"],"item_2_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2002-10-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicPageEnd":"973","bibliographicPageStart":"961","bibliographicVolumeNumber":"J85-D1","bibliographic_titles":[{"bibliographic_title":"電子情報通信学会論文誌. D, 情報・システム = The IEICE transactions on information and systems"}]}]},"item_2_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"本論文では，一般に再帰を含むプログラムに対して情報フローを効率良く解析する手法を示す．この手法において，データの機密度を表すセキュリティレベルは任意の有限分配束によって与えることができる．本論文では，提案する情報フロー解析法の健全性を証明し，このアルゴリズムがプログラムの記述長の3乗のオーダで実行できることを示す．更に，引数内の情報を隠すことができるような関数を適切に導入できるように，合同関係を用いてアルゴリズムを拡張する．最後に，試作システムを用いて提案アルゴリズムを実行した結果を紹介する．","subitem_description_type":"Abstract"}]},"item_2_publisher_35":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会"}]},"item_2_relation_44":{"attribute_name":"関係URI","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"http://search.ieice.org/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://search.ieice.org/","subitem_relation_type_select":"URI"}}]},"item_2_rights_14":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"©2002電子情報通信学会(IEICE)"}]},"item_2_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12099634","subitem_source_identifier_type":"NCID"}]},"item_2_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0915-1915","subitem_source_identifier_type":"ISSN"}]},"item_2_version_type_18":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"國信, 茂太"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"高田, 喜朗"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"関, 浩之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"井上, 克郎"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-02-13"}],"displaytype":"detail","filename":"IEICE_J85-D1_10_961.pdf","filesize":[{"value":"394.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"IEICE_J85-D1_10_961.pdf","url":"https://kutarr.kochi-tech.ac.jp/record/124/files/IEICE_J85-D1_10_961.pdf"},"version_id":"4a6a7227-c7a5-4dc5-ba02-7a3c7358263b"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"情報フロー解析","subitem_subject_scheme":"Other"},{"subitem_subject":"セキュリティクラス（SC）","subitem_subject_scheme":"Other"},{"subitem_subject":"不動点計算","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"束構造をもつセキュリティクラスに基づく再帰的プログラムに対する情報フロー解析法","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"束構造をもつセキュリティクラスに基づく再帰的プログラムに対する情報フロー解析法"}]},"item_type_id":"2","owner":"2","path":["5"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-06-23"},"publish_date":"2011-06-23","publish_status":"0","recid":"124","relation_version_is_last":true,"title":["束構造をもつセキュリティクラスに基づく再帰的プログラムに対する情報フロー解析法"],"weko_creator_id":"2","weko_shared_id":-1},"updated":"2023-05-15T13:44:07.251027+00:00"}