Enforcing QVT-R with mu-calculus and games

Authors:
Julian Bradfield;Perdita Stevens
Affiliations:
School of Informatics, University of Edinburgh, UK;School of Informatics, University of Edinburgh, UK
Venue:
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Year:
2013

Citing 9
Cited 0

Translation of QVT Relations into QVT Operational Mappings

ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
15 Years of Triple Graph Grammars

ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Algebraic Models for Bidirectional Model Synchronization

MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Formal Support for QVT-Relations with Coloured Petri Nets

MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Reviving QVT Relations: Model-Based Debugging Using Colored Petri Nets

MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Correctness of model synchronization based on triple graph grammars

Proceedings of the 14th international conference on Model driven engineering languages and systems
Algebraic specification of a model transformation engine

FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Recursive checkonly QVT-R transformations with general when and where clauses via the modal mu calculus

FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
A simple game-theoretic approach to checkonly QVT Relations

Software and Systems Modeling (SoSyM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

QVT-R is the standard Object Management Group bidirectional transformation language. In previous work, we gave a precise game-theoretic semantics for the checkonly semantics of QVT-R transformations, including the recursive invocation of relations which is allowed and used, but not defined, by the QVT standard. In this paper, we take up the problem of enforce semantics, where the standard attempts formality, but at crucial points lapses into English. We show that our previous semantics can be extended to enforce mode, giving a precise semantics taking the standard into account.