Control Flow Based Pointcuts for Security Hardening Concerns [chapter]

Marc-André Laverdière, Azzam Mourad, Andrei Soeanu, Mourad Debbabi
IFIP International Federation for Information Processing  
In this paper, we present two new control flow based pointcuts to Aspect-Oriented Programming (AOP) languages that are needed for systematic hardening of security concerns. They allow to identify particular join points in a program's control flow graph (CFG). The first proposed primitive is the G A Flow, the closest guaranteed ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second proposed primitive is the GDFlow, the
more » ... losest guaranteed descendant, which returns the closest child join point that can be reached by all paths starting from the pointcuts of interest. We find these pointcuts to be necessary because they are needed to perform many security hardening practices and, to the best of our knowledge, none of the existing pointcuts can provide their functionalities. Moreover, we show the viabihty and correctness of our proposed pointcuts by elaborating and implementing their algorithms and presenting the results of a testing case study.
doi:10.1007/978-0-387-73655-6_20 dblp:conf/ifiptm/LaverdiereMSD07 fatcat:c75epgbvtbgddp7flryh645h5m