ISR Colloquium Speaker

Karl Lieberherr

College of Computer and Information Science
“Adaptive Aspect-Oriented Programming in AspectJ”
Friday, February 7, 2003 - 10:30am to 12:00pm
Faculty Host: 

RSVPs requested to Christopher Stringer, cms @

ICS2 144

No cost to attend.


Click here for directions and parking information.


A program fragment is called adaptive if it changes its behavior according to its context. Adaptiveness requires some form of "shy" programming where we select information without knowing all the context. Examples of adaptive program fragments are pointcuts in AspectJ that select a set of join points without knowing the details of their structure and traversal specifications in Demeter that select a set of elements in a graph without knowing the details of the graph structure.

We will explore AspectJ from the point of view of the many adaptive features it already has and that it could have and we will develop a Law of Demeter checker (Object Form: every method should only talk to closely related objects) in AspectJ as an adaptive program that adapts to any Java program.

This is joint work with David Lorenz and Pengcheng Wu (appearing at Aspect-Oriented Software Development 2003).

About the Speaker: 

Karl Lieberherr is a Professor in the College of Computer Science where he works on aspect-oriented software development. He is a member of the steering committee of the conference series on Aspect-Oriented Software Development (AOSD) and is organizing chair for AOSD 2003 in Boston, MA ( and program chair for AOSD 2004 in Lancaster, England.

Professor Lieberherr has directed the Demeter project since 1985 with funding from DARPA, NSF and several companies. Some Demeter ideas have made it into the main stream (for example succinct traversal specifications are used in XML XPATH) and the Demeter tools are used in mission-critical applications at Fortune 10 and other companies.

His earlier research interests include design automation for VLSI. He was the principal designer of the hardware description language Zeus, a predecessor of VHDL. He has also worked in analysis of algorithms, being codeveloper of the concept of P-optimal approximation algorithms for combinatorial optimization problems which started with the Golden Ratio result for the Satisfiability problem published in the Journal of the ACM.

Dr. Lieberherr received his Ph.D. in mathematics from ETH Zurich, Switzerland. He was an Assistant Professor of Computer Science at Princeton University and a Principal Member of Technical Staff at GTE Laboratories before joining Northeastern University.