Skip to main content
Conference ProceedingsOPEN ACCESS

Enforcing QVT-R with mu-calculus and games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7793 LNCS 282-296
DOI: 10.1007/978-3-642-37057-1_21
10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Bradfield, J., & Stevens, P. (2013). Enforcing QVT-R with mu-calculus and games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7793 LNCS, pp. 282–296). https://doi.org/10.1007/978-3-642-37057-1_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free