One of the problems of documenting software evolution appears with the extensive use of refactorings. This paper explores a method, based on graph transformation, to detect wether the evolution between two versions of a software system can be expressed by means of a sequence of refactoring operations. For this purpose we extend a graph representation format to use it for simple Java programs, a...

Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics (LTS). While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general. Hence, the goal of this article is to obtain a compositional semantics for graph transformation system in analogy to the structural operational se...

In recent years, design patterns gain more interest in software engineering communities for both software development and maintenance. As a template to solve a certain recurring problem, a design pattern documents successful experiences of software experts and gradually becomes the design guidelines of software development. Applying design patterns correctly can improve the efficiency of softwa...

An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is semantically correct if for each simulation run of the source system we find a corresponding simulation run in the target system. Analogously, we have semantical completeness, if for each simulation run of the target system we find a corresponding simulation run...

Hypergraph transformation systems are examples of M -adhesive transformation systems based on M -adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simulation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper ...

ATL is a language for describing model transformations currently in uni-direction. In our previous work we have shown that transformations of graph structures given in some form can be bidirectionalized and have implemented a system called GRoundTram system for bidirectional graph transformations. We say a transformation t is bidirectionalized when we obtain a backward transformation t′ so that...

Tropos is an agent-oriented methodology that covers software development from early requirements analysis to detailed design, allowing for a deeper understanding of the operational environment of the new software system. In earlier work we have characterized the process of early requirements analysis in terms of transformation applications. In this paper we redefine the Tropos analysis process ...

Chemical reactions can be represented as graph transformations. Fundamental concepts that relate organic chemistry to graph rewriting, and an introduction to the SMILES chemical graph specification language are presented. The utility of both deduction and unordered finite rewriting over chemical graphs and chemical graph transformations, is suggested. The authors hope that this paper will provi...

Dynamic graphs are useful objects to describe a network which evolves over time. We propose a signal theory approach to analyze them which consists of transforming the graph at each time step into a collection of signals and analyze these signals using spectral decomposition. An inverse transformation is also proposed and makes it possible to reduce the dimension of the graph and select the mos...

We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are specified by a contextfree graph grammar. The technique is based on the approximation of graph transformation systems by Petri nets and on semilinear sets of markings. Especially we exploit Parikh’s theorem which says that...