{"date_updated":"2022-01-06T06:58:43Z","type":"journal_article","publication":"Computer Languages, Systems & Structures","language":[{"iso":"eng"}],"_id":"290","title":"Grammar-based model transformations: Definition, execution, and quality properties","department":[{"_id":"77"}],"user_id":"477","citation":{"ieee":"G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations: Definition, execution, and quality properties,” <i>Computer Languages, Systems &#38; Structures</i>, pp. 116–138, 2015.","ama":"Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition, execution, and quality properties. <i>Computer Languages, Systems &#38; Structures</i>. 2015:116-138. doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>","mla":"Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” <i>Computer Languages, Systems &#38; Structures</i>, Elsevier, 2015, pp. 116–38, doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>.","apa":"Besova, G., Steenken, D., &#38; Wehrheim, H. (2015). Grammar-based model transformations: Definition, execution, and quality properties. <i>Computer Languages, Systems &#38; Structures</i>, 116–138. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>","bibtex":"@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations: Definition, execution, and quality properties}, DOI={<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>}, journal={Computer Languages, Systems &#38; Structures}, publisher={Elsevier}, author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015}, pages={116–138} }","short":"G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems &#38; Structures (2015) 116–138.","chicago":"Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” <i>Computer Languages, Systems &#38; Structures</i>, 2015, 116–38. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>."},"status":"public","year":"2015","author":[{"last_name":"Besova","full_name":"Besova, Galina","first_name":"Galina"},{"first_name":"Dominik","full_name":"Steenken, Dominik","last_name":"Steenken"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573","first_name":"Heike"}],"publisher":"Elsevier","doi":"10.1016/j.cl.2015.05.003","file":[{"file_size":1329478,"creator":"florida","date_updated":"2018-03-21T09:22:03Z","date_created":"2018-03-21T09:22:03Z","relation":"main_file","content_type":"application/pdf","access_level":"closed","file_name":"290-BSW15-main.pdf","file_id":"1464","success":1}],"page":"116-138","ddc":["040"],"file_date_updated":"2018-03-21T09:22:03Z","date_created":"2017-10-17T12:41:48Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"Model transformation is a key concept in model-driven software engineering. The definition of model transformations is usually based on meta-models describing the abstract syntax of languages. While meta-models are thereby able to abstract from uperfluous details of concrete syntax, they often loose structural information inherent in languages, like information on model elements always occurring together in particular shapes. As a consequence, model transformations cannot naturally re-use language structures, thus leading to unnecessary complexity in their development as well as in quality assurance.In this paper, we propose a new approach to model transformation development which allows to simplify the developed transformations and improve their quality via the exploitation of the languages׳ structures. The approach is based on context-free graph grammars and transformations defined by pairing productions of source and target grammars. We show that such transformations have important properties: they terminate and are sound, complete, and deterministic."}]}