Hostname: page-component-8448b6f56d-qsmjn Total loading time: 0 Render date: 2024-04-24T21:42:15.655Z Has data issue: false hasContentIssue false

Type-based confinement

Published online by Cambridge University Press:  13 September 2005

TIAN ZHAO
Affiliation:
Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, PO Box 784, Milwaukee, WI 53201-0784, USA (e-mail: tzhao@cs.uwm.edu)
JENS PALSBERG
Affiliation:
Computer Science Department, UCLA, 4531K Boelter Hall, Los Angeles, CA 90095-1596, USA (e-mail: palsberg@ucla.edu)
JAN VITEK
Affiliation:
Department of Computer Sciences, Purdue University, 250 N. University Street, West Lafayette, IN 47907-2066, USA (e-mail: jv@cs.purdue.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Confinement properties impose a structure on object graphs which can be used to enforce encapsulation properties. From a practical point of view, encapsulation is essential for building secure object-oriented systems as security requires that the interface between trusted and untrusted components of a system be clearly delineated and restricted to the smallest possible set of operations and data structures. This paper investigates the notion of package-level confinement and proposes a type system that enforces this notion for a call-by-value object calculus as well as a generic extension thereof. We give a proof of soundness of this type system, and establish links between this work and related research in language-based security.

Type
Article
Copyright
© 2005 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.