Abstract

Process algebras are proposed as a foundation for aspect-oriented programming. A particular process algebra is described, and programs illustrating its use in programming are given. It is argued that the framework clarifies the notion of equivalence between programs and correctness of aspect-weaving algorithms. The question of which notion of equivalence is most appropriate is discussed from theoretical and practical points of view. An aspect-weaving algorithm is presented and proven correct. A simple imperative aspect-oriented language is presented and translated into the given process algebra.

Citations

1225	A calculus of communicating systems - Milner - 1980
855	Negation as Failure - Clark - 1978
244	Formalizing architectural connection - Allen, Garlan - 1994
196	B.: The concurrency workbench: a semanticsbased tool for the verification of concurrent systems - Cleaveland, Parrow, et al. - 1993
53	Communicating sequential processes. Prentice-Hall - Hoare - 1985
9	Broad-spectrum studies of log file analysis - Andrews, Zhang - 2000
9	Sorting out concerns - Carver, Grisworld
6	Consequence verification of flowcharts - Clark, Emden - 1981
3	A practical hyperspace application: Lessons from the option-processing task - Carver - 2000