Variables as Resource in Separation Logic

Electronic Notes in Theoretical Computer Science

Volumn 155, Issue 1 SPEC. ISS., 2006, Pages 247-276

  Bornat, Richard ^a   Calcagno, Cristiano ^b   Yang, Hongseok ^c  

^a MIDDLESEX UNIVERSITY   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c Seoul National University   (South Korea)

Author keywords

proof; separation; variables; verification

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; DATA STRUCTURES; REYNOLDS NUMBER;

CONCURRENT PROGRAMS; PROOFS; VARIABLES; VERIFICATIONS;

FORMAL LOGIC;

EID: 33646252941     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.11.059     Document Type: Article

References (22)

1. The jape web site, http://www.jape.org.uk, latest versions of Jape for various platforms
2. Andrews, G., "Concurrent Programming: Principles and Practice," Benjamin Cummings, 1991
3. Bornat, R., Proving pointer programs in Hoare logic, in: R. C. Backhouse and J. N. Oliveira, editors, Mathematics of Program Construction, 5th International Conference, LNCS (2000), pp. 102-126
4. Bornat, R., C. Calcagno, P. O'Hearn and M. Parkinson, Permission accounting in separation logic, in: POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages (2005), pp. 259-270
5. Boyland J. Checking interference with fractional permissions. In: Cousot R. (Ed). Static Analysis: 10th International Symposium. Lecture Notes in Computer Science 2694 (2003) 55-72
6. In: Brinch Hansen P. (Ed). The Origin of Concurrent Programming (2002), Springer-Verlag
7. Brookes S.D. A semantics for concurrent separation logic. CONCUR'04: 15th International Conference on Concurrency Theory. Lecture Notes in Computer Science 3170 (2004) 16-34 extended version to appear in Theoretical Computer Science
8. Burstall R. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence 7 (1972) 23-50
9. Courtois P.J., Heymans F., and Parnas D.L. Concurrent control with "readers" and "writers". Commun. ACM 14 (1971) 667-668
10. Dijkstra E.W. Cooperating sequential processes. In: Genuys F. (Ed). Programming Languages (1968), Academic Press 43-112 reprinted in [6]
11. Habermann, A. N., Synchronization of communicating processes, in: Proceedings of the third ACM symposium on Operating systems principles (1971), p. 80
12. Hoare C.A.R. Towards a theory of parallel programming. In: Hoare, and Perrott (Eds). Operating System Techniques (1972), Academic Press 61-71 reprinted in [6]
13. O'Hearn, P., Notes on separation logic for shared-variable concurrency (2002), unpublished
14. O'Hearn P., Reynolds J., and Yang H. Local reasoning about programs that alter data structures. In: Fribourg L. (Ed). CSL 2001. LNCS 2142 (2001) 1-19
15. O'Hearn, P. W., Resources, concurrency and local reasoning, to appear in Theoretical Computer Science; preliminary version published as [16]
16. O'Hearn P.W. Resources, concurrency and local reasoning. CONCUR'04: 15th International Conference on Concurrency Theory. Lecture Notes in Computer Science 3170 (2004) 49-67 extended version is [15]
17. O'Hearn P.W., and Pym D.J. The logic of bunched implications. Bulletin of Symbolic Logic 5 (1999) 215-244
18. Owicki S., and Gries D. Verifying properties of parallel programs: An axiomatic approach. Comm. ACM 19 (1976) 279-285
19. Pym D. The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series 26 (2002), Kluwer Academic Publishers
20. Reynolds J.C. Intuitionistic reasoning about shared mutable data structure. In: Davies J., Roscoe B., and Woodcock J. (Eds). Millennial Perspectives in Computer Science (2000), Palgrave 303-321
21. Reynolds, J. C., Separation logic: A logic for shared mutable data structures, in: LICS '02: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002), pp. 55-74
22. Yang, H. and P. O'Hearn, A semantic basis for local reasoning, in: 5th FOSSACS (2002), pp. 402-416