Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Reconstructing Data Flow Diagrams from Structure Charts Based on the Input and Output Relationship Shuichiro YAMAMOTO Publication IEICE TRANSACTIONS on Information and Systems Vol.E78-D No.9 pp.1118-1126 Publication Date: 1995/09/25 Online ISSN: DOI: Print ISSN: 0916-8532 Type of Manuscript: Special Section PAPER (Special Issue on Knowledge Based Software Engineering) Category: Methodologies Keyword: structured analysis, reverse engineering, dataflow diagram, structured chart, diagram synthesis, Full Text: PDF(624.8KB)>>
Summary: 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 ouput 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. | ||||||||||
| ||||||||||