Transformation-based operationalization of graph languages

Abstract

Graph Languages emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found for querying [1][2], in-place transforming [3][4], and translating graph structures [5][6]. Still, new graph languages supporting different paradigms and usage scenarios are proposed regularly. In fact, languages tailored for a dedicated application domain can be restricted to a concise and clear syntax representation, thus reducing effort to learn and apply them. Effectively aiding the development of graph languages, even though considering the already existing ones, therefore remains an important working topic. © 2008 Springer-Verlag Berlin Heidelberg.