{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00216197","sets":["6164:6165:9654:10851"]},"path":["10851"],"owner":"44499","recid":"216197","title":["A Representation of Tree Matching and Rewriting for Model Transformation"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-01-28"},"_buckets":{"deposit":"0ce55eb3-9259-460e-9a39-03d9b7535a2d"},"_deposit":{"id":"216197","pid":{"type":"depid","value":"216197","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"A Representation of Tree Matching and Rewriting for Model Transformation","author_link":["557932","557931","557930","557929"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Representation of Tree Matching and Rewriting for Model Transformation"},{"subitem_title":"A Representation of Tree Matching and Rewriting for Model Transformation","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2022-01-28","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Tokyo City University Yokohama Campus"},{"subitem_text_value":"Tokyo City University Yokohama Campus"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo City University Yokohama Campus","subitem_text_language":"en"},{"subitem_text_value":"Tokyo City University Yokohama Campus","subitem_text_language":"en"}]},"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/216197/files/IPSJ-APRIS2021021.pdf","label":"IPSJ-APRIS2021021.pdf"},"date":[{"dateType":"Available","dateValue":"2024-01-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-APRIS2021021.pdf","filesize":[{"value":"1.4 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"42"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2d2c75d5-be89-425a-aa63-9bfc2aab71c0","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuki, Hirano"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Nobuhiko, Ogura"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuki, Hirano","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Nobuhiko, Ogura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"This study proposes a simple representation of tree processing for model transformation. System development with model transformation often processes the definition part of behavior and scope in the model. Even though models are typically represented by graphs, in such cases , tree processing is required. However, the notation of tree processing tends to be complicated because of the problem that recursion and complex conditional branching are required. To reduce such difficulty, we propose a simplified representation of tree bonding, constructing and matching for model transformation. With these attempts, tree processing can be written in short notation like processing to other data structures such as strings or lists. Also, that improves the efficiency and maintainability of model transformation.","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This study proposes a simple representation of tree processing for model transformation. System development with model transformation often processes the definition part of behavior and scope in the model. Even though models are typically represented by graphs, in such cases , tree processing is required. However, the notation of tree processing tends to be complicated because of the problem that recursion and complex conditional branching are required. To reduce such difficulty, we propose a simplified representation of tree bonding, constructing and matching for model transformation. With these attempts, tree processing can be written in short notation like processing to other data structures such as strings or lists. Also, that improves the efficiency and maintainability of model transformation.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"99","bibliographic_titles":[{"bibliographic_title":"Proceedings of Asia Pacific Conference on Robot IoT System Development and Platform"}],"bibliographicPageStart":"98","bibliographicIssueDates":{"bibliographicIssueDate":"2022-01-28","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2021"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":216197,"updated":"2025-01-19T15:53:45.268106+00:00","links":{},"created":"2025-01-19T01:16:54.497198+00:00"}