Information hiding in the join calculus

Authors:
Qin Ma;Luc Maranget
Affiliations:
OFFIS, Oldenburg, Germany;INRIA-Rocquencourt, Le Chesnay Cedex, France
Venue:
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Year:
2006

Citing 8
Cited 0

Analysis of inheritance anomaly in object-oriented concurrent programming languages

Research directions in concurrent object-oriented programming
On binary methods

Theory and Practice of Object Systems - Special issue: type systems
The reflexive CHAM and the join-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The design of a class mechanism for Moby

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Combining subsumption and binary methods: an object calculus with views

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Privacy via subsumption

Information and Computation - FOOL V
Implicit Typing à la ML for the Join-Calculus

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
The inheritance anomaly: ten years after

Proceedings of the 2004 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We aim to provide information hiding support in concurrent object-oriented programming languages. We study this issue both at the object level and the class level, in the context of an object-oriented extension of Join-- a process calculus in the tradition of the π-calculus. In this extended abstract, we focus on the class level and design a new hiding operation on classes. The purpose of this operation is to prevent part of parent classes from being visible in client (inheriting) classes. We define its formal semantics in terms of a-converting hidden names to fresh names, and its typing in terms of eliminating hidden names from class types.