Contracts, games, and refinement
Information and Computation - Special issue on EXPRESS 1997
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Instant consistency checking for the UML
Proceedings of the 28th international conference on Software engineering
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
GUIDE: Games with UML for interactive design exploration
Knowledge-Based Systems
Translation of QVT Relations into QVT Operational Mappings
ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
Towards an Algebraic Theory of Bidirectional Transformations
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
A Landscape of Bidirectional Model Transformations
Generative and Transformational Techniques in Software Engineering II
A Simple Game-Theoretic Approach to Checkonly QVT Relations
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
Bidirectional Transformations: A Cross-Discipline Perspective
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
A systematic review of UML model consistency management
Information and Software Technology
Verification and validation of declarative model-to-model transformations through invariants
Journal of Systems and Software
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
A Petri Net Based Debugging Environment for QVT Relations
ASE '09 Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering
Algebraic specification of a model transformation engine
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
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
Hi-index | 0.00 |
The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where two (or more) models must be kept consistent in the face of changes to either or both. A QVT-R transformation can be used either in checkonly mode, to determine whether a target model is consistent with a given source model, or in enforce mode, to change the target model. A precise understanding of checkonly mode transformations is prerequisite to a precise understanding of enforce mode transformations, and this is the focus of this paper. In order to give semantics to checkonly QVT-R transformations, we need to consider the overall structure of the transformation as given by when and where clauses, and the role of trace classes. In the standard, the semantics of QVT-R are given both directly, and by means of a translation to QVT Core, a language which is intended to be simpler. In this paper, we argue that there are irreconcilable differences between the intended semantics of QVT-R and those of QVT Core, so that no translation from QVT-R to QVT Core can be semantics-preserving, and hence no such translation can be helpful in defining the semantics of QVT-R. Treating QVT-R directly, we propose a simple game-theoretic semantics. We demonstrate its behaviour on examples and show how it can be used to prove an example result comparing two QVT-R transformations. We demonstrate that consistent models may not possess a single trace model whose objects can be read as traceability links in either direction. We briefly discuss the effect of variations in the rules of the game, to elucidate some design choices available to the designers of the QVT-R language.