{"_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"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "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"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "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_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": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers"}]}, "item_10_rights_12": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "Copyright (C) 1995 IEICE"}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "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": "ISSN"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "YAMAMOTO, Shuichiro"}], "nameIdentifiers": [{"nameIdentifier": "41321", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "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_free", "mimetype": "application/pdf", "size": 641400.0, "url": {"label": "506.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/13122/files/506.pdf"}, "version_id": "8731516b-4f95-45a6-a117-0260c76f0779"}]}, "item_keyword": {"attribute_name": "\u30ad\u30fc\u30ef\u30fc\u30c9", "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": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "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": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Reconstructing Data Flow Diagrams from Structure Charts Based on the Input and Output Relationship"}]}, "item_type_id": "10", "owner": "1", "path": ["682/683/684"], "permalink_uri": "http://hdl.handle.net/2237/15017", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "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": null}