Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Runtime Verification for Software Transactional Memories
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict graph algorithm for verifying correctness of STMs, we develop
TRACER
, a tool for runtime verification of STM implementations. The novelty of
TRACER
lies in the way it combines coarse and precise runtime analyses to guarantee sound and complete verification in an efficient manner. We implement
TRACER
in the TL2 STM implementation. We evaluate the performance of
TRACER
on STAMP benchmarks. While a precise runtime verification technique based on conflict graphs results in an average slowdown of 60x, the two-level approach of
TRACER
performs complete verification with an average slowdown of around 25x across different benchmarks.