Nouveaux points de coupure et primitives pour les préoccupations de renforcement de sécurité

LAUR Repository

Show simple item record

dc.contributor.author Mourad, Azzam
dc.contributor.author Laverdiere, Marc-André
dc.contributor.author Soeanu, Andrei
dc.contributor.author Debbabi, Mourad
dc.date.accessioned 2015-11-25T10:30:29Z
dc.date.available 2015-11-25T10:30:29Z
dc.date.copyright 2009
dc.date.issued 2016-05-19
dc.identifier.issn 0752-4072 en_US
dc.identifier.uri http://hdl.handle.net/10725/2685
dc.description.abstract In this paper, we present two new pointcuts and two new Primitives to AspectOriented Programming (AOP) languages that are needed for systematic hardening of security concerns. The two proposed pointcuts allow to identify particular join points in a program’s control flow graph (CFG). The first one is the GAFlow, 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 one is the GDFlow, the Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcuts of interest. The two proposed primitives are called exportParameter and importParameter and are used to pass parameters between two pointcuts. They allow to analyze a program’s call graph in order to determine how to change function signatures for the passing of parameters associated with a given security hardening. We find these pointcuts and primitives to be necessary because they are needed to perform many security hardening practices and, to the best of our knowledge, none of the existing ones can provide their functionalities. Moreover, we show the viability and correctness of our proposed pointcuts and primitives by elaborating and implementing their algorithms and presenting the results of explanatory case studies. en_US
dc.language.iso fr en_US
dc.title Nouveaux points de coupure et primitives pour les préoccupations de renforcement de sécurité en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 200904853 en_US
dc.author.woa N/A en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.relation.journal Technique et science informatiques en_US
dc.journal.volume 28 en_US
dc.journal.issue 5 en_US
dc.article.pages 611-644 en_US
dc.identifier.doi http://dx.doi.org/10.3166/tsi.28.611-644 en_US
dc.identifier.ctation Mourad, A., Laverdière, M. A., Soeanu, A., & Debbabi, M. (2009). Nouveaux points de coupure et primitives pour les préoccupations de renforcement de sécurité.Technique et science informatiques, 28(5), 611-644. en_US
dc.author.email azzam.mourad@lau.edu.lb
dc.identifier.url https://www.semanticscholar.org/paper/Nouveaux-points-de-coupure-et-primitives-pour-les-Mourad-Laverdi%C3%A8re/267be63d171a63595acfcd2c8ff2cee1be2f0e9e
dc.orcid.id https://orcid.org/0000-0001-9434-5322

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account