Skip to main content
Conference ProceedingsOPEN ACCESS

Polymorphic single-pushout graph transformation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8411 LNCS 355-369
DOI: 10.1007/978-3-642-54804-8_25
3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The paper extends single-pushout graph transformation by polymorphism, a key concept in object-oriented design. The notions sub-rule and remainder, well-known in single-pushout rewriting, are applied in order to model dynamic rule extension and type dependent rule application. This extension mechanism qualifies graph transformation as a modelling technique for extendable frameworks. Therefore, it contributes to the applicability of graph transformation in software engineering. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Löwe, M., König, H., & Schulz, C. (2014). Polymorphic single-pushout graph transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8411 LNCS, pp. 355–369). Springer Verlag. https://doi.org/10.1007/978-3-642-54804-8_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free