Mechanizing a Correctness Proof for a Lock-Free Concurrent Stack-Reference-Cited by-同舟云学术

Mechanizing a Correctness Proof for a Lock-Free Concurrent Stack

Published:2008 Issue: Volume: Page:78-95
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Derrick John,Schellhorn Gerhard,Wehrheim Heike

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-68863-1_6

Reference22 articles.

1. Abrial, J.-R., Cansell, D.: Formal Construction of a Non-blocking Concurrent Queue Algorithm (a Case Study in Atomicity). Journal of Universal Computer Science 11(5), 744–770 (2005)

2. BCS Practitioner Series;R. Barden,1994

3. Colvin, R., Doherty, S., Groves, L.: Verifying concurrent data structures by simulation. ENTCS 137, 93–110 (2005)

4. Cambridge Tracts in Theoretical Computer Science;W. Roever de,1998

5. Derrick, J., Boiten, E.: Refinement in Z and Object-Z: Foundations and Advanced Applications. Springer, Heidelberg (2001)

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

1. Exploring the Boundaries of Rely/Guarantee and Links to Linearisability;Lecture Notes in Computer Science;2024

2. Two approaches for proving linearizability of multiset;Science of Computer Programming;2014-12

3. A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures;ACM Transactions on Computational Logic;2014-08

4. KIV: overview and VerifyThis competition;International Journal on Software Tools for Technology Transfer;2014-04-16

5. Using Coarse-Grained Abstractions to Verify Linearizability on TSO Architectures;Hardware and Software: Verification and Testing;2014