Proving Opacity via Linearizability: A Sound and Complete Method-Reference-Cited by-同舟云学术

Proving Opacity via Linearizability: A Sound and Complete Method

Published:2017 Issue: Volume: Page:50-66
ISSN:0302-9743
Container-title:Formal Techniques for Distributed Objects, Components, and Systems
language:
Short-container-title:

Author:

Armstrong Alasdair,Dongol Brijesh,Doherty Simon

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-60225-7_4

Reference27 articles.

1. Adve, S.V., Aggarwal, J.K.: A unified formalization of four shared-memory models. IEEE Trans. Parallel Distrib. Syst. 4(6), 613–624 (1993)

2. Armstrong, A., Dongol, B., Doherty, S.: Reducing opacity to linearizability: a sound and complete method. arXiv e-prints (October 2016). https://arxiv.org/abs/1610.01004

3. Attiya, H., Gotsman, A., Hans, S., Rinetzky, N.: A programming language perspective on transactional memory consistency. In: Fatourou, P., Taubenfeld, G. (eds.) PODC 2013, pp. 309–318. ACM (2013)

4. Lecture Notes in Computer Science;A Bouajjani,2015

5. Lecture Notes in Computer Science;P Černý,2010

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

1. A verified durable transactional mutex lock for persistent x86-TSO;Formal Methods in System Design;2024-07-31

2. Intel PMDK Transactions: Specification, Validation and Concurrency;Lecture Notes in Computer Science;2024

3. Implementing and verifying release-acquire transactional memory in C11;Proceedings of the ACM on Programming Languages;2022-10-31

4. Modularising Verification Of Durable Opacity;Logical Methods in Computer Science;2022-07-28

5. C4: verified transactional objects;Proceedings of the ACM on Programming Languages;2022-04-29