Towards Rigorously Faking Bidirectional Model Transformations

Chris Poskitt; Mike Dodds; Richard Freeman Paige; Arend Rensink

Towards Rigorously Faking Bidirectional Model Transformations

Chris Poskitt, Mike Dodds, Richard Freeman Paige, Arend Rensink

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Bidirectional model transformations (bx) are mechanisms for automatically
restoring consistency between multiple concurrently modified models.
They are, however, challenging to implement; many model transformation languages
not supporting them at all. In this paper, we propose an approach for
automatically obtaining the consistency guarantees of bx without the complexities
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 translations
to graph rewrite rules and nested conditions, and leveraging recent proof
calculi for graph transformation verification.

Original language	English
Title of host publication	AMT 2014 - Analysis of Model Transformations Workshop Proceedings
Editors	Juergen Dingel, Juan de Lara, Levi Lucio, Hans Vangheluwe
Publisher	CEUR Workshop Proceedings
Pages	70-75
Volume	1277
Publication status	Published - 2014
Event	ACM/IEEE 17th International Conference on Model Driven Engineering Languages and Systems - Valencia, Spain Duration: 28 Sept 2014 → 3 Oct 2014

Publication series

Name	CEUR Workshop Proceedings
ISSN (Print)	1613-0073

Conference

Conference	ACM/IEEE 17th International Conference on Model Driven Engineering Languages and Systems
Country/Territory	Spain
City	Valencia
Period	28/09/14 → 3/10/14

Bibliographical note

Access to Document

AMT.14.models
© Authors 2014. This is an author produced version of a paper published in CEUR Workshop Proceedings. Uploaded in accordance with the publisher's self-archiving policy.
Accepted author manuscript, 320 KB

Cite this

@inproceedings{403558025d8d49549ff8999642257e82,

title = "Towards Rigorously Faking Bidirectional Model Transformations",

abstract = "Bidirectional model transformations (bx) are mechanisms for automaticallyrestoring consistency between multiple concurrently modified models.They are, however, challenging to implement; many model transformation languagesnot supporting them at all. In this paper, we propose an approach forautomatically obtaining the consistency guarantees of bx without the complexitiesof a bx language. First, we show how to “fake” true bidirectionality usingpairs of unidirectional transformations and inter-model consistency constraints inEpsilon. Then, we propose to automatically verify that these transformations areconsistency preserving—thus indistinguishable from true bx—by defining translationsto graph rewrite rules and nested conditions, and leveraging recent proofcalculi for graph transformation verification.",

author = "Chris Poskitt and Mike Dodds and Paige, {Richard Freeman} and Arend Rensink",

note = "{\textcopyright} Authors 2014. This is an author produced version of a paper published in CEUR Workshop Proceedings. Uploaded in accordance with the publisher's self-archiving policy.; ACM/IEEE 17th International Conference on Model Driven Engineering Languages and Systems ; Conference date: 28-09-2014 Through 03-10-2014",

year = "2014",

language = "English",

volume = "1277",

series = "CEUR Workshop Proceedings",

publisher = "CEUR Workshop Proceedings",

pages = "70--75",

editor = "Juergen Dingel and {de Lara}, Juan and Levi Lucio and Hans Vangheluwe",

booktitle = "AMT 2014 - Analysis of Model Transformations Workshop Proceedings",

}

Poskitt, C, Dodds, M , Paige, RF & Rensink, A 2014, Towards Rigorously Faking Bidirectional Model Transformations. in J Dingel, J de Lara, L Lucio & H Vangheluwe (eds), AMT 2014 - Analysis of Model Transformations Workshop Proceedings. vol. 1277, CEUR Workshop Proceedings, CEUR Workshop Proceedings, pp. 70-75, ACM/IEEE 17th International Conference on Model Driven Engineering Languages and Systems , Valencia, Spain, 28/09/14.

Towards Rigorously Faking Bidirectional Model Transformations. / Poskitt, Chris; Dodds, Mike ; Paige, Richard Freeman et al.
AMT 2014 - Analysis of Model Transformations Workshop Proceedings. ed. / Juergen Dingel; Juan de Lara; Levi Lucio; Hans Vangheluwe. Vol. 1277 CEUR Workshop Proceedings, 2014. p. 70-75 (CEUR Workshop Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Towards Rigorously Faking Bidirectional Model Transformations

AU - Poskitt, Chris

AU - Dodds, Mike

AU - Paige, Richard Freeman

AU - Rensink, Arend

N1 - © Authors 2014. This is an author produced version of a paper published in CEUR Workshop Proceedings. Uploaded in accordance with the publisher's self-archiving policy.

PY - 2014

Y1 - 2014

N2 - Bidirectional model transformations (bx) are mechanisms for automaticallyrestoring consistency between multiple concurrently modified models.They are, however, challenging to implement; many model transformation languagesnot supporting them at all. In this paper, we propose an approach forautomatically obtaining the consistency guarantees of bx without the complexitiesof a bx language. First, we show how to “fake” true bidirectionality usingpairs of unidirectional transformations and inter-model consistency constraints inEpsilon. Then, we propose to automatically verify that these transformations areconsistency preserving—thus indistinguishable from true bx—by defining translationsto graph rewrite rules and nested conditions, and leveraging recent proofcalculi for graph transformation verification.

AB - Bidirectional model transformations (bx) are mechanisms for automaticallyrestoring consistency between multiple concurrently modified models.They are, however, challenging to implement; many model transformation languagesnot supporting them at all. In this paper, we propose an approach forautomatically obtaining the consistency guarantees of bx without the complexitiesof a bx language. First, we show how to “fake” true bidirectionality usingpairs of unidirectional transformations and inter-model consistency constraints inEpsilon. Then, we propose to automatically verify that these transformations areconsistency preserving—thus indistinguishable from true bx—by defining translationsto graph rewrite rules and nested conditions, and leveraging recent proofcalculi for graph transformation verification.

M3 - Conference contribution

VL - 1277

T3 - CEUR Workshop Proceedings

SP - 70

EP - 75

BT - AMT 2014 - Analysis of Model Transformations Workshop Proceedings

A2 - Dingel, Juergen

A2 - de Lara, Juan

A2 - Lucio, Levi

A2 - Vangheluwe, Hans

PB - CEUR Workshop Proceedings

T2 - ACM/IEEE 17th International Conference on Model Driven Engineering Languages and Systems

Y2 - 28 September 2014 through 3 October 2014

ER -