Type-based confinement

  • Authors:

  • Tian Zhao;Jens Palsberg;Jan Vitek

  • Affiliations:

  • 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);Computer Science Department, UCLA, 4531K Boelter Hall, Los Angeles, CA 90095-1596, USA (e-mail: palsberg@ucla.edu);Department of Computer Sciences, Purdue University, 250 N. University Street, West Lafayette, IN 47907-2066, USA (e-mail: jv@cs.purdue.edu)

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.