Marathon: detecting atomic-set serializability violations with conflict graphs

  • Authors:
  • William N. Sumner;Christian Hammer;Julian Dolby

  • Affiliations:
  • Purdue University, West Lafayette, IN;Purdue University, West Lafayette, IN, USA,Utah State University, Logan, UT;IBM T.J. Watson Research Center, Hawthorne, NY

  • Venue:
  • RV'11 Proceedings of the Second international conference on Runtime verification
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent research has proposed several analyses to mitigate the fact that finding concurrency bugs in multi-threaded software is notoriously hard. This work proposes a new analysis based on a correctness criterion called "atomic-set serializability", which incorporates both race conditions and traditional atomicity/serializability. We present a novel analysis based on conflict cycle detection that is guaranteed to find all violations in the intercepted execution trace. A set of heuristics automatically determines all annotations required for atomic-set serializability. We implemented the analysis and evaluated it on a suite consisting of real programs and benchmarks. The evaluation demonstrates the usefulness of our heuristics by finding a number of known (as well as new) violations with competitive overhead and a very low false positive rate.