ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "30700da7-d0d2-46c3-b24e-3f946e3075b9"}, "_deposit": {"id": "19055", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "19055"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00019055", "sets": ["314"]}, "author_link": ["55648", "55649", "55650", "55651", "55652", "55653", "55654", "55655", "55656", "55657"], "item_10_alternative_title_19": {"attribute_name": "その他のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "Rewriting Induction for Constrained Term Rewriting Systems", "subitem_alternative_title_language": "en"}]}, "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2009-03", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "2", "bibliographicPageEnd": "96", "bibliographicPageStart": "80", "bibliographicVolumeNumber": "2", "bibliographic_titles": [{"bibliographic_title": "情報処理学会論文誌, プログラミング", "bibliographic_titleLang": "ja"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "帰納的定理の証明原理の 1 つである潜在帰納法が制約付き項書換え系に対応するように拡張され,命令型プログラムの等価性検証に応用されている.本論文では,別の証明原理である書換え帰納法を制約付き項書き換え系に対応するように拡張するとともに,その正しさを証明する.また,拡張された書換え帰納法に基づいた帰納的定理の証明法を提案する.さらに,帰納的定理でないことを示す反証の手法についても議論する. ", "subitem_description_language": "ja", "subitem_description_type": "Abstract"}, {"subitem_description": "The implicit induction, which is one of induction principles for proving inductive theorems of equational theories, has been extended to deal with constrained term rewriting systems. It has been applied to a method for proving equivalence of imperative programs. In this paper, we extend another induction principle, the rewriting induction, to cope with the case of constrained term rewriting systems, and show its correctness. We also propose a method for proving inductive theorems being based on the extended rewriting induction. Moreover, we show a technique to disprove inductive theorems.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://id.nii.ac.jp/1001/00060630/"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/21161"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "一般社団法人情報処理学会", "subitem_publisher_language": "ja"}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://id.nii.ac.jp/1001/00060630/", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof. All Rights Reserved, Copyright (C) Information Processing Society of Japan. Comments are welcome. Mail to address editj@ipsj.or.jp, please.", "subitem_rights_language": "ja"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0387-5806", "subitem_source_identifier_type": "PISSN"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "坂田, 翼", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55648", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "西田, 直樹", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55649", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "坂部, 俊樹", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55650", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "酒井, 正彦", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55651", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "草刈, 圭一朗", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55652", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakata, Tsubasa", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55653", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Nishida, Naoki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55654", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakabe, Toshiki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55655", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55656", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "KUSAKARI, Keiichirou", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55657", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-21"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "IPSJ-TPRO0202008.pdf", "filesize": [{"value": "342.4 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 342400.0, "url": {"label": "IPSJ-TPRO0202008.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/19055/files/IPSJ-TPRO0202008.pdf"}, "version_id": "2af16f22-74a4-41b5-9741-ab3daacc0a2c"}]}, "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": "制約付き項書換え系における書換え帰納法", "subitem_title_language": "ja"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/21161", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2015-01-29"}, "publish_date": "2015-01-29", "publish_status": "0", "recid": "19055", "relation": {}, "relation_version_is_last": true, "title": ["制約付き項書換え系における書換え帰納法"], "weko_shared_id": -1}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500a 雑誌掲載論文
  3. 学術雑誌

制約付き項書換え系における書換え帰納法

http://hdl.handle.net/2237/21161
http://hdl.handle.net/2237/21161
da0dceb6-1dd2-4590-ad26-382a203c0111
名前 / ファイル ライセンス アクション
IPSJ-TPRO0202008.pdf IPSJ-TPRO0202008.pdf (342.4 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2015-01-29
タイトル
タイトル 制約付き項書換え系における書換え帰納法
言語 ja
その他のタイトル
その他のタイトル Rewriting Induction for Constrained Term Rewriting Systems
言語 en
著者 坂田, 翼

× 坂田, 翼

WEKO 55648

ja 坂田, 翼

Search repository
西田, 直樹

× 西田, 直樹

WEKO 55649

ja 西田, 直樹

Search repository
坂部, 俊樹

× 坂部, 俊樹

WEKO 55650

ja 坂部, 俊樹

Search repository
酒井, 正彦

× 酒井, 正彦

WEKO 55651

ja 酒井, 正彦

Search repository
草刈, 圭一朗

× 草刈, 圭一朗

WEKO 55652

ja 草刈, 圭一朗

Search repository
Sakata, Tsubasa

× Sakata, Tsubasa

WEKO 55653

en Sakata, Tsubasa

Search repository
Nishida, Naoki

× Nishida, Naoki

WEKO 55654

en Nishida, Naoki

Search repository
Sakabe, Toshiki

× Sakabe, Toshiki

WEKO 55655

en Sakabe, Toshiki

Search repository
Sakai, Masahiko

× Sakai, Masahiko

WEKO 55656

en Sakai, Masahiko

Search repository
KUSAKARI, Keiichirou

× KUSAKARI, Keiichirou

WEKO 55657

en KUSAKARI, Keiichirou

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 ja
権利情報 ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof. All Rights Reserved, Copyright (C) Information Processing Society of Japan. Comments are welcome. Mail to address editj@ipsj.or.jp, please.
抄録
内容記述 帰納的定理の証明原理の 1 つである潜在帰納法が制約付き項書換え系に対応するように拡張され,命令型プログラムの等価性検証に応用されている.本論文では,別の証明原理である書換え帰納法を制約付き項書き換え系に対応するように拡張するとともに,その正しさを証明する.また,拡張された書換え帰納法に基づいた帰納的定理の証明法を提案する.さらに,帰納的定理でないことを示す反証の手法についても議論する.
言語 ja
内容記述タイプ Abstract
抄録
内容記述 The implicit induction, which is one of induction principles for proving inductive theorems of equational theories, has been extended to deal with constrained term rewriting systems. It has been applied to a method for proving equivalence of imperative programs. In this paper, we extend another induction principle, the rewriting induction, to cope with the case of constrained term rewriting systems, and show its correctness. We also propose a method for proving inductive theorems being based on the extended rewriting induction. Moreover, we show a technique to disprove inductive theorems.
言語 en
内容記述タイプ Abstract
出版者
言語 ja
出版者 一般社団法人情報処理学会
言語
言語 jpn
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
関連情報
関連タイプ isVersionOf
識別子タイプ URI
関連識別子 http://id.nii.ac.jp/1001/00060630/
ISSN
収録物識別子タイプ PISSN
収録物識別子 0387-5806
書誌情報 ja : 情報処理学会論文誌, プログラミング

巻 2, 号 2, p. 80-96, 発行日 2009-03
著者版フラグ
値 publisher
URI
識別子 http://id.nii.ac.jp/1001/00060630/
識別子タイプ URI
URI
識別子 http://hdl.handle.net/2237/21161
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 16:24:01.374093
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3