Symbiosis in logic-based pointcuts over a history of join points

  • Authors:
  • Kris Gybels;Charlotte Herzeel;Theo D'Hondt

  • Affiliations:
  • Vrije Universiteit Brussel, Brussel, Belgium;Vrije Universiteit Brussel, Brussel, Belgium;Vrije Universiteit Brussel, Brussel, Belgium

  • Venue:
  • Proceedings of the 2008 ACM symposium on Applied computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Within aspect-oriented programming, the quality of aspect code depends on the readability and expressiveness of pointcut languages. Readability is increased by using specialized, declarative pointcut languages. For such languages, their expressiveness is increased if they offer an integration with the base code language. As has previously been shown, offering access to the past history of the base program also increases pointcut expressiveness. A logical desire then is creating pointcut languages that combine both features, but taken to the extreme this is not implementable. We discuss the unimplementable ideal model of declarative history-based logic pointcut languages, and the possible approximations that can be made that are still implementable and what limits they impose on the ideal expressiveness.