Sewe, Andreas ; Bockisch, Christoph ; Mezini, Mira (2008)
Redundancy-free Residual Dispatch: Using Ordered Binary Decision Diagrams for Efficient Dispatch.
7th workshop on Foundations of aspect-oriented languages (FOAL 2008). Brussels, Belgium (01.04.2008-01.04.2008)
doi: 10.1145/1394496.1394497
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
State-of-the-art implementations of common aspect-oriented languages weave residual dispatching logic for advice whose applicability cannot be determined at compile-time. But being derived from the residue's formula representation the woven code often implements an evaluation strategy which mandates redundant evaluations of atomic pointcuts. In order to improve upon the average-case run-time cost, this paper presents an alternative representation which enables efficient residual dispatch, namely ordered binary decision diagrams. In particular, this representation facilitates the complete elimination of redundant evaluations across all pointcuts sharing a join point shadow.
Typ des Eintrags: | Konferenzveröffentlichung |
---|---|
Erschienen: | 2008 |
Autor(en): | Sewe, Andreas ; Bockisch, Christoph ; Mezini, Mira |
Art des Eintrags: | Bibliographie |
Titel: | Redundancy-free Residual Dispatch: Using Ordered Binary Decision Diagrams for Efficient Dispatch |
Sprache: | Englisch |
Publikationsjahr: | 2008 |
Ort: | New York, NY, USA |
Reihe: | ACM Digital Library |
Band einer Reihe: | Procee |
Veranstaltungstitel: | 7th workshop on Foundations of aspect-oriented languages (FOAL 2008) |
Veranstaltungsort: | Brussels, Belgium |
Veranstaltungsdatum: | 01.04.2008-01.04.2008 |
DOI: | 10.1145/1394496.1394497 |
Kurzbeschreibung (Abstract): | State-of-the-art implementations of common aspect-oriented languages weave residual dispatching logic for advice whose applicability cannot be determined at compile-time. But being derived from the residue's formula representation the woven code often implements an evaluation strategy which mandates redundant evaluations of atomic pointcuts. In order to improve upon the average-case run-time cost, this paper presents an alternative representation which enables efficient residual dispatch, namely ordered binary decision diagrams. In particular, this representation facilitates the complete elimination of redundant evaluations across all pointcuts sharing a join point shadow. |
Freie Schlagworte: | Advice, aspect-oriented programming, dispatch functions, ordered binary decision diagrams, pointcuts, residual dispatch |
Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Softwaretechnik |
Hinterlegungsdatum: | 02 Mai 2009 12:58 |
Letzte Änderung: | 05 Mär 2013 09:19 |
PPN: | |
Export: | |
Suche nach Titel in: | TUfind oder in Google |
Frage zum Eintrag |
Optionen (nur für Redakteure)
Redaktionelle Details anzeigen |