Resources, concurrency and local reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3170, Issue , 2004, Pages 49-67

  O'Hearn, Peter W ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONCURRENT PROGRAM; LOCAL REASONING; SEPARATION LOGIC;

FORMAL LOGIC;

EID: 35048852049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_4     Document Type: Article

References (23)

1. P. Brinch Hansen. The nucleus of a multiprogramming system. Comm. ACM, 13(4):238-250, 1970.
2. P. Brinch Hansen. Structured multiprogramming. Comm. ACM, 15(7):574-578, 1972. Reprinted in [3J.
3. P. Brinch Hansen, editor. The Origin of Concurrent Programming. Springer-Verlag, 2002.
4. S. D. Brookes. A semantics for concurrent separation logic. This Volume, Springer LNCS, Proceedings of the 15th CONCUR, London. August, 2004.
5. L. Cardelli and L Caires. A spatial logic for concurrency. In 4th International Symposium on Theoretical Aspects of Computer Science, LNCS 2255:1-37, Springer, 2001.
6. L. Cardelli and A. D. Gordon. Anytime, anywhere, modal logics for mobile ambients. In 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 365-377, 2000.
7. D. Clarke, J. Noble, and J. Potter. Simple ownership types for object containment. Proceedings of the 15th European Conference on Object-Oriented Programming, pages 53-76, Springer LNCS 2072, 2001.
8. E. W. Dijkstra. Cooperating sequential processes. In F. Genuys, editor, Programming Languages, pages 43-112. Academic Press, 1968. Reprinted in [3],
9. E. W. Dijkstra. Hierarchical ordering of sequential processes. Acta Informatica, 1 2:115-138, October 1971. Reprinted in [3J.
10. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
11. C. A. R. Hoare. Towards a theory of parallel programming. In Hoare and Perrot, editors, Operating Systems Techniques. Academic Press, 1972. Reprinted in [3J.
12. C. A. R. Hoare. Monitors: An operating system structuring concept. Comm. ACM, 17(10):549-557, 1974. Reprinted in [3J.
13. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
14. C. B. Jones. Specification and design of (parallel) programs. IFIP Conference, 1983.
15. R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203-246. Springer-Verlag, 1993.
16. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In Proceedings of 15th Annual Conference of the European Association for Computer Science Logic, LNCS, pages 1-19. Springer-Verlag, 2001.
17. P. W. O'Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, June 99.
18. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 268-280, Venice, January 2004.
19. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, (19):319-340, 1976.
20. S. Owicki and D. Gries. Verifying properties of parallel programs: An axiomatic approach. Comm. ACM, 19(5):279-285, 1976.
21. A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13(1), 45-60, 1981.0
22. J. C. Reynolds. Separation logic: a logic for shared mutable data structures. Invited Paper, Proceedings of the 17th IEEE Symposium on Logic in Computer Science, pages 55-74, 2002.
23. C. Stirling. A generalization of the Owicki-Gries Hoare logic for a concurrent while language. Theoretical Computer Science, 58:347-359, 1988.