Abstract
An extension to the theory of confluence in the process calculus CCS is presented. The theory is generalized to an extension of the π-calculus. This calculus is used to provide semantics by translation for a parallel object-oriented programming language. The confluence theory is applied to prove the indistinguishability in an arbitrary program context of two class definitions which generate binary tree data structures one of which allows concurrent operations.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Liu, X., & Walker, D. (1995). Confluence of processes and systems of objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 915, pp. 217–231). Springer Verlag. https://doi.org/10.1007/3-540-59293-8_197
Readers' Seniority
Readers' Discipline
