Recursive checkonly QVT-R transformations with general when and where clauses via the modal mu calculus

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

Citing 2
Cited 3

Verification and validation of declarative model-to-model transformations through invariants

Journal of Systems and Software
A simple game-theoretic approach to checkonly QVT Relations

Software and Systems Modeling (SoSyM)

Linguistic foundations for bidirectional transformations: invited tutorial

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Enforcing QVT-R with mu-calculus and games

FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Implementing QVT-R bidirectional model transformations using alloy

FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In earlier work we gave a game-based semantics for checkonly QVT-R transformations. We restricted when and where clauses to be conjunctions of relation invocations only, and like the OMG standard, we did not consider cases in which a relation might (directly or indirectly) invoke itself recursively. In this paper we show how to interpret checkonly QVT-R --- or any future model transformation language structured similarly --- in the modal mu calculus and use its well-understood model-checking game to lift these restrictions. The interpretation via fixpoints gives a principled argument for assigning semantics to recursive transformations. We demonstrate that a particular class of recursive transformations must be ruled out due to monotonicity considerations. We demonstrate and justify a corresponding extension to the rules of the QVT-R game.