The dataflow pointcut: a formal and practical framework

  • Authors:

  • Dima Alhadidi;Amine Boukhtouta;Nadia Belblidia;Mourad Debbabi;Prabir Bhattacharya

  • Affiliations:

  • Concordia University, Montreal, PQ, Canada;Concordia University, Montreal, PQ, Canada;Concordia University, Montreal, PQ, Canada;Concordia University, Montreal, PQ, Canada;Concordia University, Montreal, PQ, Canada

  • Venue:
  • Proceedings of the 8th ACM international conference on Aspect-oriented software development
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement such security concerns in aspect-oriented programming (AOP) languages. The pointcut identifies join points based on the origins of values. This paper presents a formal framework for this pointcut based on the λ_calculus. Dataflow tags are propagated statically to track data dependencies between expressions. We introduce a static semantics for tag propagation and prove that it is consistent with respect to the dynamic semantics of the propagation. We instrument the static effect-based type system to propagate tags, match and inject advices. This static approach can be used to minimize the cost of dataflow pointcuts by reducing the runtime overhead since much of the dataflow information would be available statically and at the same time it can be used for verification. The proposed semantics for advice weaving is in the spirit of AspectJ where advices are injected before, after, or around the join points that are matched by their respective pointcuts. Inspired from the formal framework, the AspectJ compiler ajc is extended with the dataflow pointcut that tracks data dependencies inside methods.