Adaptive Object-Oriented Software: The Demeter Method with Propagation Patterns
Adaptive Object-Oriented Software: The Demeter Method with Propagation Patterns
Graph Grammar Engineering with PROGRES
Proceedings of the 5th European Software Engineering Conference
On Edge Addition Rewrite Systems and their Relevance to Program Analysis
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Fowards a Generic Framework for AOP
ECOOP '98 Workshop ion on Object-Oriented Technology
Abstracting Object Interactions Using Composition Filters
ECOOP '93 Proceedings of the Workshop on Object-Based Distributed Programming
Proceedings of the International Workshop on Graph Transformations in Computer Science
How to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems
CC '96 Proceedings of the 6th International Conference on Compiler Construction
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Validated model transformation-driven software development
International Journal of Computer Applications in Technology
Analysis of Aspect-Oriented Model Weaving
Transactions on Aspect-Oriented Software Development V
A model-driven framework for aspect weaver construction
Transactions on aspect-oriented software development VIII
Describing horizontal model transformations with graph rewriting rules
MDAFA'03 Proceedings of the 2003 European conference on Model Driven Architecture: foundations and Applications
Term rewriting meets aspect-oriented programming
Processes, Terms and Cycles
An expressive aspect language for system applications with arachne
Transactions on Aspect-Oriented Software Development I
Confluence of aspects for sequence diagrams
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
This paper introduces GRS-based AOP which explains a large subclass of AOP weavers as graph rewrite systems (GRS). The corresponding class of AOP problems has a formal background since it inherits all features of graph rewrite systems such as criteria for termination, confluence, and unique normal forms. In particular, it it shown that different kinds of rewrite rules form different weaver classes. At least two of them (EARS and XGRS weavers) have simple semantics since they always yield unique weaving results.