Quantitative reasoning for proving lock-freedom

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2013, Pages 124-133

  Hoffmann, Jan ^a   Marmar, Michael ^a   Shao, Zhong ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Concurrency; Liveness; Lock Freedom; Non Blocking Data Structures; Quantitative Analysis; Separation Logic

Indexed keywords

CONCURRENCY; LIVENESS; LOCK FREEDOMS; NON-BLOCKING; SEPARATION LOGIC;

CHEMICAL ANALYSIS; CONCURRENCY CONTROL; DATA STRUCTURES; FORMAL LOGIC;

LOCKS (FASTENERS);

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

References (36)

1. W. N. Scherer III, D. Lea, and M. L. Scott, "Scalable Synchronous Queues, " Commun. ACM, vol. 52, no. 5, pp. 100-111, 2009.
2. N. Shavit, "Data Structures in the Multicore Age, " Commun. ACM, vol. 54, no. 3, pp. 76-84, 2011.
3. M. P. Herlihy and J. M. Wing, "Linearizability: A Correctness Condition for Concurrent Objects, " ACM Trans. Program. Lang. Syst., vol. 12, no. 3, pp. 463-492, 1990.
4. M. Herlihy, "Wait-Free Synchronization, " ACM Trans. Program. Lang. Syst., vol. 13, no. 1, pp. 124-149, 1991.
5. M. Herlihy, V. Luchangco, and M. Moir, "Obstruction-Free Synchronization: Double-Ended Queues as an Example, " in 23rd Int. Conf. on Distributed Comp. Systems (ICDCS'03), 2003.
6. R. K. Treiber, "Systems Programming: Coping with Parallelism, " IBM Almaden Research Center, Tech. Rep. RJ 5118, 1986.
7. M. M. Michael and M. L. Scott, "Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms, " in 15th Symp. on Principles of Distributed Computing (PODC'96), 1996, pp. 267-275.
8. M. M. Michael, "Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects, " IEEE Trans. Parallel Distrib. Syst., vol. 15, no. 6, pp. 491-504, 2004.
9. D. Hendler, N. Shavit, and L. Yerushalmi, "A Scalable Lock-Free Stack Algorithm, " in 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'04), 2004, pp. 206-215.
10. R. Colvin and B. Dongol, "Verifying Lock-Freedom Using Well-Founded Orders, " in Theoretical Aspects of Computing-4th International Colloquium (ICTAC'07), 2007, pp. 124-138.
11. E. Petrank, M. Musuvathi, and B. Steesngaard, "Progress Guarantee for Parallel Programs via Bounded Lock-Freedom, " in Conf. on Prog. Lang. Design and Impl. (PLDI'09), 2009, pp. 144-154.
12. B. Tofan, S. Bäumler, G. Schellhorn, and W. Reif, "Temporal Logic Verification of Lock-Freedom, " in Mathematics of Prog. Construction, 10th Int. Conf., (MPC'10), 2010, pp. 377-396.
13. A. Gotsman, B. Cook, M. Parkinson, and V. Vafeiadis, "Proving that Non-Blocking Algorithms Don't Block, " in 36th Symp. on Principles of Prog. Lang. (POPL'09), 2009, pp. 16-28.
14. P. W. O'Hearn, "Resources, concurrency, and local reasoning, " Theor. Comput. Sci., vol. 375, no. 1-3, pp. 271-307, 2007.
15. V. Vafeiadis and M. J. Parkinson, "A Marriage of Rely/Guarantee and Separation Logic, " in Concurrency Theory, 18th Int. Conference (CONCUR'07), 2007, pp. 256-271.
16. X. Feng, "Local Rely-Guarantee Reasoning, " in 36th Symp. on Principles of Prog. Langs. (POPL'09), 2009, pp. 315-327.
17. T. Dinsdale-Young, M. Dodds, P. Gardner, M. J. Parkinson, and V. Vafeiadis, "Concurrent Abstract Predicates, " in Object-Oriented Programming, 24th European Conf. (ECOOP'10), 2010, pp. 504-528.
18. M. Parkinson, R. Bornat, and P. O'Hearn, "Modular Verification of a Non-Blocking Stack, " in 34th Symp. on Principles of Prog. Lang. (POPL'07), 2007, pp. 297-302.
19. R. Atkey, "Amortised Resource Analysis with Separation Logic, " in 19th European Symposium on Programming (ESOP'10), 2010, pp. 85-103.
20. S. S. Owicki and D. Gries, "Verifying Properties of Parallel Programs: An Axiomatic Approach, " Commun. ACM, vol. 19, no. 5, pp. 279-285, 1976.
21. R. Bornat, C. Calcagno, P. O'Hearn, and M. Parkinson, "Permission Accounting in Separation Logic, " in 32nd Symp. on Principles of Prog. Lang. (POPL'05), 2005, pp. 259-270.
22. J. Hoffmann, M. Marmar, and Z. Shao, "Quantitative Reasoning for Proving Lock-Freedom, " Yale University, Tech. Rep. YALEU/DCS/TR-1476, 2013, http://cs-www. cs. yale. edu/homes/hoffmann/papers/lockfree2013-tr. pdf.
23. S. S. Ishtiaq and P. W. O'Hearn, "BI as an Assertion Language for Mutable Data Structures, " in 28th Symp. on Principles of Prog. Lang. (POPL'01), 2001, pp. 14-26.
24. J. C. Reynolds, "Separation Logic: A Logic for Shared Mutable Data Structures, " in 17th IEEE Symp on Logic in Computer Science (LICS'02), 2002, pp. 55-74.
25. C. A. R. Hoare, "An Axiomatic Basis for Computer Programming, " Commun. ACM, vol. 12, no. 10, pp. 576-580, 1969.
26. P. W. O'Hearn and D. J. Pym, "The Logic of Bunched Implications, " Bulletin of Symbolic Logic, vol. 5, no. 2, pp. 215-244, 1999.
27. V. Vafeiadis, "Concurrent Separation Logic and Operational Semantics, " Electr. Notes Theor. Comput. Sci., vol. 276, pp. 335-351, 2011.
28. M. J. Parkinson and G. M. Bierman, "Separation Logic and Abstraction, " in 32nd Symp. on Principles of Prog. Lang. (POPL'05), 2005, pp. 247-258.
29. T. Dinsdale-Young, M. Dodds, P. Gardner, M. J. Parkinson, and V. Vafeiadis, "Concurrent Abstract Predicates, " in Object-Oriented Programming, 24th European Conf. (ECOOP'10), 2010, pp. 504-528.
30. T. L. Harris, "A Pragmatic Implementation of Non-blocking Linked-Lists, " in 15th International Conf. on Distributed Computing (DISC'01), 2001, pp. 300-314.
31. M. Greenwald, "Non-blocking Synchronization and System Design, " Ph. D. dissertation, Stanford University, 1999, tR STAN-CS-TR-99-1624.
32. M. Hofmann and S. Jost, "Static Prediction of Heap Space Usage for First-Order Functional Programs, " in 30th Symp. on Principles of Prog. Lang. (POPL'03), 2003, pp. 185-197.
33. V. Vafeiadis, "Modular Fine-Grained Concurrency Verification, " Ph. D. dissertation, University of Cambridge, 2007, tR UCAM-CL-TR-726.
34. M. Fu, Y. Li, X. Feng, Z. Shao, and Y. Zhang, "Reasoning about Optimistic Concurrency Using a Program Logic for History, " in Concurrency Theory, 21th Int. Conference (CONCUR'10), 2010, pp. 388-402.
35. R. Colvin and B. Dongol, "A General Technique for Proving Lock-Freedom, " Sci. Comput. Program., vol. 74, no. 3, pp. 143-165, 2009.
36. N. Kobayashi and D. Sangiorgi, "A Hybrid Type System for Lock-Freedom of Mobile Processes, " ACM Trans. Program. Lang. Syst., vol. 32, no. 5, 2010.