ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "95c88f34-3369-423d-aed4-58629e57facd"}, "_deposit": {"id": "13122", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "13122"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00013122", "sets": ["684"]}, "author_link": ["41321"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1995-09-20", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "9", "bibliographicPageEnd": "1126", "bibliographicPageStart": "1118", "bibliographicVolumeNumber": "E78-D", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on information and systems", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "The traceability of data flow diagrams against structure charts is very important for large software development. Specifying if there is a relationship between a data flow diagram and a structure chart is a time consuming task. Existing CASE tools provide a way to maintain traceability. If we can extract the input-output relationship of a system from a structure chart, the corresponding data flow diagram can be automatically generated from the relationship. For example, Benedusi et al. proposed a reverse engineering methodology to reconstruct a data flow diagram from existing code. The methodology develops a hierarchical data flow diagram from dependency relationships between the program variables. The methodology, however, transforms each module in structure charts into a process in data flow diagrams. The reconstructed diagrams may have different processes with the same name. This paper proposes a transformation algorithm that solves these problems. It analyzes the structure charts and extracts the input and output relationships, then determines how the set of outputs depends on the set of inputs for the data flow diagram process. After that, it produces a data flow diagram based on the include operation between the sets of output items. The major characteristics of the algorithm are that it is simple, because it only uses the basic operations of sets, it generates data flow diagrams with deterministic steps, and it can generate minimal data flow diagrams. This process will reduce the cost of traceability between data flow diagrams and structure charts.", "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://www.ieice.org/jpn/trans_online/index.html"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/15017"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers", "subitem_publisher_language": "en"}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://www.ieice.org/jpn/trans_online/index.html", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright (C) 1995 IEICE", "subitem_rights_language": "en"}]}, "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": "0916-8532", "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": "YAMAMOTO, Shuichiro", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41321", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "506.pdf", "filesize": [{"value": "641.4 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 641400.0, "url": {"label": "506.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/13122/files/506.pdf"}, "version_id": "8731516b-4f95-45a6-a117-0260c76f0779"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "structured analysis", "subitem_subject_scheme": "Other"}, {"subitem_subject": "reverse engineering", "subitem_subject_scheme": "Other"}, {"subitem_subject": "dataflow diagram", "subitem_subject_scheme": "Other"}, {"subitem_subject": "structured chart", "subitem_subject_scheme": "Other"}, {"subitem_subject": "diagram synthesis", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Reconstructing Data Flow Diagrams from Structure Charts Based on the Input and Output Relationship", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Reconstructing Data Flow Diagrams from Structure Charts Based on the Input and Output Relationship", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["684"], "permalink_uri": "http://hdl.handle.net/2237/15017", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2011-07-04"}, "publish_date": "2011-07-04", "publish_status": "0", "recid": "13122", "relation": {}, "relation_version_is_last": true, "title": ["Reconstructing Data Flow Diagrams from Structure Charts Based on the Input and Output Relationship"], "weko_shared_id": -1}
  1. M300 情報連携推進本部
  2. M300a 雑誌掲載論文
  3. 学術雑誌

Reconstructing Data Flow Diagrams from Structure Charts Based on the Input and Output Relationship

http://hdl.handle.net/2237/15017
http://hdl.handle.net/2237/15017
37ac4dde-40fe-4d39-99e7-32780ea91538
名前 / ファイル ライセンス アクション
506.pdf 506.pdf (641.4 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2011-07-04
タイトル
タイトル Reconstructing Data Flow Diagrams from Structure Charts Based on the Input and Output Relationship
言語 en
著者 YAMAMOTO, Shuichiro

× YAMAMOTO, Shuichiro

WEKO 41321

en YAMAMOTO, Shuichiro

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 en
権利情報 Copyright (C) 1995 IEICE
キーワード
主題Scheme Other
主題 structured analysis
キーワード
主題Scheme Other
主題 reverse engineering
キーワード
主題Scheme Other
主題 dataflow diagram
キーワード
主題Scheme Other
主題 structured chart
キーワード
主題Scheme Other
主題 diagram synthesis
抄録
内容記述 The traceability of data flow diagrams against structure charts is very important for large software development. Specifying if there is a relationship between a data flow diagram and a structure chart is a time consuming task. Existing CASE tools provide a way to maintain traceability. If we can extract the input-output relationship of a system from a structure chart, the corresponding data flow diagram can be automatically generated from the relationship. For example, Benedusi et al. proposed a reverse engineering methodology to reconstruct a data flow diagram from existing code. The methodology develops a hierarchical data flow diagram from dependency relationships between the program variables. The methodology, however, transforms each module in structure charts into a process in data flow diagrams. The reconstructed diagrams may have different processes with the same name. This paper proposes a transformation algorithm that solves these problems. It analyzes the structure charts and extracts the input and output relationships, then determines how the set of outputs depends on the set of inputs for the data flow diagram process. After that, it produces a data flow diagram based on the include operation between the sets of output items. The major characteristics of the algorithm are that it is simple, because it only uses the basic operations of sets, it generates data flow diagrams with deterministic steps, and it can generate minimal data flow diagrams. This process will reduce the cost of traceability between data flow diagrams and structure charts.
言語 en
内容記述タイプ Abstract
出版者
言語 en
出版者 Institute of Electronics, Information and Communication Engineers
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
関連情報
関連タイプ isVersionOf
識別子タイプ URI
関連識別子 http://www.ieice.org/jpn/trans_online/index.html
ISSN
収録物識別子タイプ PISSN
収録物識別子 0916-8532
書誌情報 en : IEICE transactions on information and systems

巻 E78-D, 号 9, p. 1118-1126, 発行日 1995-09-20
著者版フラグ
値 publisher
URI
識別子 http://www.ieice.org/jpn/trans_online/index.html
識別子タイプ URI
URI
識別子 http://hdl.handle.net/2237/15017
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 18:38:24.536728
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