Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Metamodel Matching for Automatic Model Transformation Generation
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Towards Automated, Formal Verification of Model Transformations
ICST '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification and Validation
MoDELS'05 Proceedings of the 2005 international conference on Satellite Events at the MoDELS
DSLTrans: a turing incomplete transformation language
SLE'10 Proceedings of the Third international conference on Software language engineering
On validation of ATL transformation rules by transformation models
Proceedings of the 8th International Workshop on Model-Driven Engineering, Verification and Validation
On verifying ATL transformations using 'off-the-shelf' SMT solvers
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Verification of ATL transformations using transformation models and model finders
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Towards a model transformation intent catalog
Proceedings of the First Workshop on the Analysis of Model Transformations
Verification of Model Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We present in this paper a technique for proving properties about model transformations. The properties we are concerned about relate the structure of an input model with the structure of the transformed model. The main highlight of our approach is that we are able to prove the properties for all models, i.e. the transformation designer may be certain about the structural soundness of the results of his/her transformations. In order to achieve this we have designed and experimented with a transformation model checker, which builds what we call a state space for a transformation. That state space is then used as in classical model checking to prove the property or, in case the property does not hold to produce a counterexample. If the property holds this information can be used as a certification for the transformation, otherwise the counterexample can be used as debug information during the transformation design process.