Simplifying Linearizability Proofs with Reduction and Abstraction-Reference-Cited by-同舟云学术

Simplifying Linearizability Proofs with Reduction and Abstraction

Published:2010 Issue: Volume: Page:296-311
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Elmas Tayfun,Qadeer Shaz,Sezgin Ali,Subasi Omer,Tasiran Serdar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12002-2_25.pdf

Reference23 articles.

1. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 463–492 (1990)

2. Abadi, M., Lamport, L.: The existence of refinement mappings. Theor. Comput. Sci. 82, 253–284 (1991)

3. Lecture Notes in Computer Science;S. Park,1996

4. Elmas, T., Qadeer, S., Tasiran, S.: A calculus of atomic actions. In: POPL 2009: ACM Symposium on Principles of Programming Languages. ACM, New York (2009)

5. Lecture Notes in Computer Science;V. Vafeiadis,2009

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Embedding Hindsight Reasoning in Separation Logic;Proceedings of the ACM on Programming Languages;2023-06-06

2. A concurrent program logic with a future and history;Proceedings of the ACM on Programming Languages;2022-10-31

3. Later credits: resourceful reasoning for the later modality;Proceedings of the ACM on Programming Languages;2022-08-29

4. Verifying concurrent multicopy search structures;Proceedings of the ACM on Programming Languages;2021-10-20

5. Pointer life cycle types for lock-free data structures with memory reclamation;Proceedings of the ACM on Programming Languages;2020-01