Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Join Points"”.

  1. Dynamic join points : model and interactions

    By modeling dynamic join points, pointcuts, and advice in a continuation-passing style interpreter, we provide a fundamental account of these AOP mechanisms. This account frames interesting type-and-effect properties of the mechanisms, such as the range of interactions between advised code and …

    ubc Repository record for Dynamic join points : model and interactions (opens in a new tab) Download PDF for Dynamic join points : model and interactions (opens in a new tab)

  2. Pointcuts by example

    … manipulation of effective representations of join points in the code to which a pointcut applies. There are two reasons why providing tool support for managing pointcut expressions is important. The first reason is that the pointcut-advice mechanism obscures exactly what a given piece of code …

    ubc Repository record for Pointcuts by example (opens in a new tab) Download PDF for Pointcuts by example (opens in a new tab)

  3. Interpreter implementation of advice weaving

    … structure for matching pointcuts against dynamic join points together with a simple mechanism for calling the matched advice. An implementation in the JikesRVM, an open source research virtual machine, shows the approach is straightforward to implement. Internal micro-benchmarks show dynamic join …

    ubc Repository record for Interpreter implementation of advice weaving (opens in a new tab) Download PDF for Interpreter implementation of advice weaving (opens in a new tab)

  4. Tool support for understanding and diagnosing pointcut expressions

    … present an algorithm to compute almost matched join points. Second we present algorithms to compute explanations of why a pointcut does not match (or does match) a specific join point. We implemented two tools using these algorithms. The first is an offline tool that analyzes a code base and …

    ubc Repository record for Tool support for understanding and diagnosing pointcut expressions (opens in a new tab) Download PDF for Tool support for understanding and diagnosing pointcut expressions (opens in a new tab)

  5. Extension in domain specific code generation with meta-model based aspect weaving

    … derive a domain specific aspect language whose join points are based on domain specific elements. We then show that a corresponding aspect weaver can be derived as well, provided a proper model tracing facility can be made available for the code generator. We demonstrate the viability of our …

    soton Download PDF for Extension in domain specific code generation with meta-model based aspect weaving (opens in a new tab)

  6. Sequent Calculus: A Logic and a Language for Computation and Duality

    … is not so apparent in practice. Sum types (disjoint tagged unions) and product types (structures) are dual concepts, but in the realm of programming, natural biases obscure their duality. To better understand the role of duality in programming, we shift our perspective. Our approach is based on …

    oregon Repository record for Sequent Calculus: A Logic and a Language for Computation and Duality (opens in a new tab)

  7. Real world evaluation of aspect-oriented software development : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University, Palmerston North, New Zealand

    … every method in a system). AOP also introduces join points, pointcuts, and advice which are used with aspects to capture crosscutting concerns so they can be localised in a modular unit. OO took approximately 20 years to become a mainstream development approach. AOP was only invented in 1997. …

    massey Repository record for Real world evaluation of aspect-oriented software development : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University, Palmerston North, New Zealand (opens in a new tab)

  8. Towards a Taxonomy of Aspect-Oriented Programming.

    As programs continue to increase in size, it has become increasingly difficult to separate concerns into well localized modules, which leads to code tangling- crosscutting code spread throughout several modules. Thus, Aspect-Oriented Programming (AOP) offers a solution to creating modules with …

    etsu Repository record for Towards a Taxonomy of Aspect-Oriented Programming. (opens in a new tab) Download PDF for Towards a Taxonomy of Aspect-Oriented Programming. (opens in a new tab)