Title
Expressing component-relating aspects with graph tansformations Expressing component-relating aspects with graph tansformations
Author
Faculty/Department
Faculty of Sciences. Mathematics and Computer Science
Publication type
article
Publication
Subject
Computer. Automation
Source (journal)
Applications of graph transformations with industrial relevance
Source (book)
2nd International Workshop Applications of Graph Transformation with, Industrial Relevance (AGTIVE 2003), SEP 27-OCT 01, 2003, Charlottesville, VA
Volume/pages
3062(2003) , p. 149-162
ISBN
3-540-22120-4
ISI
000222212300011
Carrier
E
Target language
English (eng)
Full text (Publishers DOI)
Affiliation
University of Antwerp
Abstract
Aspect Oriented Programming (see [3]) is an attempt to deal with so-called cross-cutting concerns and the tangled code that often results from them. The aim of this paper is to explore the possibility of developing a lightweight rule-based representation of aspects, enabling one to discuss and reason about aspects at a high level of abstraction. It is shown, for a concrete example, that aspects can be represented by graph transformation systems, and that the extension of a base program by an aspect can be viewed as a composition of graph transformation systems. We focus on aspects that do not modify the base program's behavior, but that can only allow or disallow its execution. We elaborate on an aspect concerning synchronization, after which we discuss ways to generalize our approach to other aspects, and to situations where several aspects are combined.
E-info
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000222212300011&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000222212300011&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
Handle