Proving correctness of highly-concurrent linearisable objects

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn 2006, Issue , 2006, Pages 129-136

  Vafeiadis, Viktor ^a   Herlihy, Maurice ^b   Hoare, Tony ^c   Shapiro, Marc ^d  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b Brown Univerity   (United States)

^c MICROSOFT RESEARCH   (United Kingdom)

^d UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Concurrent programming; Formal verification; Linearisability; Rely guarantee reasoning; Shared memory concurrency

Indexed keywords

BENCHMARKING; COMPUTER PROGRAMMING; CONCURRENCY CONTROL; FORMAL LOGIC; OPTIMIZATION; SYNCHRONIZATION;

CONCURRENT PROGRAMMING; FORMAL VERIFICATION; LINEARISABILITY; RELY-GUARANTEE REASONING; SHARED-MEMORY CONCURRENCY;

DATA STRUCTURES;

EID: 33749871295     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1122971.1122992     Document Type: Conference Paper

References (22)

1. M. Abadi and L. Lamport. Conjoining specifications. ACM Trans. Prog. Lang. Syst., 17(3):507-534, May 1995.
2. R. Bayer and M. Schkolnick. Concurrency of operations on B-Trees. Acta Informatica, 9:1-21, 1977.
3. J. Dingel. Computer-assisted assume/guarantee reasoning with VeriSoft. In Proc. Int. Conference on Software Engineering (ICSE-25), pages 138-148, Portland, Oregon, USA, May 2003. IEEE Computer.
4. S. Doherty, L. Groves, V. Luchangco, and M. Moir, Formal verification of a practical lock-free queue algorithm, In Int. Conf. on Formal Techniques for Networked and Dist. Sys. (FORTE 2004), volume 3235 of Lecture Notes in Computer Science, pages 97-114, Madrid, Spain, Sept. 2004. IFIP WO 6.1, Springer-Verlag.
5. C. Flanagan, S. N. Freund, S. Qadeer, and S. A. Seshia. Modular verification of multithreaded programs. Theoretical Computer Science, 338(1-3):153-183, June 2005.
6. H. Gao, J. F. Groote, and W. H. Hesselink. Lock-free dynamic hash tables with open addressing. Distrib. Computing, 18(1):21-42, July 2005.
7. I. V. Guttag, E. Horowitz, and D. R. Musser, Abstract data types and software validation. Commun. ACM, 21(12):1048-1064, 1978.
8. T.Harris. A pragmatic implementation of non-blocking linked-lists. Lecture Notes in Computer Science, 2180:300-314, 2001.
9. S. Heller, M. Herlihy, V. Luchangco, M. Moir, B. Scherer, and N. Shavit. A lazy concurrent list-based set algorithm. In 9th International Conference on Principles of Distributed Systems (OPODIS), Dec. 2005.
10. T. A. Henzinger, S. Qadeer, and S. K. Rajamani. You assume, we guarantee: Methodology and case studies. In Int. Conf. on Computer-Aided Verification (CAV), volume 1427 of Lecture Notes in Computer Science, pages 440-451, Vancouver, BC, Canada, June 1998. Springer-Verlag.
11. M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Prog. Lang. Syst., 12(3):463-492, July 1990.
12. B. Jacobs, K. R. M. Leino, and W. Schulte. Verification of multithreaded object-oriented programs with invariants, In W. on Specification and Verification of Component-Based Systems, Oct. 2004.
13. C. B. Jones. Specification and design of (parallel) programs. In IFIP Congress, pages 321-332, 1983.
14. L. Lamport. The temporal logic of actions. ACM Trans. Prog. Lang. Syst., 16(3):872-923, 1994.
15. L. Lamport, Composition: A way to make proofs harder. In Proc. COMPOS'97 Symp., volume 1536 of Lecture Notes in Computer Science, pages 402-423, Springer-Verlag, 1997.
16. D. Lea, Concurrent hash map in JSR166 concurrency utilities, http://gee.cs.oswego.edu/dl/concurrency-interest/.
17. N. A. Lynch and M. R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. Symp. on Principles of Distributed Computing, pages 137-151, New York, NY, USA, 1987. ACM Press.
18. M. Michael, High-performance dynamic lock-free hash tables and list-based sets. In Symposium on Parallel Algorithms and Architectures, pages 73-82. ACM Press, 2002.
19. M. Michael and M. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared-memory multiprocessors. Journal of Parallel and Distributed Computing, 51(1):1-26, 1998.
20. P. W. O'Hearn. Resources, concurrency and local reasoning. In CONCUR, pages 49-67, 2004.
21. S. Owicki and D. Gries. Verifying properties of parallel programs: an axiomatic approach, Commun. ACM, 19(5):279-285, May 1976.
22. V. Vafeiadis, M. Herlihy, T. Hoare, and M. Shapiro. A safety proof of a lazy concurrent list-based set implementation. Technical Report UCAM-CL-TR-659, University of Cambridge, Computer Laboratory, 2006.