Ownership confinement ensures representation independence for object-oriented programs

Journal of the ACM

Volumn 52, Issue 6, 2005, Pages 894-960

  Banerjee, Anindya ^a,c   Naumann, David A ^b,d  

^a KANSAS STATE UNIVERSITY   (United States)

^b STEVENS INSTITUTE OF TECHNOLOGY   (United States)

^c Kansas State University   (United States)

^d Stevens Institute of Technology   (United States)

Author keywords

Alias control; Confinement; Data refinement; Relational parametricity; Simulation

Indexed keywords

ALIAS CONTROL; CONFINEMENT; DATA REFINEMENT; RELATIONAL PARAMETRICITY;

ABSTRACTING; COMPUTER SIMULATION; CONTROL SYSTEMS; DATA ACQUISITION; ENCAPSULATION; MATHEMATICAL MODELS;

OBJECT ORIENTED PROGRAMMING;

EID: 33745220946     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1101821.1101824     Document Type: Article

References (94)

1. ABADI, M., BANERJEE, A., HEINTZE, N., AND RIECKE, J. G. 1999. A core calculus of dependency. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). ACM, New York, 147-160.
2. ABADI, M., AND CARDELLI, L. 1996. A Theory of Objects. Springer-Verlag, New York.
3. ABADI, M., AND LEINO, K. R. M. 1997. A logic of object-oriented programs. In Theory and Practice of Software Development (TAPSOFT). Springer-Verlag, New York. (Expanded in DEC SRC report 161.)
4. ALDRICH, J., AND CHAMBERS, C. 2004. Ownership domains: Separating aliasing policy from mechanism. In Proceedings of the European Conference on Object Oriented Programming (ECOOP). Lecture Notes in Computer Science. Springer-Verlag, New York, 1-25.
5. ALDRICH, J., KOSTADINOV, V., AND CHAMBERS, C. 2002. Alias annotations for program understanding. In Proceedings of the ACM Symposium on Object Oriented Programming: Systems, Languages, and Applications (OOPSLA). ACM, New York.
6. ALMEIDA, P. S. 1997. Balloon types: Controlling sharing of state in data types. In Proceedings of the European Conference on Object Oriented Programming (ECOOP). Lecture Notes in Computer Science. Springer-Verlag, New York, 32-59.
7. ARNOLD, K., AND GOSLING, J. 1998. The Java Programming Language, 2nd ed. Addison-Wesley, Reading, MA.
8. BANERJEE, A., HEINTZE, N., AND RIECKE, J. G. 2001. Design and correctness of program transformations based on control-flow analysis. In Proceedings of the International Symposium on Theoretical Aspects of Computer Software (TACS). Lecture Notes in Computer Science. Springer-Verlag, New York, 420-447.
9. BANERJEE, A., AND NAUMANN, D. A. 2002. Representation independence, confinement and access control. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). ACM, New York, 166-177.
10. BANERJEE, A., AND NAUMANN, D. A. 2004a. Ownership confinement ensures representation independence for object-oriented programs. Tech. Rep. CS-2004-14, Stevens Institute of Technology. (Also available as technical report KSU CIS-TR-2004-6, Kansas State University.)
11. BANERJEE, A., AND NAUMANN, D. A. 2004b. State based encapsulation and generics. Tech. Rep. CS-2004-11, Stevens Institute of Technology.
12. BANERJEE, A., AND NAUMANN, D. A. 2005. State based ownership, reentrance, and encapsulation. In Proceedings of the 19th European Conference on Object Oriented Programming (ECOOP). Lecture Notes in Computer Science, vol. 3586. Springer-Verlag, New York, pp. 387-411.
13. BHOWMIK, A., AND PUGH, W. 1999. A secure implementation of Java inner classes. PLDI poster session, http://www.cs.umd.edu/~pugh/java/ SecureInnerClassesHandout.pdf.
14. BOYLAND, J. 2001. Alias burying: Unique variables without destructive reads. Softw. Prac. Exp. 31, 6, 533-553.
15. BRUCE, K. B. 2002. Foundations of Object-Oriented Programming Languages: Types and Semantics. MIT Press, Cambridge, MA.
16. BRUCE, K. B., CARDELLI, L., AND PIERCE, B. C. 1999. Comparing object encodings. Inf. Cornput. 155, 1/2, 108-133.
17. CAVALCANTI, A. L. C., AND NAUMANN, D. A. 1999. A weakest precondition semantics for an object-oriented language of refinement. In FM' 99 - Formal Methods, Volume II. Lecture Notes in Computer Science, vol. 1709. Springer-Verlag, New York, 1439-1459.
18. CAVALCANTI, A. L. C., AND NAUMANN, D. A. 2002. Forward simulation for data refinement of classes. In Formal Methods Europe. Lecture Notes in Computer Science, vol. 2391. Springer-Verlag, New York, 471-490.
19. CLARKE, D. 2001. Object ownership and containment. Ph.D. dissertation. University of New South Wales, Australia.
20. CLARKE, D., AND DROSSOPOULOU, S. 2002. Ownership, encapsulation and the disjointness of type and effect. In Proceedings of the ACM Symposium on Object Oriented Programming: Systems, Languages, and Applications (OOPSLA). ACM, New York.
21. CLARKE, D.G., NOBLE, J., AND POTTER, J. M. 2001. Simple ownership types for object containment. In Proceedings of the European Conference on Object Oriented Programming (ECOOP). Lecture Notes in Computer Science. Springer-Verlag, New York.
22. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, MA.
23. COUSOT, P., AND COUSOT, R. 1977. Automatic synthesis of optimal invariant assertions: Mathematical foundations. In Proceedings of the ACM Symposium on Artificial Intelligence and Programming Languages, SIGPLAN Notices, 12. ACM, New York, 1-12.
24. DAHL, O.-J., AND NYGAARD, K. 1966. Simula: An Algol-based simulation language. Commun. ACM 9,9, 671-678.
25. DAVEY, B., AND PRIESTLEY, H. 1990. Introduction to Lattices and Order. Cambridge University Press.
26. DE ROEVER, W.-P., AND ENGELHARDT, K. 1998. Data Refinement: Model-Oriented Proof Methods and Their Comparison. Cambridge University Press, Cambridge, MA.
27. DETLEFS, D. L., LEINO, K. R. M., AND NELSON, G. 1998. Wrestling with rep exposure. Res. Rep. 156, DEC Systems Research Center.
28. DHARA, K. K., AND LEAVENS, G. T. 1996. Forcing behavioral subtyping through specification inheritance. In Proceedings of the 18th International Conference on Software Engineering. IEEE Computer Society Press, Los Alamitos, CA, 258-267.
29. DONAHUE, J. E. 1979. On the semantics of "data type". SIAM J. Comput. 8, 4, 546-560.
30. GAMMA, E., HELM, R., JOHNSON, R., AND VLISSIDES, J. 1995. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Reading, MA.
31. GERMAN, S. M., CLARKE, E. M., AND HALPERN, J. Y. 1989. Reasoning about procedures as parameters in the language L4. Inf. Comput. 83, 265-359.
32. GONG, L. 1999. Inside Java 2 Platform Security. Addison-Wesley, Reading, MA.
33. GORDON, A. D., AND PITTS, A. M., Eds. 1998. Higher Order Operational Techniques in Semantics. Cambridge University Press.
34. GROSSMAN, D., MORRISETT, G., AND ZDANCEWIC, S. 2000. Syntactic type abstraction. ACM Trans. Program. Lang. Syst. 22, 6, 1037-1080.
35. GROTHOFF, C., PALSBERG, J., AND VITEK, J. 2001. Encapsulating objects with confined types. In Proceedings of the ACM Symposium on Object Oriented Programming: Systems, Languages, and Applications (OOPSLA). ACM, New York.
36. HAYNES, C. T. 1984. A theory of data type representation independence. In Proceedings of the International Symposium on Semantics of Data Types, G. Kahn, D. B. MacQueen, and G. Plotkin, Eds. Lecture Notes in Computer Science, vol. 173. Springer-Verlag, New York, 157-175.
37. HE, J., HOARE, C. A. R., AND SANDERS, J. 1986. Data refinement refined (resume). In European Symposium on Programming. Lecture Notes in Computer Science, vol. 213. Springer-Verlag, New York.
38. HOARE, C. A. R. 1972. Proofs of correctness of data representations. Acta Inf. 1, 271-281.
39. HOGG, J. 1991. Islands: Aliasing protection in object-oriented languages. In Proceedings of the ACM Symposium on Object Oriented Programming: Systems, Languages, and Applications (OOPSLA). ACM, New York.
40. HOGG, J., LEA, D., WILLS, A., DECHAMPEAUX, D., AND HOLT, R. 1992. The Geneva Convention on the treatment of object aliasing. OOPS Messenger 3, 2, 11-16.
41. HUISMAN, M. 2002. Verification of Java's AbstractCollection class: A case study. In Mathematics of Program Construction. Lecture Notes in Computer Science, vol. 2386. Springer-Verlag, New York, 175-194.
42. HUISMAN, M., AND JACOBS, B. 2000. Java program verification via a Hoare logic with abrupt termination. In Fundamental Approaches to Software Engineering (FASE). Lecture Notes in Computer Science. Springer-Verlag, New York, 284-303.
43. IGARASHI, A., PIERCE, B., AND WADLER, P. 2001. Featherweight Java: A minimal core calculus for Java and GJ. ACM Trans. Program. Lang. Syst. 23, 3 (May), 396-459.
44. JONES, C. B. 1986. Systematic software development using VDM. International Series in Computer Science. Prentice-Hall, New York.
45. KENNEDY, A., AND SYME, D. 2001. Design and implementation of generics for the .NET Common Language Runtime. In PLDI. 1-12.
46. LEA, D. 2000. Concurrent Programming in Java, Second ed. Addison-Wesley, Reading, MA.
47. LEAVENS, G. T., AND DHARA, K. K. 2000. Concepts of behavioral subtyping and a sketch of their extension to component-based systems. In Foundations of Component-Based Systems, G. T. Leavens and M. Sitaraman, Eds. Cambridge University Press, Chap. 6, 113-135.
48. LEINO, K. R. M., AND NELSON, G. 2002. Data abstraction and information hiding. ACM Trans. Program. Lang. Syst. 24, 5, 491-553.
49. LEVY, P. 2002. Possible world semantics for general storage in call-by-value. In Computer Science Logic. Number 2471 in Lecture Notes in Computer Science. Springer-Verlag, New York.
50. LISKOV, B., AND GUTTAG, J. 1986. Abstraction and Specification in Program Development. MIT Press, Cambridge, MA.
51. LISKOV, B. H., AND WING, J. M. 1994. A behavioral notion of subtyping. ACM Tram. Program. Lang. Syst. 26, 6, 1811-1841.
52. LYNCH, N., AND VAANDRAGER, F. 1995. Forward and backward simulations part I: Untimed systems. Inf. Comput. 121, 2, 214-233.
53. MEYER, A. R., AND SIEBER, K. 1988. Towards fully abstract semantics for local variables: Preliminary report. In ACM Symposium on Principles of Programming Languages (POPL). ACM, New York, 191-203.
54. MILNER, R. 1971. An algebraic definition of simulation between programs. In Proceedings of the 2nd International Joint Conference on Artificial Intelligence. 481-489.
55. MINSKY, N. H. 1996. Towards alias-free pointers. In European Conference on Object Oriented Programming (ECOOP). Lecture Notes in Computer Science, vol. 1098. Springer-Verlag, New York, 189-209.
56. MITCHELL, J. C. 1986. Representation independence and data abstraction. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). ACM Press, 263-276.
57. MITCHELL, J. C. 1991. On the equivalence of data representations. In Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, V. Lifschitz, Ed. 305-330.
58. MITCHELL, J. C. 1996. Foundations for Programming Languages. MIT Press, Cambridge, MA.
59. MÜLLER, P. 2002. Modular Specification and Verification of Object-Oriented programs. Lecture Notes in Computer Science, vol. 2262. Springer-Verlag, New York.
60. MÜLLER, P., AND POETZSCH-HEFFTER, A. 2000a. Modular specification and verification techniques for object-oriented software components. In Foundations of Component-Based Systems, G. T. Leavens and M. Sitaraman, Eds. Cambridge University Press, Cambridge, MA.
61. MÜLLER, P., AND POETZSCH-HEFFTER, A. 2000b. A type system for controlling representation exposure in Java. In ECOOP Workshop on Formal Techniques for Java Programs. Technical Report 269, Fernuniversität Hagen.
62. NAUMANN, D. A. 2001. Predicate transformer semantics of a higher order imperative language with record subtyping. Sci. Comput. Program. 41, 1, 1-51.
63. NAUMANN, D. A. 2002. Soundness of data refinement for a higher order imperative language. Theor. Comput. Sci. 278, 1-2, 271-301.
64. NAUMANN, D. A. 2005. Verifying a secure information flow analyzer. In Proceedings of 18th International Conference on Theorem Proving in Higher Order Logics (TPHOLS). Lecture Notes in Computer Science, vol. 3603. Springer-Verlag, New York, pp. 211-226.
65. O'HEARN, P. W., AND TENNENT, R. D. 1995. Parametricity and local variables. J. ACM 42, 3, 658-709.
66. OLDEROG, E.-R. 1983. Hoare's logic for programs with procedures-what has been achieved? In Proceedings, Logics of Programs, E. Clarke and D. Kozen, Eds. Lecture Notes in Computer Science, vol. 164. Springer-Verlag, New York.
67. PIERCE, B. C. 2002. Types and Programming Languages. MIT Press, Cambridge, MA.
68. PITTS, A. M. 1997. Reasoning about local variables with operationally-based logical relations. In Algol-Like Languages, P. W. O'Hearn and R. D. Tennent, Eds. Vol. 2. Birkhauser, Chapter 17, 173-193.
69. Reprinted from Proceedings Eleventh Annual IEEE Symposium on Logic in Computer Science, Brunswick, NJ, July 1996, pp 152-163.
70. PITTS, A. M. 2000. Parametric polymorphism and operational equivalence. Math. Struct. Comput. Sci. 10, 321-359.
71. PITTS, A. M. 2005. Typed operational reasoning. In Advanced Topics in Types and Programming Languages, B. C. Pierce, Ed. The MIT Press, Chapter 7, 245-289.
72. PLOTKIN, G. 1973. Lambda definability and logical relations. Tech. Rep. SAI-RM-4, University of Edinburgh, School of Artificial Intelligence.
73. POETZSCH-HEFFTER, A., AND MÜLLER, P. 1999. A programming logic for sequential Java. In Programming Languages and Systems (ESOP), S. D. Swierstra, Ed. Lecture Notes in Computer Science, vol. 1576. Springer-Verlag, New York, 162-176.
74. POWER, A. J., AND ROBINSON, E. P. 2000. Logical relations and data abstraction. In Proceedings of Computer Science Logic (CSL), P. Clote and H. Schwichtenberg, Eds. Lecture Notes in Computer Science. Springer-Verlag, New York, 497-511.
75. REDDY, U. S. 2002. Objects and classes in Algol-like languages. Inf. Comput. 172, 1 (Jan.). 63-97.
76. REDDY, U. S., AND YANG, H. 2004. Correctness of data representations involving heap data structures. Sci. Comput. Program. 50, 1-3, 129-160.
77. REUS, B. 2003. Modular semantics and logics of classes. In Proceedings of the 17th International Workshop on Computer Science Logic (CSL). Lecture Notes in Computer Science, vol. 2803. Springer-Verlag, New York, 456-469.
78. REUS, B., AND STREICHER, T. 2002. Semantics and logics of objects. In Proceedings of the IEEE Symposium on Logic in Computer Science (UCS). IEEE Computer Society Press, Los Alamitos, CA, 113-124.
79. REYNOLDS, J. C. 1972. Definitional interpreters for higher-order programming languages. In Proceedings of 25th ACM National Conference. ACM, New York, 717-740.
80. REYNOLDS, J. C. 1974. Towards a theory of type structure. In Colloques sur la Programmation. Lecture Notes in Computer Science, vol. 19. Springer-Verlag, New York, 408-425.
81. REYNOLDS, J. C. 1978. User-defined types and procedural data structures as complementary approaches to data abstraction. In Programming Methodology, D. Gries, Ed. Springer-Verlag, New York, 309-317.
82. REYNOLDS, J. C. 1981a. The Craft of Programming. Prentice-Hall, Englewood Cliffs, NJ.
83. REYNOLDS, J. C. 1981b. The essence of Algol. In Algorithmic: Languages, J. W. de Bakker and J. C. van Vliet, Eds. North-Holland, Amsterdam, The Netherlands.
84. REYNOLDS, J. C. 1984. Types, abstraction, and parametric polymorphism. In Information Processing '83, R. Mason, Ed. North-Holland, Amsterdam, The Netherlands, 513-523.
85. REYNOLDS, J. C. 2001. Intuitionistic reasoning about shared mutable data structure. In Millenial Perspectives in Computer Science. Palgrave.
86. REYNOLDS, J. C. 2002. Separation logic: A logic for shared mutable data structures. In IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, CA.
87. RIECKE, J. G. 1993. Fully abstract translations between functional languages. Math. Struct. Comput. Sci. 3, 4, 387-415.
88. STATA, R. 1997. Modularity in the presence of subclassing. Research Report 145, DEC SRC, 130 Lytton Avenue Palo Alto, CA 94301.
89. STRACHEY, C. 2000. Fundamental concepts in programming languages. Higher Order and Symbolic Computation 13, 1, 11-49. (Originally appeared in 1967 Lecture notes, International Summer School in Computer Programming, Copenhagen.)
90. SUMII, E., AND PIERCE, B. C. 2005. A bisimulation for type abstraction and recursion. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). ACM, New York, 63-74.
91. VITEK, J., AND BOKOWSKI, B. 2001. Confined types in Java. Softw. Pract. Exp. 31, 6, 507-532.
92. VOLPANO, D., SMITH, G., AND IRVINE, C. 1996. A sound type system for secure flow analysis. J. Comput. Sec. 4, 3, 167-187.
93. WALLACH, D., APPEL, A., AND FELTEN, E. 2000. SAFKASI: A security mechanism for language-based systems. ACM Trans. Softw. Eng. Meth. 9, 4 (Oct.), 341-378.
94. WINSKEL, G. 1993. The Formal Semantics of Programming Languages. MIT Press, Cambridge, MA.