Derivations in Object-Oriented Graph Grammars
| Autor: | Leila Ribeiro, Ana Paula Lüdtke Ferreira |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Computer science
Symmetric graph Comparability graph law.invention Combinatorics Coxeter graph symbols.namesake law Line graph Clique-width Lattice graph Graph property Complement graph Universal graph Forbidden graph characterization Graph rewriting Null model Voltage graph Graph theory Directed graph Intersection graph Graph Planar graph Modular decomposition Algebra symbols Topological graph theory Null graph Partially ordered set Graph product |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783540232070 ICGT |
| DOI: | 10.1007/978-3-540-30203-2_29 |
| Popis: | This work aims to extend the algebraic single-pushout approach to graph transformation to model object-oriented systems structures and computations. Graphs whose sets of nodes and edges are partially ordered are used to model the class hierarchy of an object-oriented system, making the inheritance and overriding relations explicit. Graphs typed over such structures are then used to model systems of objects, whose behaviour is given by an object-oriented graph grammar. It will be shown how the derivations which arise from those grammars are compatible with the way object-oriented programs are defined and executed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|