Open bisimulation for aspects

Authors:

Abstract
We define and study bisimulation for proving contextual equiva- lence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive reasoning prin- ciples aimed at proving equality of aspect programs. The language we study is very small, yet powerful enough to encode mutable references and a range of temporal pointcuts (including cflow and regular event patterns). Examples suggest that our bisimulation principle is useful. For an encoding of higher-order programs with state, our methods suffice to establish well-known and well-studied subtle examples involving higher-order functions with state. Even in the presence of first class dynamic advice and expres- sive pointcuts, our reasoning principles show that aspect-aware in- terfaces can aid in ensuring that clients of a component are un- affected by changes to an implementation. Our paper generalizes existing results given for open modules to also include a variety of history-sensitive pointcuts such as cflow and regular event patterns. Our formal techniques and results suggest that aspects are amenable to the formal techniques developed for stateful higher- order programs.

This publication has 37 references indexed in Scilit: