Reasoning about nonblocking concurrency using reduction

Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems, ICECCS

Volumn , Issue , 2007, Pages 107-116

  Groves, Lindsay ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

% REDUCTIONS; COMPLEX CODES; CONCURRENT PROCESS; CONCURRENTS PROGRAMS; NON-BLOCKING; NONBLOCKING ALGORITHMS; PROPERTY; REDUCTION METHOD; SYNCHRONIZATION PRIMITIVE; TRADITIONAL APPROACHES;

CODES (SYMBOLS);

EID: 46749108055     PISSN: 27708527     EISSN: 27708535     Source Type: Conference Proceeding    
DOI: 10.1109/ICECCS.2007.39     Document Type: Conference Paper

References (41)

1. R.-J. Back. Atomicity refinement in a refinement calculus framework. Reports on Computer Science and Mathematics 141, Abo Akademi. 1993.
2. E. Cohen. Separation and reduction. In Proc. 5th International Conference on Mathematics of Program Construction (MPC), pages 45-59. London, UK. 2000. Springer-Verlag.
3. E. Cohen. Private communication, January 2007.
4. E. Cohen and L. Lamport. Reduction in TLA. In International Conference on Concurrency Theory (CONCUR), pages 317-331, 1998.
5. R. Colvin, S. Doherty, and L. Groves. Verifying concurrent data structures by simulation. In E. Boiten and J. Derrick, editors, Proc. Refinement Workshop (REFINE 2005), volume 137(2) of Electronic Notes in Theoretical Computer Science, pages 93-110. Guildford, UK, April 2005. Elsevier.
6. R. Colvin and L. Groves. Formal verification of an arraybased nonblocking queue. In Proc. International Conference on Engineering of Complex Computer Systems (ICECCS), pages 92-101, New York, NY, USA, 2005. ACM Press.
7. R. Colvin and L. Groves. Verification of a scalable lock-free stack algorithm. Computer Science Technical Report CSTR-06-14. Victoria University of Wellington, April 2006.
8. R. Colvin, L. Groves, V. Luchangco, and M. Moir. Formal verification of a lazy concurrent list-based set algorithm. In T. Ball and R. B. Jones, editors, Proc. 18th International Conference on Computer Aided Verification (CAV), volume 4144 of Lecture Notes in Computer Science, pages 475-488. Springer, August 2006.
9. D. L. Detlefs, P. A. Martin, M. Moir. and G. L. Steel Jr. Lock-free reference counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing., August 2001.
10. T. W. Doeppner, Jr. Parallel program correctness through refinement. In Proc. 4th ACM SIGACT-SIGPIAN Symposium on Principles of Programming Languages (POPL), pages 155-169. ACM Press. 1977.
11. S. Doherty. Modelling and verifying non-blocking algorithms that use dynamically allocated memory. Master's thesis, School of Mathematical and Computing Sciences, Victoria University of Wellington, 2003.
12. S. Doherty, L. Groves, V. Luchangco, and M. Moir. Formal verification of a practical lock-free queue algoritlim. In D. de Frutos-Escrig and M. Núñez, editors. Formal Techniques for Networked and Distributed Systems (FORTE), volume 3235 of Lecture Notes in Computer Science, pages 97-114. Springer, 2004.
13. S. Doherty. M. Herlihy, V. Luchangco, and M. Moir. Bringing practical lock-free synchronization to 64-bit applications. In S. Chaudhuri and S. Kutten, editors, PODC, pages 31-39. ACM, 2004.
14. C. Flanagan and S. Freund. Atomizer: a dynamic atomicity checker for multithreaded programs. In Proc. 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). pages 256-267, 2004.
15. C. Flanagan and S. Qadeer. A type and effect system for atomicity. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 338-349, 2003.
16. L. Groves and R. Colvin. Derivation of a scalable lock-free stack algorithm. In International Refinement Workshop (Refine 2006), Electronic Notes in Theoretical Computer Science. Elsevier. 2006.
17. J. Hatcliff, Robby, and M. B. Dwyer. Verifying atomicity specifications for concurrent object-oriented software using model checking. In Proc. Fifth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI), pages 175-190, 2004.
18. D. Hendler, N. Shavit, and L. Yerushalmi. A scalable lockfree stack algorithm. In SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallel Algorithms, June 27-30, 2004. Barcelona, Spain, pages 206-215, 2004.
19. M. Herlihy. Wait-free synchronization. ACM Trans. Program. Lang. Syst., 13(1): 124-149, 1991.
20. M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting dynamic-sized, lockfree data structures. In 16th International Conference on Distributed Computing (DISC 2002), volume 2508 of Lecture Notes in Computer Science, pages 339-353, Toulouse, France, October 2002.
21. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. TOPLAS. 12(3):463-492. 1990.
22. W. H. Hesselink. An assertional criterion for atomicity. Acta Informatica. 28(5):343-366. 2002.
23. C.Jones. Development methods for computer programs including a notion of interference. PhD thesis. Oxford University. 1981. Available as: Programming Research Group, Technical Monograph, PRG-25.
24. L. Lamport. A theorem on atomicity in distributed algorithms. Distributed Computing, 4(2):59-68, 1990.
25. L. Lamport and F. B. Schneider. Pretending atomicity. Technical Report TR89-1005. DIiC. SRC, 1989.
26. R. J. Lipton. Reduction: a method of proving properties of parallel programs. Communications of the ACM, 18(12):717-721, December 1975.
27. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
28. N. A. Lynch and F. W. Vaandrager. Forward and backward simulations: I. Untimed systems. Inf. Comput., 121(2):214-233, 1995.
29. M. M. Michael. Practical lock-free and wait-free LL/SC/VL implementations using 64-bit CAS. In R. Guerraoui, editor. DISC, volume 3274 of Lecture Notes in Computer Science, pages 144-158. Springer. 2004.
30. M. M. Michael and M. L. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. J. Parallel Distrik Comput., 51(1):1-26. 1998.
31. M. Moir. Practical implementations of non-blocking synchronization primitives. In Proc. 15th Annual ACM Symposium on the Principles of Distributed Computing (PODC 1997), Santa Barbara, CA, pages 219-228, August 1997.
32. M. Moir, D. Nussbaum. O. Shalev, and N. Shavit. Using elimination to implement scalable and lock-free lifo queues. In Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005). pages 253-262, Las Vegas, Nevada. USA, 2005. ACM Press.
33. S. Owicki and D. dries. An axiomatic proof technique for parallel programs I. Acta Informatica. 6:319-340. 1976.
34. A. Sasturkar. R. Agarwal, L. Wang, and S. D. Stoller. Automated type-based analysis of data races and atomicity. In PPoPP '05: Proceedings of the tenth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 83-94, New York, NY, USA, 2005. ACM Press.
35. N. Shavit and M. Moir. Concurrent data structures. In D. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications. Chapman & Hall/CRC Press, 2004.
36. M. Spivey. The Z Notation: A Reference Manual. Prentice-Hall International. 1988. Second edition. 1992.
37. S. D. Stoller and E. Cohen. Optimistic synchronization-based state-space reduction. Formal Methods in System Design, 28(3):263-289, 2006.
38. R. K. Treiber. Systems Programming: Coping with Parallelism. RJ5118. Technical report. IBM Almaden Research Center. April 1986.
39. L. Wang and S. D. Stoller. Static analysis of atomicity for programs with non-blocking synchronization. In PPoPP '05: Proceedings of the tenth ACM SIGPIAN symposium on Principles and practice of parallel programming, pages 61-71, New York. NY, USA, 2005. ACM Press.
40. L. Wang and S. D. Stoller. Runtime analysis of atomicity for multithreaded programs. IEEE Trans. Softw. ling., 32(2):93-110, 2006.
41. Q. Xu. W. P. de Roever, and J. He. The rely-guarantee method for verifying shared variable concurrent programs. Formal Aspects of Computing, 9(2):149-174. 1997.