Abstract
A semantics by translation to a process calculus is used as the basis for an investigation of transformations to programs expressed in a parallel object-oriented language. Two concrete examples are studied. In one it is shown that transformations introducing concurrency into the design of a priority queue class do not alter the observable behaviour. In the other, a more delicate relationship between two symbol table classes is established.
Cite
CITATION STYLE
Walker, D. (1994). Algebraic proofs of properties of objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 788 LNCS, pp. 501–516). Springer Verlag. https://doi.org/10.1007/3-540-57880-3_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.