Techniques for the verification of structural invariants in graph transformation systems typically rely on the derivation of negative application conditions that are attached to graph transformation rules in order to avoid the runtime occurrence of forbidden structural patterns in the system model. In this paper, we propose a practical approach for this derivation process, which produces the required negative application conditions by applying higher order graph transformation on the rule specifications themselves. Additionally, we integrate filtering criteria into these higher order constructs to avoid already at an early stage the unnecessary construction of invalid and redundant rules with negative application conditions
Abstract: In several rule-based applications using graph transformation as under-lying modeling tech...
The verification of systems with respect to a desired set of behavioural properties is a crucial ste...
Triple Graph Grammars are a well-established, formal and intuitive concept for the specification and...
Abstract: Techniques for the verification of structural invariants in graph transfor-mation systems ...
International audienceWe report in this paper a method for proving that a graph transformation is pr...
This paper develops methods to reason about graph transformation rules for proving the preservation ...
In several rule-based applications using graph transformation as underlying modeling technique the f...
Graph rewriting is gaining credibility in the model transformation field, and tools are increasingly...
Model transformations are a key concept for modular and distributed model driven development. In thi...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-13688-7_4Proc...
Proceedings of: Third International Conference on Model Transformation (ICMT 2010): Theory and Pract...
In several application areas, Graph Transformation Systems (GTSs) are equipped with Negative Applica...
Model transformations are a key concept for modular and distributed model driven development. In thi...
Graph transformations have been used to model services and systems where rules describe pre and post...
Abstract: In several rule-based applications using graph transformation as under-lying modeling tech...
The verification of systems with respect to a desired set of behavioural properties is a crucial ste...
Triple Graph Grammars are a well-established, formal and intuitive concept for the specification and...
Abstract: Techniques for the verification of structural invariants in graph transfor-mation systems ...
International audienceWe report in this paper a method for proving that a graph transformation is pr...
This paper develops methods to reason about graph transformation rules for proving the preservation ...
In several rule-based applications using graph transformation as underlying modeling technique the f...
Graph rewriting is gaining credibility in the model transformation field, and tools are increasingly...
Model transformations are a key concept for modular and distributed model driven development. In thi...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-13688-7_4Proc...
Proceedings of: Third International Conference on Model Transformation (ICMT 2010): Theory and Pract...
In several application areas, Graph Transformation Systems (GTSs) are equipped with Negative Applica...
Model transformations are a key concept for modular and distributed model driven development. In thi...
Graph transformations have been used to model services and systems where rules describe pre and post...
Abstract: In several rule-based applications using graph transformation as under-lying modeling tech...
The verification of systems with respect to a desired set of behavioural properties is a crucial ste...
Triple Graph Grammars are a well-established, formal and intuitive concept for the specification and...