---
res:
  bibo_abstract:
  - 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vasu
      foaf_name: Singh, Vasu
      foaf_surname: Singh
      foaf_workInfoHomepage: http://www.librecat.org/personId=4DAE2708-F248-11E8-B48F-1D18A9856A87
  bibo_doi: 10.1007/978-3-642-16612-9_32
  bibo_volume: 6418
  dct_date: 2010^xs_gYear
  dct_language: eng
  dct_publisher: Springer@
  dct_title: Runtime verification for software transactional memories@
...