{"publication_status":"published","publist_id":"1096","type":"conference","citation":{"ieee":"V. Singh, “Runtime verification for software transactional memories,” presented at the RV: International Conference on Runtime Verification, St. Julians, Malta, 2010, vol. 6418, pp. 421–435.","short":"V. Singh, in:, O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, K. Havelund, I. Lee, G. Pace (Eds.), Springer, 2010, pp. 421–435.","apa":"Singh, V. (2010). Runtime verification for software transactional memories. In O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, … G. Pace (Eds.) (Vol. 6418, pp. 421–435). Presented at the RV: International Conference on Runtime Verification, St. Julians, Malta: Springer. https://doi.org/10.1007/978-3-642-16612-9_32","chicago":"Singh, Vasu. “Runtime Verification for Software Transactional Memories.” edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35. Springer, 2010. https://doi.org/10.1007/978-3-642-16612-9_32.","ama":"Singh V. Runtime verification for software transactional memories. In: Sokolsky O, Rosu G, Tilmann N, et al., eds. Vol 6418. Springer; 2010:421-435. doi:10.1007/978-3-642-16612-9_32","mla":"Singh, Vasu. Runtime Verification for Software Transactional Memories. Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:10.1007/978-3-642-16612-9_32.","ista":"Singh V. 2010. Runtime verification for software transactional memories. RV: International Conference on Runtime Verification, LNCS, vol. 6418, 421–435."},"publisher":"Springer","month":"01","scopus_import":1,"volume":6418,"department":[{"_id":"ToHe"}],"date_published":"2010-01-01T00:00:00Z","oa_version":"None","conference":{"name":"RV: International Conference on Runtime Verification","start_date":"2010-11-01","end_date":"2010-11-04","location":"St. Julians, Malta"},"abstract":[{"lang":"eng","text":"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."}],"status":"public","language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:56:25Z","date_created":"2018-12-11T12:08:28Z","author":[{"full_name":"Singh, Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu"}],"title":"Runtime verification for software transactional memories","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","editor":[{"last_name":"Sokolsky","first_name":"Oleg","full_name":"Sokolsky, Oleg"},{"full_name":"Rosu, Grigore","last_name":"Rosu","first_name":"Grigore"},{"last_name":"Tilmann","first_name":"Nikolai","full_name":"Tilmann, Nikolai"},{"last_name":"Barringer","first_name":"Howard","full_name":"Barringer, Howard"},{"full_name":"Falcone, Ylies","first_name":"Ylies","last_name":"Falcone"},{"first_name":"Bernd","last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd"},{"full_name":"Havelund, Klaus","first_name":"Klaus","last_name":"Havelund"},{"full_name":"Lee, Insup","last_name":"Lee","first_name":"Insup"},{"full_name":"Pace, Gordon","last_name":"Pace","first_name":"Gordon"}],"_id":"4362","year":"2010","day":"01","page":"421 - 435","intvolume":" 6418","alternative_title":["LNCS"],"quality_controlled":"1","doi":"10.1007/978-3-642-16612-9_32"}