@ARTICLE{EEEHT07,
  title = {{Information Preserving Bidirectional Model Transformations}},
  author = {{Hartmut} {Ehrig} and {Karsten} {Ehrig} and {Claudia} {Ermel} and {Frank} {Hermann} and {Gabriele} {Taentzer}},
  journal = {Proceedings Fundamental Approaches to Software Engineering (FASE)},
  abstract = {Within model-driven software development, model transformation has become a key activity. It refers to a variety of operations modifying a model for various purposes such as analysis, optimization, and code generation. Most of these transformations need to be bidirectional to e.g. report analysis results, or keep coherence between models. In several application-oriented papers it has been shown that triple graph grammars are a promising approach to bidirectional model transformations. But up to now, there is no formal result showing under which condition corresponding forward and backward transformations are inverse to each other in the sense of information preservation. This problem is solved in this paper based on general results for the theory of algebraic graph transformations. The results are illustrated by a transformation of class models to relational data base models which has become a quasi standard example for model transformation.},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {4422},
  year = {2007},
  url = {http://tfs.cs.tu-berlin.de/publikationen/Papers07/EEE+07.pdf},
  institution = {University of Leicester},
  keywords = {graph pattern matching, graph transformation, model transformation, typed attributed graph transformation},
  month = {April},
  partner = {ULEICES},
  school = {University of Leicester},
  status = {public},
  task = {T1.1, T7.1},
}