Degree Name
MS (Master of Science)
Program
Computer and Information Science
Date of Award
12-2003
Committee Chair or Co-Chairs
Martin L. Barrett
Committee Members
Jeffrey W. Roach, Steven L. Jenkins
Abstract
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 little or no crosscutting concerns. AOP presents the notion of aspects, and demonstrates how crosscutting concerns can be taken out of modules and placed into a centralized location.
In this paper, a taxonomy of aspect-oriented programming, as well as a basic overview and introduction of AOP, will be presented in order to assist future researchers in getting started on additional research on the topic. To form the taxonomy, over four-hundred research articles were organized into fifteen different primary categories coupled with sub-categories, which shows where some of the past research has been focused. In addition, trends of the research were evaluated and paths for future exploration are suggested.
Document Type
Thesis - unrestricted
Recommended Citation
Hankerson, Mario Bernard, "Towards a Taxonomy of Aspect-Oriented Programming." (2003). Electronic Theses and Dissertations. Paper 851. https://dc.etsu.edu/etd/851
Copyright
Copyright by the authors.