Enforcing QVT-R with mu-calculus and games

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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.
Original languageEnglish
Title of host publicationFundamental Approaches to Software Engineering
Subtitle of host publication16th International Conference, FASE 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings
EditorsVittorio Cortellessa, Dániel Varró
PublisherSpringer-Verlag GmbH
Pages282-296
Number of pages15
Volume7793
ISBN (Electronic)978-3-642-37057-1
ISBN (Print)978-3-642-37056-4
DOIs
Publication statusPublished - 2013

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
Volume7793
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Enforcing QVT-R with mu-calculus and games'. Together they form a unique fingerprint.

Cite this