Verifying concurrent data structures by simulation
From MaRDI portal
Publication:2863833
Recommendations
- Testing and verifying concurrent objects
- A sound and complete proof technique for linearizability of concurrent data structures
- An integrated specification and verification technique for highly concurrent data structures
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Automatically verifying concurrent queue algorithms
Cited in
(13)- Verifying correctness of persistent concurrent data structures: a sound and complete method
- Towards formally specifying and verifying transactional memory
- Proving linearizability with temporal logic
- Simulation Refinement for Concurrency Verification
- Nonblocking Algorithms and Backward Simulation
- Decomposable relaxation for concurrent data structures
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Reasoning about nonblocking concurrency
- An integrated specification and verification technique for highly concurrent data structures
- Testing and verifying concurrent objects
- A sound and complete proof technique for linearizability of concurrent data structures
- A fine-grained semantics for arrays and pointers under weak memory models
- Computer Aided Verification
This page was built for publication: Verifying concurrent data structures by simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863833)