![]() |
CiteULike | ![]() |
CLLC's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Verifying Concurrent Data Structures by SimulationElectronic Notes in Theoretical Computer Science In Proceedings of the REFINE 2005 Workshop (REFINE 2005), Vol. 137, No. 2. (21 July 2005), pp. 93-110.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe describe an approach to verifying concurrent data structures based on simulation between two Input/Output Automata (IOAs), modelling the specification and the implementation. We explain how we used this approach in mechanically verifying a simple lock-free stack implementation using forward simulation, and briefly discuss our experience in verifying three other lock-free algorithms which all required the use of backward simulation.
BibTeX record
RIS record