Separation and information hiding

ACM Transactions on Programming Languages and Systems

Volumn 31, Issue 3, 2009, Pages

  O'Hearn, Peter W ^a   Yang, Hongseok ^a   Reynolds, John C ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Modularity; Resource protection; Separation logic

Indexed keywords

ALIASED; DYNAMIC PARTITIONING; INFORMATION HIDING; INTERNAL RESOURCES; LOGICAL CONNECTIVES; MODULARITY; PROGRAM COMPONENTS; RESOURCE PROTECTION; SEPARATION LOGIC;

DATA STRUCTURES;

SEPARATION;

EID: 70349756867     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1498926.1498929     Document Type: Article

References (47)

1. AHMED, A., JIA, L., AND WALKER, D. 2003. Reasoning about hierarchical storage. In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS). 33-44
2. 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).
3. BARNETT, M., DELINE, R., FAHNDRICH, M., LEINO, K., AND SCHULTE, W. 2004. Verification of object-oriented programs with invariants. J. Obj. Techn. 3, 6, 27-56
4. BENTON, N. 2006. allocation. In Proceedings of the 20th International Workshop on Computer Science Logic (CSL). 182-196
5. BIERING, B., BIRKEDAL, L., AND TORP-SMITH, N. 2007. BI-hyperdoctrines, higher-order separation logic, and abstraction. ACM Trans. Program. Lang. Syst. 29, 5
6. BIRKEDAL, L., TORP-SMITH,N., AND YANG, H. 2005. Semantics of separation-logic typing and higherorder frame rules. in Proceedings ofthe 20th Annual IEEE Symposium on Logic in Computer Science (LICS
7. BIRKEDAL,L. AND YANG, H. 2007. Relational parametricity and separation logic. In Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FOSSACS
8. BORNAT, R. 2000. Proving pointer programs in Hoare logic. Mathematics of Program Construction.
9. BORNAT, R., CALCAGNO, C., O'Hearn,P., and Parkinson, M. 2005. Permission accounting in separation logic. in Proceedings ofthe 32nd ACMSymposium on Principles ofProgrammingLanguages (POPL). 59-70
10. BRINCH HANSEN, P., Ed. 2002. The Origin of Concurrent Programming. Springer-Verlag.
11. BROOKES, S. D. 2007. A semantics of concurrent separation logic. Theoretical Computer Science 375, 1-3, 227-270. (Preliminary version appeared in CONCUR'04, LNCS 3170, pp. 16-34
12. CLARKE, D., NOBLE,J., AND POTTER, J. 2001. Simple ownership types for object containment. Proceedings ofthe 15th European Conference on Object-Oriented Programming (ECOOP). Lecture Notes in Computer Science, vol.2072, Springer. 53-76
13. COOK, S. A. 1978. Soundness and completeness of an axiomatic system for program verification. SIAM J. Comput. 7, 70-90
14. GROTHOFF, C., PALSBERG,J., AND VITEK, J. 2001. Encapsulating objects with confined types. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA). 241-253
15. HOARE, C. A. R. 1971. Procedures and parameters: An axiomatic approach. In Proceedings of the Symposium on the Semantics of Algebraic Languages, E. Engler, Ed. Springer, 102-116. Lecture Notes in Math. 188
16. HOARE, C. A. R. 1972a. Proof of correctness of data representations. Acta Informatica 4, 271-281
17. HOARE, C. A. R. 1972b. Towards a theory of parallel programming. In Operating Systems Techniques, Hoare and Perrot, Eds. Academic Press.
18. HOARE, C. A. R. 1974. Monitors: An operating system structuring concept. Comm. ACM 17, 10, 549-557. Reprinted in [Brinch Hansen 2002
19. HOGG, J. 1991. Islands: aliasing protection in object-oriented languages. In Proceedings of the 6th Conference on Object-Orient ed Programming Systems, Languages, and Applications (OOPSLA
20. ISTHIAQ,S. AND O'HEARN, P. W. 2001. BI as an assertion language for mutable data structures. In Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL). 36-49
21. KERNIGHAN, B. AND RITCHIE, D. 1988. The C Programming Language. Prentice Hall. Second edition.
22. KRISHNASWAMI, N., ALDRICH,J., AND BIRKEDAL, L. 2007. A modular verification of the subject-observer pattern via higher-order separation logic. In Proceedings of the 9th Workshop on Formal Techniques for Java-like Programs
23. LEINO,K. AND MÜLLER, P. 2004. Object invariants in dynamic contexts. In Proceedings of the 18th European Conference on Object-Oriented Programming (ECOOP).
24. LEINO,K.R.M. AND NELSON, G. 2002. Data abstraction and information hiding. ACM Trans. Program. Lang. Syst. 24, 5, 491-553
25. MITCHELL,J.C. AND PLOTKIN, G. D. 1988. types have existential types. ACM Trans. Program. Lang. Syst. 10, 3, 470-502
26. MORGAN, C. 1988. The specification statement. ACM Trans. Program. Lang. Syst. 10, 3, 403-419
27. MORRIS, J. 1987. A theoretical basis for stepwise refinement and the programming calculus. Sci. Comput. Program. 9, 3, 287-306
28. MÜLLER,P. AND POETZSCH-HEFFTER, A. 2000. Modular specification and verification techniques for object-oriented software components. In Foundations ofComponent-Based Systems. Cambridge üniversity Press
29. NANEVSKI, A., MORRISETT,G., AND BIRKEDAL, L. 2006. Polymorphism and separation in Hoare type theory. In Proceedings ofthe ACM SIGPLAN Internatio nal Conference on Functional Programming (ICFP). 62-73
30. NAUMANN, D. 2007. On assertion-based encapsulation for object invariants and simulations. Formal Asp. Comput. 19, 2, 205-224
31. NAUMANN,D.A. AND BARNETT, M. 2004a. Friends need a bit more: Maintaining invariants over shared state. In Mathematics of Program Construction.
32. NAUMANN,D. A. AND BARNETT, M. 2004b. Towards imperative modules: Reasoning about invariants and shared of mutable state. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS
33. O'HEARN, P., REYNOLDS, J., AND YANG, H. 2001. Local reasoning about programs that alter data structures. In Proceedings of the 15th International Workshop on Computer Science Logic (CSL). 1-19
34. O'HEARN, P. W. 2007. Resources, concurrency and local reasoning. Theoretical Computer Science 375, 1-3, 271-307. (Preliminary version appeared in CONCUR'04, Lecture Notes in Computer Science, vol. 3170, 49-67).
35. O'HEARN, P. W., YANG, H., AND REYNOLDS, J. C. 2004. Separation and information hiding. In Proceedings ofthe 31st ACM Symposium on Principles ofProgramming Languages (POPL). 268-280
36. PARKINSON, M. 2005. Local reasoning for Java. Ph.D. thesis, Cambridge University, Cambridge, UK.
37. PARKINSON, M. 2007. Class invariants: the end of the road? Position paper presented at 3rd International Workshop on Aliasing, Confinem ent, and Ownership in Object-Oriented Programming (IWACO)
38. PARKINSON,M. AND BIERMAN, G. 2005. Separation logic and abstraction. In Proceedings of the 32nd ACM Symposium on Principles of Programming Languages (POPL), 59-70
39. PARKINSON, M., BORNAT, R., AND CALCAGNO, C. 2006. Variables as resource in Hoare logics. In Proceedings ofthe 21st Annual IEEE Symposium on Logic in Computer Science (LICS).
40. PARNAS, D. 1972a. Information distribution aspects of design methodology. Proceedings of International Federation for Information Processing (IFIP) 1 , 339-344
41. PARNAS, D. 1972b. On the criteria to be used in decomposing systems into modules. Comm. ACM 15, 12, 1053-1058
42. PETERSON, R., BIRKEDAL, L., NANEVSKI, A., AND MORRISETT, G. 2008. A realizability model of im-predicative Hoare type theory. in Proceedings ofthe 17th European Symposium on Programming (ESOP
43. PLOTKIN, G. 1983. Pisa notes (on domain theory).
44. REYNOLDS, J. C. 1983. Types, abstraction and parametric polymorphism. Proceedings of Interna-tional Federation for Information Processing (IFIP
45. REYNOLDS, J. C. 2002. Separation logic: A logic for shared mutable data structures. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS). 55-74
46. SCHWARZ, J. S. 1974. Semantics of partial correctness formalisms. Ph.D. thesis, Syracuse University, Syracuse, NY.
47. SCHWARZ, J. S. 1977. Generic commands-a tool for partial correctness formalisms. Comput. J. 20, 2, 151-155