TU Darmstadt / ULB / TUbiblio

Redundancy-free Residual Dispatch: Using Ordered Binary Decision Diagrams for Efficient Dispatch

Sewe, Andreas and Bockisch, Christoph and Mezini, Mira :
Redundancy-free Residual Dispatch: Using Ordered Binary Decision Diagrams for Efficient Dispatch.
[Online-Edition: http://doi.acm.org/10.1145/1394496.1394497]
In: 7th workshop on Foundations of aspect-oriented languages (FOAL 2008), 1. Apr. 2008, Brussels, Belgium. In: ACM Digital Library , Procee . New York, NY, USA
[Conference or Workshop Item] , (2008)

Official URL: http://doi.acm.org/10.1145/1394496.1394497

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.

Item Type: Conference or Workshop Item
Erschienen: 2008
Creators: Sewe, Andreas and Bockisch, Christoph and Mezini, Mira
Title: Redundancy-free Residual Dispatch: Using Ordered Binary Decision Diagrams for Efficient Dispatch
Language: English
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.

Series Name: ACM Digital Library
Volume: Procee
Place of Publication: New York, NY, USA
Uncontrolled Keywords: Advice, aspect-oriented programming, dispatch functions, ordered binary decision diagrams, pointcuts, residual dispatch
Divisions: Department of Computer Science
Department of Computer Science > Software Technology
Event Title: 7th workshop on Foundations of aspect-oriented languages (FOAL 2008)
Event Location: Brussels, Belgium
Event Dates: 1. Apr. 2008
Date Deposited: 02 May 2009 12:58
Official URL: http://doi.acm.org/10.1145/1394496.1394497
Identification Number: doi:10.1145/1394496.1394497
Export:

Optionen (nur für Redakteure)

View Item View Item