BI-hyperdoctrines, higher-order separation logic, and abstraction

ACM Transactions on Programming Languages and Systems

Volumn 29, Issue 5, 2007, Pages

  Biering, Bodil ^a   Birkedal, Lars ^a   Torp Smith, Noah ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Abstraction; Hyperdoctrines; Separation logic

Indexed keywords

ABSTRACTING; CASE BASED REASONING; COMPUTER PROGRAM LISTINGS; COMPUTER PROGRAMMING LANGUAGES; DATA REDUCTION;

HYPERDOCTRINES; SEPARATION LOGICS;

FORMAL LOGIC;

EID: 34548416785     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1275497.1275499     Document Type: Conference Paper

References (40)

1. BANEHJEE, A. AND NAUMANN, D. 2005a. Ownership confinement ensures representation independence for object-oriented programs. J. ACM 52, 6, 894-960.
2. BANERJEE, A. AND NAUMANN, D. 2005b. State based ownership, reentrance and encapsulation. In Proceedings of the European Conference on Object-Oriented Programming. Lecture Notes in Computer Science, vol. 3586. Springer, 387-411.
3. BAHNETT, M., DELINE, R., FÄ HNDRICH, M., LEINO, K., AND SCHULTE, W. 2003. Verification of objectoriented programs with invariants. In Proceedings of the Conference on Formal Techniques for Java-Like Programs.
4. BARNETT, M. AND NAUMANN, D. 2004. Friends need a bit more: Maintaining invariants over shared shate. In Proceedings of the Conference on Mathematics of Program Construction (MPC).
5. BIERING, B. 2004. On the logic of bunched implications and its relation to separation logic. M.S. thesis, University of Copenhagen.
6. BIERING, B., BIRKEDAL, L., BUTZ, C., HYLAND, J., VAN OOSTEN, J., AND STREICHER, P. R. T. 2006. Notes on the dialectica topos. To appear.
7. BIRKEDAL, L., TORP-SMITH, N., AND YANG, H. 2005. Semantics of separation-logic typing and higher-order frame rules. In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Press, Chicago, IL, 260-269.
8. BIRKEDAL, L., TORP-SMITH, N., AND REYNOLDS, J. 2004. Local reasoning about a copying garbage collector. In Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) (Venice, Italy). 220-231.
9. BORNAT, R., CALCAGNO, C., O'HEARN, P., AND PARKINSON, M. 2005. Permission accounting in separation logic. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) (Long Beach, CA). ACM, New York.
10. BORNAT, R., CALCAGNO, C., AND O'HEARN, P. 2004. Local reasoning, separation and aliasing. In Proceedings of the SPACE (Venice, Italy).
11. BIRKEDAL, L. AND YANG, H. 2006. Relational parametricity and separation logic. To appear.
12. HOARE, C. A. R. 1972. Proof of correctness of data representations. Acta Inf. 1, 271-281.
13. HOARE, C. A. R. 1971. Procedures and parameters: An axiomatic approach. In Proceedings of the Symposium on Semantics of Algorithmic Languages, E. Engler, ed. Springer, 102-116.
14. ISHTIAQ, S. AND O'HEARN, P. W. 2001. BI as an assertion language for mutable data structures. In Proceedings of the 28th Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL) (London).
15. JACOBS, B. 1999. Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol. 141. North-Holland, Amsterdam, The Netherlands.
16. KRISHNASWAMI, N., BIRKEDAL, L., ALDRICH, J., AND REYNOLDS, J. 2006. Idealized ML and its separation logic. To appear.
17. LAWVERE, F. 1969. Adjointness in foundations. Dialectica 23, 3-4, 281-296.
18. LEAVANS, G. 1988. Verifying object-oriented programs that use subtypes. Ph.D. thesis, MIT. Published as MIT/LCS/TR-439 in February 1989.
19. LEINO, K. 1995. Toward reliable modular programs. Ph.D. thesis, California Institute of Technology
20. LEINO, K. R. M. AND MÜLLER, P. 2006. A verification methodology for model fields. In Proceedings of the European Symposium on Programming (ESOP), P. Sestoft, ed. Lecture Notes in Computer Science, vol. 3924. Springer, 115-130.
21. LEINO, K. AND MÜLLER, P. 2004. Object invariants in dynamic contexts. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP).
22. LISKOW, B. AND GUTTAG, J. 1986. Abstraction and Specification in Program Development. MIT Press, Cambridge, MA.
23. MACLANE, S. AND MOERDIJK, I. 1994. Sheaves in Geometry and Logic. Universitext. Springer, New York. A first introduction to topos theory, Corrected reprint of the 1992 edition.
24. MITCHELL, J. C. AND PLOTKIN, G. D. 1985. Abstract types have existential type. In Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) (New Orleans, LA), 37-51.
25. MÜLLER, P. 2002. Modular Specification and Verification of Object-Oriented Programs. Lecture Notes in Computer Science, vol. 2262, Springer.
26. NANEVSKI, A., AHMED, A., MORRISETT, G., AND BIRKEDAL, L. 2006. Abstract predicates and mutable ADTs in Hoare type theory. Tech. Rep. TR-14-06, Harvard University.
27. NAUMANN, D. AND BARNETT, M. 2006. Towards imperative modules: Reasoning about invariants and mutable state. Theor. Comput. Sci. 365, 143-168.
28. O'HEARN, P. W. 2004. Resources, concurrency and local reasoning. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR) (London). Lecture Notes in Computer Science, vol. 3170. Springer, 49-67.
29. O'HEARN, P. W., YANG, H., AND REYNOLDS, J. C. 2004. Separation and information hiding. In Proceedings of the 31st ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL) (Venice, Italy). 268-280.
30. O'HEARN, P. W., YANG, H., AND REYNOLDS, J. C. 2003. Separation and information hiding (work in progress). Extended version of O'Hearn et al. [2004].
31. O'HEARN, P. AND PYM, D. J. 1999. The logic of bunched implications. Bull. Symb. Logic 5, 2 (Jun.).
32. PARKINSON, M. AND BIERMAN, G. 2005. Separation logic and abstraction. In Proceedings of the 32nd Annual ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages (POPL) (Long Beach, CA). 247-258.
33. PITTS, A. M. 2001. Categorical logic. In Handbook of Logic in Computer Science, volume 5: Algebraic and Logical Structures, S. Abramsky et al., eds. Clarendon Press, Oxford, UK. Chapter 2.
34. PYM, D. J. 2004. Errata and remarks for the semantics and proof theory of the logic of bunched implications. Addendum to Pym [2002]. http://www.cs.bath.ac.uk/~pym/.
35. PYM, D. 2002. The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logics Series, vol. 26. Kluwer.
36. PYM, D. J., O'HEARN, P. W., AND YANG, H. 2004. Possible worlds and resources: The semantics of BI. Theor. Comput. Sci. 315, 1, 257-305.
37. 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) (Copenhagen, Denmark). IEEE Press 55-74.
38. SILBERSCHATZ, A. AND GALVIN, P. 1998. Operating Systems Concepts, 5th ed. World Student Series. Addison-Wesley, Reading, MA.
39. YANG, H. 2001. Local reasoning for stateful programs. Ph.D. thesis, University of Illinois, UrbanaChampaign.
40. YANG, H. AND O'HEARN, P. 2002. A semantic basis for local reasoning. In Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FOS-SACS) (Grenoble, France). Springer, 402-416.