Term graph rewriting
D Plump - Handbook Of Graph Grammars And Computing By …, 1999 - World Scientific
Term graph rewriting is concerned with the representation of functional expressions as
graphs, and the evaluation of these expressions by rule-based graph transformation …
graphs, and the evaluation of these expressions by rule-based graph transformation …
A tutorial on graph transformation
Graph transformation or graph rewriting has been developed for nearly 50 years and has
become a mature and manifold formal technique. Basically, rewrite rules are used to …
become a mature and manifold formal technique. Basically, rewrite rules are used to …
AGG: A graph transformation environment for modeling and validation of software
G Taentzer - International workshop on applications of graph …, 2003 - Springer
AGG is a general development environment for algebraic graph transformation systems
which follows the interpretative approach. Its special power comes from a very flexible …
which follows the interpretative approach. Its special power comes from a very flexible …
Correctness of high-level transformation systems relative to nested conditions
A Habel, KH Pennemann - Mathematical Structures in Computer …, 2009 - cambridge.org
In this paper we introduce the notions of nested constraints and application conditions, short
nested conditions. For a category associated with a graphical representation such as …
nested conditions. For a category associated with a graphical representation such as …
Algebraic approaches to graph transformation–part II: Single pushout approach and comparison with double pushout approach
H Ehrig, R Heckel, M Korff, M Löwe… - Handbook Of Graph …, 1997 - World Scientific
The algebraic approaches to graph transformation are based on the concept of gluing of
graphs corresponding to pushouts in suitable categories of graphs and graph morphisms …
graphs corresponding to pushouts in suitable categories of graphs and graph morphisms …
Adhesive categories
S Lack, P Sobociński - … Conference on Foundations of Software Science …, 2004 - Springer
We introduce adhesive categories, which are categories with structure ensuring that
pushouts along monomorphisms are well-behaved. Many types of graphical structures used …
pushouts along monomorphisms are well-behaved. Many types of graphical structures used …
Adhesive and quasiadhesive categories
S Lack, P Sobociński - RAIRO-Theoretical Informatics and …, 2005 - cambridge.org
We introduce adhesive categories, which are categories with structure ensuring that
pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories …
pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories …
Graph transformation for specification and programming
M Andries, G Engels, A Habel, B Hoffmann… - Science of Computer …, 1999 - Elsevier
The framework of graph transformation combines the potentials and advantages of both,
graphs and rules, to a single computational paradigm. In this paper we present some recent …
graphs and rules, to a single computational paradigm. In this paper we present some recent …
String diagram rewrite theory I: Rewriting with Frobenius structure
String diagrams are a powerful and intuitive graphical syntax, originating in theoretical
physics and later formalised in the context of symmetric monoidal categories. In recent …
physics and later formalised in the context of symmetric monoidal categories. In recent …
The k-component architecture meta-model for self-adaptive software
Software architectures have recently emerged as a level of design concerned with
specifying the overall structure of a system. Traditionally, software architectures only provide …
specifying the overall structure of a system. Traditionally, software architectures only provide …