Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus [chapter]

Julian Bradfield, Perdita Stevens
2012 Lecture Notes in Computer Science  
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
more » ... ift 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.
doi:10.1007/978-3-642-28872-2_14 fatcat:xt7ud4mzd5bnfcgdvn6kih5lra