Open bisimulation for aspects
Authors:
Open Access
- 14 March 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 107-120
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.Keywords
This publication has 37 references indexed in Scilit:
- MiniMAO1 : An imperative core language for studying aspect-oriented reasoningScience of Computer Programming, 2006
- A type-theoretic interpretation of pointcuts and adviceScience of Computer Programming, 2006
- Modular Verification of Open Features Using Three-Valued Model CheckingAutomated Software Engineering, 2005
- A theory of bisimulation for a fragment of concurrent ML with local namesTheoretical Computer Science, 2004
- A semantics for advice and dynamic join points in aspect-oriented programmingACM Transactions on Programming Languages and Systems, 2004
- Full Abstraction for PCFInformation and Computation, 2000
- On Full Abstraction for PCF: I, II, and IIIInformation and Computation, 2000
- Operationally-Based Theories of Program Equivalence1997
- Full Abstraction in the Lazy Lambda CalculusInformation and Computation, 1993
- A syntactic theory of sequential controlTheoretical Computer Science, 1987