Detecting and resolving ambiguities caused by inter-dependent introductions

Havinga, Wilke; Nágy, I.; Bergmans, Lodewijk; Akşit, Mehmet

doi:10.1145/1119655.1119684

Cited by 14 publications

(12 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Possibly, aspect interference may occur. This problem is known as weaving of aspects at shared join points [7]. Usually, a solution requires some policy of ordering of the aspect weaving.…”

Section: Example: Controlling Aspect Weaving At Shared Join Pointsmentioning

confidence: 99%

Application of reflection in a model transformation language

Kurtev

2009

Softw Syst Model

View full text Add to dashboard Cite

Computational reflection is a well-known technique applied in many existing programming languages ranging from functional to object-oriented languages. In this paper we study the possibilities and benefits of introducing and using reflection in a rule-based model transformation language. The paper identifies some language abstractions to achieve structural and behavioral reflection. Reflective features are motivated by examples of problems derived from the experience with currently used transformation languages. Example solutions are given by using an experimental language with reflective capabilities. The paper also outlines possible implementation strategies for adding reflection to a language and discusses their advantages and disadvantages.

show abstract

“…Possibly, aspect interference may occur. This problem is known as weaving of aspects at shared join points [7]. Usually, a solution requires some policy of ordering of the aspect weaving.…”

Section: Example: Controlling Aspect Weaving At Shared Join Pointsmentioning

confidence: 99%

Application of reflection in a model transformation language

Kurtev

2009

Softw Syst Model

View full text Add to dashboard Cite

show abstract

“…A similar approach could be taken in CLOS. But on the other hand, previous work on CARMA [9] and other logic-based pointcut languages [21,10,25] has demonstrated the suitability of logic programming [17] as the basis for a pointcut language. Logic programming allows pointcuts to be written in a declarative style, without control loops and such, which in general is taken to make expressions in these languages easier to read (as Kowalski explained through his well-known equation "algorithm = logic + control" [18]).…”

Section: Logic Pointcuts Over Joinpoint Historiesmentioning

confidence: 99%

Modularizing crosscuts in an e-commerce application in Lisp using HALO

Herzeel

Gybels

Costanza

et al. 2007

Proceedings of the 2007 International Lisp Conference

View full text Add to dashboard Cite

Some program concerns cannot be cleanly modularized, and their implementation leads to code that is both hard to understand and maintain. In this paper we consider extending an e-commerce application, written in CLOS, with two of such crosscutting concerns. Though most of the time Common Lisp's macro facilities and CLOS' method combinations can be used to modularize crosscuts, we discuss the use of a more declarative solution when crosscuts depend on the execution history. For this purpose we give an overview of HALO, a novel pointcut language based on logic meta programming and temporal logic, which allows one to reason about program execution and (past) program state.

show abstract

“…In that approach, join points are represented as logic facts and pointcuts as logic queries over these facts. In this paper, we focus on how logic-based pointcut languages [13,21,14,27] can be combined with historybased and hybrid pointcuts. Most logic-based pointcut languages are based on Prolog, which uses backward chaining to evaluate logic queries.…”

Section: Introductionmentioning

confidence: 99%

Forward chaining in HALO: An implementation strategy for history-based logic pointcuts

Herzeel

Gybels

Costanza

et al. 2009

Computer Languages, Systems & Structures

View full text Add to dashboard Cite

In aspect-oriented programming, pointcuts are formulated as conditions over the context of dynamic events in the execution of a program. Hybrid pointcut languages also allow this context to come from interactions between the pointcut language and the base program. While some pointcut languages only allow conditions on the current execution event, more recent proposals have demonstrated the need for expressing conditions over a history of join points. Such pointcut languages require means to balance the expressiveness of the language with the additional memory and runtime overhead caused by keeping a history of join point context data. In this paper, we introduce a logic-based pointcut language that allows interaction with the base program as well as pointcuts over a history of join points. We introduce forward chaining as an implementation model for this language, and discuss possible optimization strategies for the additional overhead.

show abstract

Detecting and resolving ambiguities caused by inter-dependent introductions

Cited by 14 publications

References 5 publications

Application of reflection in a model transformation language

Application of reflection in a model transformation language

Modularizing crosscuts in an e-commerce application in Lisp using HALO

Forward chaining in HALO: An implementation strategy for history-based logic pointcuts

Contact Info

Product

Resources

About