@article{EhrigGolasHabeletal.2014,
  author    = {Ehrig, Hartmut and Golas, Ulrike and Habel, Annegret and Lambers, Leen and Orejas, Fernando},
  title     = {M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation},
  series = {Mathematical structures in computer science : a journal in the applications of categorical, algebraic and geometric methods in computer science},
  volume    = {24},
  journal   = {Mathematical structures in computer science : a journal in the applications of categorical, algebraic and geometric methods in computer science},
  number    = {4},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {0960-1295},
  doi       = {10.1017/S0960129512000357},
  pages     = {48},
  year      = {2014},
  abstract  = {Nested application conditions generalise the well-known negative application conditions and are important for several application domains. In this paper, we present Local Church-Rosser, Parallelism, Concurrency and Amalgamation Theorems for rules with nested application conditions in the framework of M-adhesive categories, where M-adhesive categories are slightly more general than weak adhesive high-level replacement categories. Most of the proofs are based on the corresponding statements for rules without application conditions and two shift lemmas stating that nested application conditions can be shifted over morphisms and rules.},
  language  = {en}
}
@article{GieseHildebrandtLambers2014,
  author    = {Giese, Holger and Hildebrandt, Stephan and Lambers, Leen},
  title     = {Bridging the gap between formal semantics and implementation of triple graph grammars},
  series = {Software and systems modeling},
  volume    = {13},
  journal   = {Software and systems modeling},
  number    = {1},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {1619-1366},
  doi       = {10.1007/s10270-012-0247-y},
  pages     = {273 -- 299},
  year      = {2014},
  abstract  = {The correctness of model transformations is a crucial element for model-driven engineering of high-quality software. A prerequisite to verify model transformations at the level of the model transformation specification is that an unambiguous formal semantics exists and that the implementation of the model transformation language adheres to this semantics. However, for existing relational model transformation approaches, it is usually not really clear under which constraints particular implementations really conform to the formal semantics. In this paper, we will bridge this gap for the formal semantics of triple graph grammars (TGG) and an existing efficient implementation. While the formal semantics assumes backtracking and ignores non-determinism, practical implementations do not support backtracking, require rule sets that ensure determinism, and include further optimizations. Therefore, we capture how the considered TGG implementation realizes the transformation by means of operational rules, define required criteria, and show conformance to the formal semantics if these criteria are fulfilled. We further outline how static and runtime checks can be employed to guarantee these criteria.},
  language  = {en}
}