Tadaaki Kirishima

Generation of UML package diagrams based on an attribute graph grammar

Abstract Graphical representations are often used in software design and development because of their expressiveness. So far, various graphical program description languages have been reported. The Unified Modeling Language (UML), developed for modeling in software development was proposed recently, and in 2005 was standardized as the ISO/IEC 19501 standard. Some tools for drawing UML diagrams have been proposed in recent years. However, it is hard for developers to draw UML diagrams using the UML tool because diagram layouts generally should be manually adjusted. Of course, there are tools that can automatically provide layout diagrams, though, sometimes such functions provide unexpected layouts. In order to automate the drawing of these graphical representations aesthetically, a syntax for program diagrams must first be defined. We propose a framework for specifying these diagrams using a graph grammar, and a syntax-directed editor based on the graph grammar.

Automatic Generation of SVG Program Documents with Animation Based on Attribute Graph Grammars

We have been developing a software development environment using the program diagram “Hichart”. In our research, we have implemented a graphical editor for Hichart. We add new features and capabilities to the editor, including calculation of a cyclomatic complexity and generation of SVG files for a given Hichart diagram. In this paper, we present a method of automatically generating a SVG file for a given program diagram based on attribute graph grammars. The thus obtained SVG file can animate a process of calculating a cyclomatic complexity of a given Hichart diagram on any readily available Web browsers. We also describe an automatic generation of a SVG file which can be displayed when diagrams are aesthetically drawn.

An Attribute Graph Grammar Enabling Narrower Drawings of Trees

Visualizing information has been one of the main subjects of study in the computer field. Representing objects with diagrams is one approach to visualizing information and its effectiveness has widely been recognized. Thus far, many graph-drawing algorithms have been proposed. Several authors have studied the problem of producing tidy drawings of binary trees – drawings that are aesthetically pleasing and of minimum width. A number of aesthetics has been proposed. We extend this problem to that of general trees in this paper and give an attribute graph grammar that corresponds to general trees. Finally, we propose an application of this grammar.

O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams

We investigate sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we present efficient algorithms that provide narrower placement satisfying given amorphous conditions. In intractable conditions, we propose a constraint-based algorithm for drawing tree-structured diagrams with a minimum-width by limiting the number of cells. Our results provide a criterion for deciding under given conditions, whether to use procedural or constraint-based algorithms to draw a tree-structured diagram.

A Transducing System Between Hichart and XC on a Visual Software Development Environment

In recent years, embedded systems have been widely used in various fields. However, the development burden of embedded systems tends to be high because they are complex. A visual development environment is one way to reduce this burden. We have already proposed a visual programming development environment for program diagrams called Hichart. In this paper, we describe a visual development environment for the XC language, which is a programming language for XMOS evaluation boards.

A graph grammar for entity relationship diagrams

Databases are mainly used in many systems in order to store data. Databases in large scale systems are difficult to grasp their logical structure, therefore, visualizing databases are quite important. To the present entity relationship diagrams (ER diagrams) have been proposed and used in designing and managing databases. However there are not so many tools which are based on formal mechanisms. In this paper, we propose a graph grammar for entity relationship diagrams which are based on formal mechanisms by using graph grammars. We also describe an application of the grammar.

Optimality and Complexity for Drawing Problems of Tree-Structured Diagrams

We investigated sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we presented efficient algorithms that provide narrower placement satisfying given amorphous conditions. In this paper we review our these previous results regarding with sets of constraints for tidily drawing TSDs, efficient algorithms which produce minimum width drawings of TSDs while satisfying certain constraints and NP-completeness of drawing problems of TSDs. Then we discuss the relation among constraints and the optimality with respect to the widths of drawing TSDs. Finally we indicate a key constraint which is not only for obtaining the optimality but also for the practical uses.