Skip to main navigation Skip to search Skip to main content

Formal verification of scalable nonzero indicators

  • Shao Jie Zhang
  • , Yang Liu
  • , Jun Sun
  • , Jin Song Dong
  • , Wei Chen
  • , Yanhong A. Liu
  • National University of Singapore
  • Microsoft USA

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Concurrent algorithms are notoriously difficult to design correctly, and high performance algorithms that make little or no use of locks even more so. In this paper, we describe a formal verification of a recent concurrent data structure Scalable NonZero Indicators. The algorithm supports incrementing, decrementing, and querying the shared counter in an efficient and linearizable way without blocking. The algorithm is highly non-trivial and it is challenging to prove the correctness. We have proved that the algorithm satisfies linearizability, by showing a trace refinement relation from the concrete implementation to its abstract specification. These models are specified in CSP and verified automatically using the model checking toolkit PAT.

Original languageEnglish
Title of host publicationProceedings of the 21st International Conference on Software Engineering and Knowledge Engineering, SEKE 2009
Pages406-411
Number of pages6
StatePublished - 2009
Event21st International Conference on Software Engineering and Knowledge Engineering, SEKE 2009 - Boston, MA, United States
Duration: Jul 1 2009Jul 3 2009

Publication series

NameProceedings of the 21st International Conference on Software Engineering and Knowledge Engineering, SEKE 2009

Conference

Conference21st International Conference on Software Engineering and Knowledge Engineering, SEKE 2009
Country/TerritoryUnited States
CityBoston, MA
Period07/1/0907/3/09

Fingerprint

Dive into the research topics of 'Formal verification of scalable nonzero indicators'. Together they form a unique fingerprint.

Cite this