Modelling and analysis using GROOVE
In this paper we present case studies that describe how the graph transformation tool groove
has been used to model problems from a wide variety of domains. These case studies …
has been used to model problems from a wide variety of domains. These case studies …
[PDF][PDF] A language description is more than a metamodel
A Kleppe - Fourth international workshop on software language …, 2007 - research.utwente.nl
Within the context of (software) language engineering, language descriptions are
considered first class citizens. One of the ways to describe languages is by means of a …
considered first class citizens. One of the ways to describe languages is by means of a …
Essay on semantics definition in MDE. An instrumented approach for model verification
In the context of MDE (Model-Driven Engineering), our objective is to define the semantics
for a given DSL (Domain Specific Language) either to simulate its models or to check …
for a given DSL (Domain Specific Language) either to simulate its models or to check …
A design pattern to build executable DSMLs and associated V&V tools
B Combemale, X Crégut… - 2012 19th Asia-Pacific …, 2012 - ieeexplore.ieee.org
Model executability is now a key concern in model-driven engineering, mainly to support
early validation and verification (V&V). Some approaches allow to weave executability into …
early validation and verification (V&V). Some approaches allow to weave executability into …
A graph-transformation-based simulation approach for analysing aspect interference on shared join points
Aspects that in isolation behave correctly, may interact when being combined. When
interaction changes an aspect's behaviour or disables an aspect, we call this interference …
interaction changes an aspect's behaviour or disables an aspect, we call this interference …
Showing full semantics preservation in model transformation-a comparison of techniques
Abstract Model transformation is a prime technique in modern, model-driven software
design. One of the most challenging issues is to show that the semantics of the models is not …
design. One of the most challenging issues is to show that the semantics of the models is not …
Explicit state model checking for graph grammars
A Rensink - Concurrency, Graphs and Models: Essays Dedicated to …, 2008 - Springer
In this paper we present the philosophy behind the GROOVE project, in which graph
transformation is used as a modelling formalism on top of which a model checking approach …
transformation is used as a modelling formalism on top of which a model checking approach …
Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs
Inheritance is an important and widely spread concept enabling the elegant expression of
hierarchy in object-oriented software programs or models. It has been defined for graphs …
hierarchy in object-oriented software programs or models. It has been defined for graphs …
Graph transformations for object-oriented refinement
An object-oriented program consists of a section of class declarations and a main method.
The class declaration section represents the structure of an object-oriented program, that is …
The class declaration section represents the structure of an object-oriented program, that is …
Nested quantification in graph transformation rules
A Rensink - International Conference on Graph Transformation, 2006 - Springer
In this paper we describe a way to integrate Taentzer's rule amalgamation with the recently
proposed notions of nested graph conditions. The resulting so-called quantified graph …
proposed notions of nested graph conditions. The resulting so-called quantified graph …