Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

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)

Algorithmic Problems Related to the Tyranny of the Dominant Decomposition

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login