Towards rigorously faking bidirectional model transformations
Christopher M. Poskitt, Mike Dodds, Richard F. Paige, Arend Rensink · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · 2014
Abstract. Bidirectional model transformations (bx) are mechanisms for auto-matically restoring consistency between multiple concurrently modified models. They are, however, challenging to implement; many model transformation lan-guages not supporting them at all. In this paper, we propose an approach for automatically obtaining the consistency guarantees of bx without the complex-ities of a bx language. First, we show how to “fake ” true bidirectionality using pairs of unidirectional transformations and inter-model consistency constraints in Epsilon. Then, we propose to automatically verify that these transformations are consistency preserving—thus indistinguishable from true bx—by defining trans-lations to graph rewrite rules and nested conditions, and leveraging recent proof calculi for graph transformation verification. 1