Abstract: Techniques for the verification of structural invariants in graph transfor-mation systems typically rely on the derivation of negative application conditions that are attached to graph transformation rules in order to avoid the runtime occur-rence of forbidden structural patterns in the system model. In this paper, we propose a practical approach for this derivation process, which produces the required neg-ative 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 construc-tion of invalid and redundant negative application conditions
Abstract. In this paper we describe a way to integrate Taentzer’s rule amalgama-tion with the recent...
In this paper we describe a way to integrate Taentzer’s rule amalgamation with the recently proposed...
Abstract: Graph transformations have been used to model services and systems where rules describe pr...
Techniques for the verification of structural invariants in graph transformation systems typically r...
Graph rewriting is gaining credibility in the model transformation field, and tools are increasingly...
Abstract: In several rule-based applications using graph transformation as under-lying modeling tech...
This paper develops methods to reason about graph transformation rules for proving the preservation ...
We introduce a new class of graph transformation systems in which rewrite rules can be guarded by un...
Graph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-ba...
Abstract. The goal of this paper is the generalization of embedding and confluence results for graph...
In several application areas, Graph Transformation Systems (GTSs) are equipped with Negative Applica...
International audienceWe aim at assisting developers to write, in a Hoare style, provably correct gr...
Proceedings of: Third International Conference on Model Transformation (ICMT 2010): Theory and Pract...
The verification of systems with respect to a desired set of behavioural properties is a crucial ste...
We propose a framework for the verification of behavioural properties of systems modelled as graph t...
Abstract. In this paper we describe a way to integrate Taentzer’s rule amalgama-tion with the recent...
In this paper we describe a way to integrate Taentzer’s rule amalgamation with the recently proposed...
Abstract: Graph transformations have been used to model services and systems where rules describe pr...
Techniques for the verification of structural invariants in graph transformation systems typically r...
Graph rewriting is gaining credibility in the model transformation field, and tools are increasingly...
Abstract: In several rule-based applications using graph transformation as under-lying modeling tech...
This paper develops methods to reason about graph transformation rules for proving the preservation ...
We introduce a new class of graph transformation systems in which rewrite rules can be guarded by un...
Graph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-ba...
Abstract. The goal of this paper is the generalization of embedding and confluence results for graph...
In several application areas, Graph Transformation Systems (GTSs) are equipped with Negative Applica...
International audienceWe aim at assisting developers to write, in a Hoare style, provably correct gr...
Proceedings of: Third International Conference on Model Transformation (ICMT 2010): Theory and Pract...
The verification of systems with respect to a desired set of behavioural properties is a crucial ste...
We propose a framework for the verification of behavioural properties of systems modelled as graph t...
Abstract. In this paper we describe a way to integrate Taentzer’s rule amalgama-tion with the recent...
In this paper we describe a way to integrate Taentzer’s rule amalgamation with the recently proposed...
Abstract: Graph transformations have been used to model services and systems where rules describe pr...