Author:
Tofan Bogdan,Bäumler Simon,Schellhorn Gerhard,Reif Wolfgang
Publisher
Springer Berlin Heidelberg
Reference37 articles.
1. Treiber, R.K.: System programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center (1986)
2. Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: SPAA ’04: ACM symposium on Parallelism in algorithms and architectures, pp. 206–215. ACM Press, New York (2004)
3. Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proc. 15th ACM Symp. on Principles of Distributed Computing, pp. 267–275 (1996)
4. Lecture Notes in Computer Science;M.M. Michael,2003
5. Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA 2002, pp. 73–82. ACM, New York (2002)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Practical Progress Verification of Descriptor-Based Non-Blocking Data Structures;2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS);2019-10
2. Verifying Linearisability;ACM Computing Surveys;2015-11-21
3. Two approaches for proving linearizability of multiset;Science of Computer Programming;2014-12
4. A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures;ACM Transactions on Computational Logic;2014-08
5. RGITL: A temporal logic framework for compositional reasoning about interleaved programs;Annals of Mathematics and Artificial Intelligence;2014-01-29