Separation and information hiding

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

Volumn 31, Issue , 2004, Pages 268-280

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

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b Seoul National University   (South Korea)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Modularity; Resource Protection; Separation Logic

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER PROGRAMMING; DATA STRUCTURES; PROBLEM SOLVING; RESOURCE ALLOCATION; SOCIETIES AND INSTITUTIONS;

INFORMATION HIDING; MODULARITY; RESOURCE PROTECTION; SEPARATION LOGIC;

INFORMATION ANALYSIS;

EID: 2442441012     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/964001.964024     Document Type: Conference Paper

References (39)

1. A. Ahmed, L. Jia, and D. Walker. Reasoning about hierarchical storage. In 18th LICS, 2003.
2. T. Ball and S. Rajamani. Checking temporal properties of software with boolean programs. Proceedings of the Workshop on Advances in Verification, 2000.
3. A. Banerjee and D. Naumann. Representation independence, confinement and access control. In 29th POPL, 2002.
4. R. Bornat. Proving pointer programs in Hoare logic. Mathematics of Program Construction, 2000.
5. L. Cardelli and L Caires. A spatial logic for concurrency. In TACS'01, LNCS 2255:1-37, Springer, 2001.
6. L. Cardelli, P. Gardner, and G. Ghelli. Querying trees with pointers. Unpublished notes, 2003.
7. L. Cardelli, P. Gardner, and G. Ghelli. A spatial logic for querying graphs. Proceedings of ICALP'02.
8. L. Cardelli and G. Ghelli. A query language for semistructured data based on the ambient logic. Proceedings of ESOP'01.
9. L. Cardelli and A. D. Gordon. Anytime, anywhere. Modal logics for mobile ambients. In 27th POPL, 2000.
10. D. Clarke, J. Noble, and J. Potter. Simple ownership types for object containment. ECOOP, LNCS 2072, 2001.
11. J. Corbett, M. Dwyer, J. Hatcliff, S. Laubach, C. Pǎsǎreanu, Robby, and H. Zheng. Bandera: extracting finite-state models from Java source code. In International Conference on Software Engineering, pages 439-448, 2000.
12. K.R.M. Leino D. Detlefs and G. Nelson. Wrestling with rep exposure. Digital SRC Research Report 156, 1998.
13. F. de Boer. A WP calculus for OO. In FOSSACS, 1999.
14. M. Gabbay and A. Pitts. A new approach to abstract syntax involving binders. In 14th LICS, 1999.
15. C. Grothoff, J. Palsberg, and J. Vitek. Encapsulating objects with confined types. OOPSLA, pp241-253, 2001.
16. C.A.R. Hoare. Proof of correctness of data representations. Acta Informatica 4, 271-281, 1972.
17. C.A.R. Hoare. Towards a theory of parallel programming. In Hoare and Perrot, editors, Operating Systems Techniques. Academic Press, 1972.
18. C.A.R. Hoare. Monitors: An operating system structuring concept. C.ACM, 17(10):549-557, October 1974.
19. J. Hogg, D. Lea, R. Holt, A. Wills, and D. de Champeaux. The Geneva convention on the treatment of object aliasing. OOPS Messenger, April, 1992.
20. S. Isthiaq and P.W. O'Hearn. BI as an assertion language for mutable data structures. In 28th POPL, 2001.
21. C.B. Jones. Specification and design of (parallel) programs. IFIP Conference, 1983.
22. B. Kernighan and D. Ritchie. The C programming language. Prentice Hall, 1988.
23. K.R.M. Leino and G. Nelson. Data abstraction and information hiding. ACM TOPLAS 24(5): 491-553, 2002.
24. J. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Transactions of Software Engineering, July, 1981.
25. J.C. Mitchell and G.D. Plotkin. Abstract types have existential type. ACM TOPLAS 10(3):470-502, 1988.
26. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In Proceedings of Computer Science Logic, pages 1-19, 2001. LNCS 2142.
27. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6:319-340, 1976.
28. D.L. Parnas. Information distribution aspects of design methodology. IFIP Congress (1) 1971: 339-344, 1972.
29. D.L. Parnas. On the criteria to be used in decomposing systems into modules. C.ACM, 15(12):1053-1058, 1972.
30. B.C. Pierce and D.N. Turner. Simple type-theoretic foundations for object-oriented programming. Journal of Functional Programming, 4(2):207-247, 1994.
31. D.J. Pym. The Semantics and Proof Theory of the Logic of Bunched Implications. Kluwer Applied Logic series, 2002.
32. D.J. Pym, P.W. O'Hearn, and H. Yang. Possible worlds and resources: the semantics of BI. TCS, to appear, 2003.
33. U. Reddy and H. Yang. Correctness of data representations involving heap data structures. Proceedings of ESOP, 2003.
34. B. Reus, M. Wirsing, and R. Hennicker. A Hoare calculus for verifying Java realizations of OCL-constrained design models. FASE Proceedings, LNCS 2029, pp300-316, 2001.
35. J.C. Reynolds. Types, abstraction and parametric polymorphism. IFIP Proceedings, pp513-523, 1983.
36. J.C. Reynolds. Separation logic: a logic for shared mutable data structures. Invited Paper, 17th LICS, 2002.
37. D. Walker and J.G. Morrisett. Alias types for recursive data structures. In Types in Compilation, pp177-206, 2000.
38. R. Wilhelm, M. Sagiv, and T. Reps. Shape analysis. In Compiler Construction, pp1-17, 2000.
39. H. Yang, and P. O'Hearn. A semantic basis for local reasoning. In Proceedings of FOSSACS'02, pp402-416, 2002.