Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

CAV
2010
Springer

favoriteEmaildiscussreport

198views Hardware» more CAV 2010»

Automatically Proving Linearizability

13 years 8 months ago

Automatically Proving Linearizability

Download www.cl.cam.ac.uk

Abstract. This paper presents a practical automatic veriﬁcation procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure implementations. The procedure employs a novel instrumentation to verify logically pure executions, and is evaluated on a number of standard concurrent stack, queue and set algorithms.

Viktor Vafeiadis

Real-time Traffic

Automatic Veriﬁcation Procedure | CAV 2010 | Concurrent Data Structure | Hardware | Standard Concurrent Stack |

claim paper

Related Content

» Lineup a complete and automatic linearizability checker

» SemiProving An Integrated Method for Program Proving Testing and Debugging

» Speculative linearizability

» Model Checking Linearizability via Refinement

» ShapeValue Abstraction for Verifying Linearizability

» Linearizability with Ownership Transfer

» Model Checking of Linearizability of Concurrent List Implementations

» Proving Atomicity An Assertional Approach

» LivenessPreserving Atomicity Abstraction

Post Info
More Details (n/a)

Added	15 Aug 2010
Updated	15 Aug 2010
Type	Conference
Year	2010
Where	CAV
Authors	Viktor Vafeiadis

Comments (0)