Add to ORKGPreviously, we have developed the VerMTLr framework that allows rapid verifier construction for relational model transformation languages. VerMTLr draws on the Boogie intermediate verification language to systematically design a modular and reusable verifier. It also includes a modular formalisation of EMFTVM bytecode to ensure verifier soundness. In this work, we will illustrate how to adapt VerMTLr to design a verifier for the SimpleGT graph transformation language, which allows us to soundly prove the correctness of graph transformations. An experiment with the Pacman game demonstrates the feasibility of our approach
This paper presents an efficient solution for modeling checking graph transformation systems. The ap...
In model-based software development, a complete design and analysis process involves designing the s...
AbstractThis paper presents an efficient solution for modeling checking graph transformation systems...
Previously, we have developed the VerMTLr framework that allows rapid verifier construction for rel...
Model-driven engineering has been recognised as an effective way to manage the complexity of softwar...
Model-driven engineering has been recognised as an effective way to manage the complexity of softwa...
This tutorial paints a high-level picture of the concepts involved in verification of graph transfor...
International audienceWe present a prototype for executing and verifying graph transformations. The ...
With the increasing use of automatic transformations of models, the correctness of these transformat...
International audienceThis paper is concerned with the interplay of the expressiveness of model and ...
Abstract: With the increasing use of automatic transformations of models, the correctness of these t...
We report on the use of a formal verification tool for a graph-based transformation language in the ...
International audienceIn this paper we propose a method to derive OCL invariants from declarative mo...
The verification of systems with respect to a desired set of behavioural properties is a crucial ste...
In this paper we present the philosophy behind the GROOVE project, in which graph transformation is ...
This paper presents an efficient solution for modeling checking graph transformation systems. The ap...
In model-based software development, a complete design and analysis process involves designing the s...
AbstractThis paper presents an efficient solution for modeling checking graph transformation systems...
Previously, we have developed the VerMTLr framework that allows rapid verifier construction for rel...
Model-driven engineering has been recognised as an effective way to manage the complexity of softwar...
Model-driven engineering has been recognised as an effective way to manage the complexity of softwa...
This tutorial paints a high-level picture of the concepts involved in verification of graph transfor...
International audienceWe present a prototype for executing and verifying graph transformations. The ...
With the increasing use of automatic transformations of models, the correctness of these transformat...
International audienceThis paper is concerned with the interplay of the expressiveness of model and ...
Abstract: With the increasing use of automatic transformations of models, the correctness of these t...
We report on the use of a formal verification tool for a graph-based transformation language in the ...
International audienceIn this paper we propose a method to derive OCL invariants from declarative mo...
The verification of systems with respect to a desired set of behavioural properties is a crucial ste...
In this paper we present the philosophy behind the GROOVE project, in which graph transformation is ...
This paper presents an efficient solution for modeling checking graph transformation systems. The ap...
In model-based software development, a complete design and analysis process involves designing the s...
AbstractThis paper presents an efficient solution for modeling checking graph transformation systems...