| A. Banerjee and D. A. Naumann. A static analysis for instance-based confinement in Java. In preparation. |
....does not require code anno In the case of refinement, identity is replaced by inequality [28] In this paper we do not emphasize refinement. As a property to be proved or, ideally, as an intrinsic feature of the semantic model [34, 29] tations, can be derived from the semantic definition [2]. Overview of the paper. Section 2 introduces the language with an example showing the necessity of confinement. Then typing and semantic definitions are given; we defer the access control facility to Section 6. Section 3 formulates the basic situation to which the abstraction theorem applies, ....
....pass to one A# object a reference to another A# object. This is di#cult to express in terms of the semantics. At first glance the syntactic conditions may appear rather strong, but we have not found non trivial examples that violate the conditions without also violating heap confinement. Elsewhere [2] we give mild syntactic conditions that su#ce for confinement of a class table, e.g. methods of non rep class A cannot construct new Rep objects. In practice, Rep would be local to a module not containing C. As an example, let A be class A0 in Section 2.1, and let Rep be Boolean. Consider an ....
A. Banerjee and D. A. Naumann. A static analysis for instance-based confinement in Java. In preparation.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC