A Graph-based Semantics For Object-oriented Programming Constructs

Authors:
Ana Paula Lüdtke Ferreira;Leila Ribeiro
Affiliations:
Universidade do Vale do Rio dos Sinos -- UNISINOS, São Leopoldo, RS, Brazil;Universidade Federal do Rio Grande do Sul -- UFRGS, Porto Alegre, RS, Brazil
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 10
Cited 1

On understanding types, data abstraction, and polymorphism

ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Organizing programs without classes

Lisp and Symbolic Computation
Algebraic properties of program integration

ESOP '90 Selected papers from the symposium on 3rd European symposium on programming
Parallel and distributed derivations in the single-pushout approach

Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach

Handbook of graph grammars and computing by graph transformation
Modeling concurrent, mobile and coordinated systems via graph transformations

Handbook of graph grammars and computing by graph transformation
On Partially Ordered Graph Grammars

Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Graph rewriting with unification and composition

Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Object-Oriented Programming Versus Abstract Data Types

Proceedings of the REX School/Workshop on Foundations of Object-Oriented Languages
Graph-grammars: An algebraic approach

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)

Using rule overriding to improve reusability and understandability of Dynamic Meta Modeling specifications

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a graph-based formalism for object-oriented class structure specifications. The formalism combines labelled graphs with partial orders, to adequately model the (single) inheritance relation among objects and the overriding relation between methods within derived classes. The semantics of system extension by inheritance and aggregation is then defined as colimits in a suitable category of object-oriented system specifications and their morphisms.