Variables as resource in Hoare logics

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 137-146

  Parkinson, Matthew ^a   Bornat, Richard ^a   Calcagno, Cristiano ^b  

^a MIDDLESEX UNIVERSITY   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER AIDED LANGUAGE TRANSLATION; COMPUTER PROGRAMMING; PARAMETER ESTIMATION;

HOARE LOGIC; PARAMETER ALIASING; SEPARATION LOGIC; SIDE CONDITIONS;

FORMAL LOGIC;

EID: 34547291013     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.52     Document Type: Conference Paper

References (20)

1. G. Andrews. Concurrent Programming: Principles and Practice. Benjamin Cummings, 1991.
2. J. Berdine, C. Calcagno, and P. W. O'Hearn. Modular automatic assertion checking with separation logic. Draft, Nov. 2005.
3. R. Bornat, 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, pages 259-270, New York, NY, USA, Jan. 2005. ACM Press.
4. R. Bornat, C. Calcagno, and H. Yang. Variables as resource in separation logic. Presented at MFPS XXI, Birmingham, May 2005. To appear in Electronic Notes in Computer Science, 2005.
5. S. Brookes. Variables as resource for shared-memory programs: Semantics and soundness. In Proceedings of MFPS XXII. Elsevier ENTCS., May 2006.
6. S. D. Brookes. A semantics for concurrent separation logic. In CONCUR'04:15th International Conference on Concurrency Theory, volume 3170 of Lecture Notes in Computer Science, pages 16-34, London, Aug. 2004. Springer.
7. Extended version to appear in Theoretical. Computer Science.
8. R. Cartwright and D. Oppen. Unrestricted procedure calls in hoare's logic. In POPL '78: Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 131-140, New York, 1978. ACM Press.
9. P. J. Courtois, F. Heymans, and D. L. Parnas. Concurrent control with "readers" and "writers". Commun. ACM, 14(10):667-668, 1971.
10. D. Gries and G. Levin. Assignment and procedure call proof rules. ACM Transactions on Programming languages and Systems, 2(4), Oct. 1980.
11. C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10):576-580, 1969.
12. C. A. R. Hoare. Towards a theory of parallel programming. Operating Systems Techniques, 1971.
13. S. S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In Symposium on Principles of Programming Languages, pages 14-26, 2001.
14. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In L. Fribourg, editor, CSL 2001, pages 1-19. Springer-Verlag, 2001. LNCS 2142.
15. P. W. O'Hearn. Resources, concurrency and local reasoning. To appear in Theoretical Computer Science; preliminary version published as [15].
16. P. W. O'Hearn. Resources, concurrency and local reasoning. In CONCUR'04: 15th International Conference on Concurrency Theory, volume 3170 of Lecture Notes in Computer Science, pages 49-67, London, Aug. 2004. Springer. Extended version is [14].
17. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 19:319-340, 1976.
18. J. C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In J. Davies, B. Roscoe, and J. Woodcock, editors, Millennial Perspectives in Computer Science, pages 303-321. Palgrave, 2000.
19. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS '02: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pages 55-74, Washington, DC, USA, 2002. IEEE Computer Society.
20. C. Strachey. Fundamental concepts in programming languages. Higher Order Symbolic Computation, 13(1-2): 11-49, 2000.