We will have our weekly meetings with Ravi on Tuesday mornings at 9.30 in my office. The general topic is algorithmic problems appearing in the science of design: http://www.cs.virginia.edu/~sullivan/sodsis.html

Ravi's wiki about this topic is at: http://koods1.ccs.neu.edu/ Choose the traversal wiki.
Ravi: please can you remind us of the password. It used to be K@rl?

Topics for Tuesday:
Strengthening the FPT results in our crosscut expressiveness paper. Revisions to the paper suggested by referees: complexity of selector interference: s1 & s2 is non-empty.

Kathy's and Shriram's pointcut language in their model checking work (see talk on Wednesday).

How does an aspect influence the running time of a base program? The base program has running-time O(n^2). With the aspect the running time is O(n log(n)) or O(n^3). How can we prove such statements?

Any other algorithmic problems that came up in Pengcheng's, Theo's or Jeff's research.

-- Karl