ACM Home Page
Please provide us with feedback. Feedback
Representation independence, confinement and access control [extended abstract]
Full text PdfPdf (263 KB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
Portland, Oregon
Pages: 166 - 177  
Year of Publication: 2002
ISBN:1-58113-450-9
Also published in ...
Authors
Anindya Banerjee  Kansas State University, Manhattan KS
David A. Naumann  Stevens Institute of Technology, Hoboken NJ
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 29,   Citation Count: 29
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/503272.503289
What is a DOI?

ABSTRACT

Denotational semantics is given for a Java-like language with pointers, subclassing and dynamic dispatch, class oriented visibility control, recursive types and methods, and privilege-based access control. Representation independence (relational parametricity) is proved, using a semantic notion of confinement similar to ones for which static disciplines have been recently proposed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
A. Banerjee and D. A. Naumann. A static analysis for instance-based confinement in Java. In preparation.
 
3
A. Banerjee and D. A. Naumann. A simple semantics and static analysis for Java security. Technical Report CS Report 2001-1, Stevens Institute of Technology.
 
4
 
5
 
6
A. Cavalcanti and D. A. Naumann. Forward simulation for data refinement of classes. Submitted, 2001.
 
7
 
8
W.-P. de Roever and K. Engelhardt. Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge University Press, 1998.
 
9
D. Detlefs and K. R. M. Leino and G. Nelson. Wrestling with rep exposure. Research Report 156, COMPAQ Systems Research Center, July 1998.
 
10
 
11
 
12
13
 
14
15
16
 
17
18
19
 
20
21
22
 
23
 
24
 
25
P. M. uller. Modular Specification and Verification of Object-Oriented Programs. PhD thesis, FernUniversity at Hagen, 2001. Available from www.informatik.fernuni-hagen.de/pi5/publications.
 
26
 
27
P. M. uller and A. Poetzsch-Heffter. A type system for controlling representation exposure in Java. ECOOP Workshop on Formal Techniques for Java Programs, Technical Report 269, Fernuniversit. at Hagen, 2000.
 
28
29
 
30
 
31
G. Plotkin. Lambda definability and logical relations. Technical Report SAI-RM-4, University of Edinburgh, School of Artificial Intelligence, 1973.
 
32
U. S. Reddy. Objects and classes in Algol-like languages. In FOOL, 1998.
 
33
 
34
J. C. Reynolds. The essence of Algol. In J. W. de Bakker and J. C. van Vliet, editors, Algorithmic Languages. North-Holland, 1981.
 
35
J. C. Reynolds. Types, abstraction, and parametric polymorphism. In R. Mason, editor, Information Processing ,83, pages 513-523. North-Holland, 1984.
 
36
J. C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millenial Perspectives in Computer Science. Palgrave, 2001.
37
38
 
40
 
41
D. von Oheimb, T. Nipkow, and C. Pusch. muJava: Embedding a programming language in a theorem prover. In Proceedings of the International Summer School Marktoberdorf, 1999.
42

CITED BY  29
Collaborative Colleagues:
Anindya Banerjee: colleagues
David A. Naumann: colleagues