Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, August 23, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Karl Lieberherr (Northeastern Univ., Boston)
A traditional program has a dominant decomposition structure (e.g., the class structure), and the many kinds of concerns that do not align with that modularization end up scattered across many modules and tangled with one another. Aspect-oriented programming (AOP), a proposal to deal with the tyranny of the dominant decomposition, has attracted considerable attention both by practitioners and researchers as a programming paradigm for modularizing the implementation of concerns whose ad-hoc implementation would be scattered. AOP improves modularity by allowing crosscutting aspects to be written in terms of their own decomposition structure and then have those structures woven together. AOP needs interesting algorithms for problems like: compilation, interpretation, interface checking, and program development. Using a three-component model of selector languages, graphs and instance graphs, we will present several graph-theoretic problems related to AOP and we give polynomial algorithms or lower bounds (NP-hardness) for them.
This is joint work with Ravi Sundaram and Jeffrey Palm.
Automatic MiSe System Software Version 1.4803M | admin login