{"type":"conference","page":"21 - 35","doi":"10.1007/978-3-540-85361-9_6","day":"30","author":[{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Vasu Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh"}],"month":"07","date_updated":"2021-01-12T07:56:35Z","extern":1,"conference":{"name":"CONCUR: Concurrency Theory"},"date_published":"2008-07-30T00:00:00Z","publication_status":"published","citation":{"ama":"Guerraoui R, Henzinger TA, Singh V. Completeness and nondeterminism in model checking transactional memories. In: Vol 5201. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2008:21-35. doi:<a href=\"https://doi.org/10.1007/978-3-540-85361-9_6\">10.1007/978-3-540-85361-9_6</a>","ista":"Guerraoui R, Henzinger TA, Singh V. 2008. Completeness and nondeterminism in model checking transactional memories. CONCUR: Concurrency Theory, LNCS, vol. 5201, 21–35.","chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Completeness and Nondeterminism in Model Checking Transactional Memories,” 5201:21–35. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. <a href=\"https://doi.org/10.1007/978-3-540-85361-9_6\">https://doi.org/10.1007/978-3-540-85361-9_6</a>.","apa":"Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2008). Completeness and nondeterminism in model checking transactional memories (Vol. 5201, pp. 21–35). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-540-85361-9_6\">https://doi.org/10.1007/978-3-540-85361-9_6</a>","short":"R. Guerraoui, T.A. Henzinger, V. Singh, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 21–35.","mla":"Guerraoui, Rachid, et al. <i>Completeness and Nondeterminism in Model Checking Transactional Memories</i>. Vol. 5201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 21–35, doi:<a href=\"https://doi.org/10.1007/978-3-540-85361-9_6\">10.1007/978-3-540-85361-9_6</a>.","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Completeness and nondeterminism in model checking transactional memories,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201, pp. 21–35."},"_id":"4387","main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/%7Etah/Publications/completeness_and_nondeterminism_in_model_checking_transactional_memories.pdf"}],"abstract":[{"text":"Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first deterministic specification automata for strict serializability and opacity in STMs. Using an antichain-based tool, we show our deterministic specifications to be equivalent to more intuitive, nondeterministic specification automata (which are too large to be determinized automatically). Using deterministic specification automata, we obtain a complete verification tool for STMs. We also show how to model and verify contention management within STMs. We automatically check the opacity of popular STM algorithms, such as TL2 and DSTM, with a universal contention manager. The universal contention manager is nondeterministic and establishes correctness for all possible contention management schemes.","lang":"eng"}],"intvolume":"      5201","date_created":"2018-12-11T12:08:35Z","publist_id":"1071","volume":5201,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2008","title":"Completeness and nondeterminism in model checking transactional memories","quality_controlled":0,"acknowledgement":"This research was supported by the Swiss National Science Foundation.","status":"public","alternative_title":["LNCS"]}