Verifying Concurrent Data Structures by Simulation | Zendy

Robert J. Colvin | Zendy; Simon Doherty | Zendy; Lindsay Groves | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Verifying Concurrent Data Structures by Simulation

Author(s) -

Robert J. Colvin,

Simon Doherty,

Lindsay Groves

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.04.026

Subject(s) - computer science , lock (firearm) , automaton , data structure , simple (philosophy) , stack (abstract data type) , concurrent data structure , parallel computing , discrete event simulation , programming language , theoretical computer science , distributed computing , algorithm , simulation , mechanical engineering , philosophy , epistemology , engineering

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research