Tool Modeling with Fujaba

AbstractThis paper is a small tutorial on tool building with Fujaba. With the help of a small case study, we exemplify how the different requirements of an environment for a visual language may be addressed using Fujaba graph transformations. This covers abstract and concrete syntax, static and operational semantics, and model transformations. This case study shows, how the more sophisticated language elements of Fujaba may be exploited in modeling complex aspects of the desired CASE tool. In addition, we address some not graph grammar related aspects in building such an environment, e.g. the graphical user interface and multi-user support

eDOBS - Graphical Debugging for Eclipse

This paper presents the eDOBS tool. eDOBS is the little brother of the Fujaba environment. While Fujaba is used to create graph grammar based specifications and programs, eDOBS is used to browse graphs, to edit graphs, and to execute graph transformations

How to Specify a Graph Transformation Approach A Meta Model for Fujaba1 1Research partially supported by the ESPRIT Working Group APPLIGRAPH and the TMR network GETGRATS.

AbstractApplication-oriented approaches to graph transformation provide structural features beyond vertices and edges, like composition in hierarchical graphs, inheritance in object-oriented graphs, multiplicity constraints, etc.Often, these features have a specific dynamic interpretation which requires complex embedding mechanisms and context conditions. For example, the deletion of a compound node usually implies the deletion of its components.In this paper, we propose the use of a meta graph grammar for the definition of such a complex graph transformation approach. A meta graph grammar is a typed graph grammar whose type graph provides a static description of the structure of graphs, rules, and transformations of the approach. This static meta model, which is comparable to the meta model in the UML specification, is extended by a specification of the rule application operator by means of graphical embedding rules, i.e., the productions of the meta graph grammar. These embedding rules allow a concise visual description of the admissible context embeddings of a rule and of the side effects of the rule application on the context.As a case-study, a meta graph grammar for selected features of the object-oriented graph transformation approach Fujaba is given

A Heuristic for the Subgraph Isomorphism Problem in Executing PROGRES

The work reported here is part of the PROGRES (PROgrammed Graph Rewriting Systems) project. PROGRES is a very high level multi paradigm language for the specification of complex structured data types and their operations. The data structures are modelled as directed, attributed, node and edge labelled graphs (diane graphs). The basic programming constructs of PROGRES are graph rewriting rules (productions and tests) and derived relations on nodes (paths and restrictions). These basic operations may be combined to build partly imperative, partly rule based, complex graph transformations by special control structures which regard the nondeterministic nature of graph rewriting rules. In order to use PROGRES not only as a specification language but also for building rapid prototypes and even for the derivation of final implementations, we have to be able to execute PROGRES specifications efficiently. The central problem in executing a graph rewriting system is to match the left-hand side..