Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10329384 | Electronic Notes in Theoretical Computer Science | 2005 | 18 Pages |
Abstract
We 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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Robert Colvin, Simon Doherty, Lindsay Groves,