Forward Chaining in HALO - An Implementation Strategy for History-based Logic Pointcuts. Herzeel, C., Gybels, K., Costanza, P., De Roover, C., D'Hondt, T., Demeyer, S., & Perrot, J. Computer Languages, Systems and Structures, 35:31–47, Elsevier Limited, 4, 2009. Serge Demeyer and Jean-Francois Perrotabstract bibtex 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.
@article{1c314bb96f7f4f458a17154aa9424bf4,
title = "Forward Chaining in HALO - An Implementation Strategy for History-based Logic Pointcuts",
abstract = "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.",
keywords = "aspect-oriented programming, temporal logic, Common Lisp, RETE forward chaining",
author = "Charlotte Herzeel and Kris Gybels and Pascal Costanza and {De Roover}, Coen and Theo D'Hondt and Serge Demeyer and Jean-francois Perrot",
note = "Serge Demeyer and Jean-Francois Perrot",
year = "2009",
month = "4",
language = "English",
volume = "35",
pages = "31--47",
journal = "Computer Languages, Systems and Structures",
issn = "1477-8424",
publisher = "Elsevier Limited",
}
Downloads: 0
{"_id":"Ptfh2Jz97encxPgRn","bibbaseid":"herzeel-gybels-costanza-deroover-dhondt-demeyer-perrot-forwardchaininginhaloanimplementationstrategyforhistorybasedlogicpointcuts-2009","author_short":["Herzeel, C.","Gybels, K.","Costanza, P.","De Roover, C.","D'Hondt, T.","Demeyer, S.","Perrot, J."],"bibdata":{"bibtype":"article","type":"article","title":"Forward Chaining in HALO - An Implementation Strategy for History-based Logic Pointcuts","abstract":"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.","keywords":"aspect-oriented programming, temporal logic, Common Lisp, RETE forward chaining","author":[{"firstnames":["Charlotte"],"propositions":[],"lastnames":["Herzeel"],"suffixes":[]},{"firstnames":["Kris"],"propositions":[],"lastnames":["Gybels"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Costanza"],"suffixes":[]},{"propositions":[],"lastnames":["De Roover"],"firstnames":["Coen"],"suffixes":[]},{"firstnames":["Theo"],"propositions":[],"lastnames":["D'Hondt"],"suffixes":[]},{"firstnames":["Serge"],"propositions":[],"lastnames":["Demeyer"],"suffixes":[]},{"firstnames":["Jean-francois"],"propositions":[],"lastnames":["Perrot"],"suffixes":[]}],"note":"Serge Demeyer and Jean-Francois Perrot","year":"2009","month":"4","language":"English","volume":"35","pages":"31–47","journal":"Computer Languages, Systems and Structures","issn":"1477-8424","publisher":"Elsevier Limited","bibtex":"@article{1c314bb96f7f4f458a17154aa9424bf4,\n title = \"Forward Chaining in HALO - An Implementation Strategy for History-based Logic Pointcuts\",\n abstract = \"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.\",\n keywords = \"aspect-oriented programming, temporal logic, Common Lisp, RETE forward chaining\",\n author = \"Charlotte Herzeel and Kris Gybels and Pascal Costanza and {De Roover}, Coen and Theo D'Hondt and Serge Demeyer and Jean-francois Perrot\",\n note = \"Serge Demeyer and Jean-Francois Perrot\",\n year = \"2009\",\n month = \"4\",\n language = \"English\",\n volume = \"35\",\n pages = \"31--47\",\n journal = \"Computer Languages, Systems and Structures\",\n issn = \"1477-8424\",\n publisher = \"Elsevier Limited\",\n}","author_short":["Herzeel, C.","Gybels, K.","Costanza, P.","De Roover, C.","D'Hondt, T.","Demeyer, S.","Perrot, J."],"key":"1c314bb96f7f4f458a17154aa9424bf4","id":"1c314bb96f7f4f458a17154aa9424bf4","bibbaseid":"herzeel-gybels-costanza-deroover-dhondt-demeyer-perrot-forwardchaininginhaloanimplementationstrategyforhistorybasedlogicpointcuts-2009","role":"author","urls":{},"keyword":["aspect-oriented programming","temporal logic","Common Lisp","RETE forward chaining"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://soft.vub.ac.be/~cderoove/works.bib","dataSources":["abyQtmN3vDJoFXPPD"],"keywords":["aspect-oriented programming","temporal logic","common lisp","rete forward chaining"],"search_terms":["forward","chaining","halo","implementation","strategy","history","based","logic","pointcuts","herzeel","gybels","costanza","de roover","d'hondt","demeyer","perrot"],"title":"Forward Chaining in HALO - An Implementation Strategy for History-based Logic Pointcuts","year":2009}