Representation independence, confinement and access control

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 166-177

  Banerjee, Anindya ^a   Naumann, David A ^b  

^a KANSAS STATE UNIVERSITY   (United States)

^b STEVENS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL SYSTEM SYNTHESIS; PROGRAMMING THEORY; RECURSIVE FUNCTIONS; SEMANTICS; THEOREM PROVING;

ABSTRACTION THEOREM; ACCESS CONTROL SYSTEM;

JAVA PROGRAMMING LANGUAGE;

EID: 0036040498     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)

1. A core calculus of dependency
2. A static analysis for instance-based confinement in Java
3. A simple semantics and static analysis for Java security
4. Alias burying: Unique variables without destructive reads
5. Capabilities for sharing: A generalisation of uniqueness and read-only
6. Forward simulation for data refinement of classes
7. Simple ownership types for object containment
8. Wrestling with rep exposure
9. Forcing behavioral subtyping through specification inheritance
10. Syntactic type abstraction
11. Java program verification via a Hoare logic with abrupt termination
12. Featherweight Java: A minimal core calculus for Java and GJ
13. BI as an assertion language for mutable data structures
14. Data abstraction and information hiding
15. A behavioral notion of subtyping
16. Forward and backward simulations part I
17. Towards fully abstract semantics for local variables: Preliminary report
18. Representation independence and data abstraction
19. On the equivalence of data representations
20. Modular specification and verification techniques for object-oriented software components
21. A type system for controlling representation exposure in Java
22. Soundness of data refinement for a higher order imperative language
23. Parametricity and local variables
24. Lambda definability and logical relations
25. Objects and classes in Algol-like languages
26. Towards a theory of type structure
27. The essence of Algol
28. Types, abstraction, and parametric polymorphism
29. Intuitionistic reasoning about shared mutable data structure
30. Safely creating correct subclasses without seeing superclass code
31. Static enforcement of security with types
32. Fundamental concepts in programming languages
33. Confined types in java
34. muJava: Embedding a programming language in a theorem prover
35. SAFKASI: A security mechanism for language-based systems