Reusable Idioms and Patterns in Graph Transformation Languages | Zendy

Aditya Agrawal | Zendy; Attila Vizhanyo | Zendy; Zsolt Kalmar | Zendy; Shi Feng | Zendy; Anantha Narayanan | Zendy; Gábor Karsai | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Reusable Idioms and Patterns in Graph Transformation Languages

Author(s) -

Aditya Agrawal,

Attila Vizhanyo,

Zsolt Kalmar,

Shi Feng,

Anantha Narayanan,

Gábor Karsai

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.12.035

Subject(s) - graph rewriting , computer science , programming language , graph , software design pattern , transformation (genetics) , software engineering , software development , model transformation , theoretical computer science , software design , software , artificial intelligence , consistency (knowledge bases) , biochemistry , chemistry , gene

oftware engineering tools based on Graph Transformation techniques are becoming available, but their practical applicability is somewhat reduced by the lack of idioms and design patterns. Idioms and design patterns provide prototypical solutions for recurring design problems in software engineering, but their use can be easily extended into software development using graph transformation systems. In this paper we briefly present a simple graph transformation language: GReAT, and show how typical design problems that arise in the context of model transformations can be solved using its constructs. These solutions are similar to software design patterns, and intend to serve as the starting point for a more complete collection

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research