Method for automatically designing a program structure

Claim 3

A method for automatically designing a program structure in accordance with claim 1, wherein said first step comprises the steps of: mapping the descriptive elements having the characteristics of sets described in said program specification and the descriptive elements defining the calculation method with vertices and drawing arcs based on the descriptive elements defining the calculation method between said vertices, thereby preparing a directed graph, and analyzing said prepared directed graph in view of the characteristics of sets and mappings and global characteristics of the directed graph and detecting arcs and vertices where flows of execution timing of the calculation synchronize and arcs and vertices where flows of execution timing of the calculation do not synchronize, second step comprises the steps of: assigning a data area capable of storing only one data belonging to each of the sets to each of the vertices where the flows of execution timing of the calculation synchronize out of the vertices mapped with the descriptive elements having the characteristics of sets, and assigning a data area capable of storing all data belonging to each of the sets to each of the vertices where the flows of execution timing do not synchronize, thereby defining the data structure, and dividing the directed graph into connective directed sub-graphs so that the vertices where the flows of execution timing do not synchronize are boundary vertices of the sub-graphs, the vertices where the flows of execution timing synchronize are internal vertices of the sub-graphs and the arcs where the flows of execution timing synchronize connected through a vertex are included in the same sub-graph, assigning procedure blocks to the respective sub-graphs, and assigning procedures to the respective vertices, thereby defining the procedural structure.

Claim 4

A method for automatically designing a program structure in accordance with claim 1, wherein the descriptive elements having the characteristics of sets include entity types, relationship types and data types, and attributes are defined for the respective entity types, said descriptive elements having the characteristics of mappings include relationship types, and said descriptive elements for defining said calculation method include constraints.

Claim 5

A method for automatically designing a program structure in accordance with claim 3, wherein said first step comprises the steps of: mapping, with vertices, the entity types, the attributes, the relationship types, the data types and the constraints described in said program specification, and drawing arcs based on the constraints between the vertices, thereby preparing a directed graph, and analyzing said prepared directed graph in view of the characteristics of sets and mappings and global characteristics of the directed graph, and detecting the arcs and vertices where the flows of execution timing of the constraint synchronize and the arcs and vertices where the flows of execution timing do not synchronize, said second step comprises the steps of: assigning a data area capable of storing only one of entities, attribute values, relationships or data to each of the vertices where the flows of said execution timing synchronize out of the vertices of the entity types, the attributes, the relationship types and the data types, and assigning a data area capable of storing all of entities of the same type, all of values of the same attribute, all of relationships of the same type or all of data of the same type to each of the vertices where the flows of said execution timing do not synchronize, thereby defining the data structure, and dividing the directed graph into connective directed sub-graphs so that the vertices where the flows of said execution timing do not synchronize are boundary vertices of the sub-graphs, the vertices where the flows of said execution timing synchronize are internal vertices of the sub-graphs, and the arcs where the flows of said execution timing synchronize connected through a vertex are included in the same sub-graph, assigning procedure blocks to the respective sub-graphs, and assigning procedures to the respective vertices, thereby defining the procedural structure.