Technical reports

Automatically proving linearizability

Viktor Vafeiadis

April 2010, 22 pages

Abstract

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

Full text

This report is still under preparation and expected to become available by May 2010.

BibTeX record

@TechReport{UCAM-CL-TR-778,
  author =	 {Vafeiadis, Viktor},
  title = 	 {{Automatically proving linearizability}},
  year = 	 2010,
  month = 	 apr,
  institution =  {University of Cambridge, Computer Laboratory},
  address =	 {15 JJ Thomson Avenue, Cambridge CB3 0FD, United Kingdom,
          	  phone +44 1223 763500},
  number = 	 {UCAM-CL-TR-778}
}