Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

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

Summary: Redundancy-free Residual Dispatch
Using Ordered Binary Decision Diagrams for Efficient Dispatch
Andreas Sewe Christoph Bockisch Mira Mezini
Technische Universitšt Darmstadt
Hochschulstr. 10, 64289 Darmstadt, Germany
{sewe, bockisch, mezini}@st.informatik.tu-darmstadt.de
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 or-
der to improve upon the average-case run-time cost, this pa-
per presents an alternative representation which enables effi-
cient residual dispatch, namely ordered binary decision dia-
grams. In particular, this representation facilitates the com-
plete elimination of redundant evaluations across all point-
cuts sharing a join point shadow.
Categories and Subject Descriptors

  

Source: Al Hanbali, Ahmad - Department of Applied Mathematics, Universiteit Twente

 

Collections: Engineering