A separation logic for refining concurrent objects

ACM SIGPLAN Notices

Volumn 46, Issue 1, 2011, Pages 247-258

  Turon, Aaron ^a   Wand, Mitchell ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Algorithms; Verification

Indexed keywords

COMPOSITIONAL REASONING; CONCURRENT DATA STRUCTURES; CONCURRENT OBJECTS; DYNAMIC MEMORY ALLOCATION; SEMANTICS OF SEPARATION; SEPARATION LOGIC;

ALGORITHMS; DATA STRUCTURES; FORMAL LOGIC; REFINING; SEMANTICS; STORAGE ALLOCATION (COMPUTER);

CONCURRENCY CONTROL;

EID: 79251546777     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926415     Document Type: Conference Paper

References (29)

1. R. J. Back and J. von Wright. Refinement calculus: A systematic introduction. Springer, 1998.
2. S. Brookes. Full abstraction for a shared variable parallel language. Information and Computation, 127(2):145-163, 1996.
3. C. Calcagno, P. W. O'Hearn, and H. Yang. Local action and abstract separation logic. In LICS, pages 366-378. IEEE Computer Society, 2007.
4. T. Dinsdale-Young, M. Dodds, P. Gardner, M. Parkinson, and V. Vafeiadis. Concurrent abstract predicates. In ECOOP, June 2010.
5. T. Elmas, S. Qadeer, and S. Tasiran. A calculus of atomic actions. In POPL, pages 2-15. ACM, 2009.
6. T. Elmas, S. Qadeer, A. Sezgin, O. Subasi, and S. Tasiran. Simplifying linearizability proofs with reduction and abstraction. In TACAS, pages 296-311. Springer, 2010.
7. X. Feng. Local rely-guarantee reasoning. In POPL, pages 315-327. ACM, 2009.
8. I. Filipović, P. O'Hearn, N. Rinetzky, and H. Yang. Abstraction for concurrent objects. In ESOP, pages 252-266. Springer, 2009.
9. L. Groves. Reasoning about nonblocking concurrency. JUCS, 15(1): 72-111, 2009.
10. M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2008.
11. M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. TOPLAS, 12(3):463-492, 1990.
12. C. B. Jones. Tentative steps toward a development method for interfering programs. TOPLAS, 5(4):596-619, 1983.
13. A. Kock. Strong functors and monoidal monads. Archiv der Mathematik, 23:113-120, 1971. ISSN 1.
14. R. J. Lipton. Reduction: A method of proving properties of parallel programs. Commun. ACM, 18(12):717-721, 1975.
15. B. Liskov and S. Zilles. Programming with abstract data types. In Symposium on Very high level languages, pages 50-59. ACM, 1974.
16. M. M. Michael. Hazard pointers: Safe memory reclamation for lockfree objects. IEEE Transactions on Parallel and Distributed Systems, 15:491-504, 2004. ISSN 1045-9219.
17. M. M. Michael and M. L. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. J. Parallel Distrib. Comput., 51(1):1-26, 1998.
18. R. Milner. A Calculus of Communicating Systems. Springer-Verlag New York, Inc., 1982.
19. J. C. Mitchell and G. D. Plotkin. Abstract types have existential type. TOPLAS, 10(3):470-502, 1988.
20. M. Moir and N. Shavit. Concurrent data structures. In Handbook of Data Structures and Applications, D. Metha and S. Sahni Editors, pages 47-14-47-30, 2007. Chapman and Hall/CRC Press.
21. C. Morgan and T. Vickers. On the refinement calculus. Springer, 1993.
22. J. H. Morris, Jr. Protection in programming languages. CACM, 16(1): 15-21, 1973.
23. P. W. O'Hearn. Resources, concurrency, and local reasoning. Theor. Comput. Sci., 375(1-3):271-307, 2007.
24. M. Parkinson and G. Bierman. Separation logic and abstraction. POPL, 40(1):247-258, 2005.
25. D. Sangiorgi and D. Walker. Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
26. R. K. Treiber. Systems programming: Coping with parallelism. Technical report, Almaden Research Center, 1986.
27. V. Vafeiadis. Modular fine-grained concurrency verification. PhD thesis, University of Cambridge, 2008.
28. V. Vafeiadis and M. Parkinson. A marriage of rely/guarantee and separation logic. In CONCUR, pages 256-271. Springer, 2007.
29. R. J. van Glabbeek. The linear time - branching time spectrum. In CONCUR, pages 278-297. Springer, 1990.