{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:11:22Z","timestamp":1763467882701,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,14]],"date-time":"2008-06-14T00:00:00Z","timestamp":1213401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,14]]},"DOI":"10.1145\/1378533.1378585","type":"proceedings-article","created":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T13:49:02Z","timestamp":1213710542000},"page":"297-303","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Dreadlocks"],"prefix":"10.1145","author":[{"given":"Eric","family":"Koskinen","sequence":"first","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.489078"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199906)29:7%3C577::AID-SPE246%3E3.0.CO;2-V"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_6_1","volume-title":"ACM SIGPLAN Workshop on Transactional Computing","author":"Dice D.","year":"2006","unstructured":"Dice , D. , and Shavit , N . What really makes transactions fast . ACM SIGPLAN Workshop on Transactional Computing , Ottawa, ON, Canada, June ( 2006 ). Dice, D., and Shavit, N. What really makes transactions fast. ACM SIGPLAN Workshop on Transactional Computing, Ottawa, ON, Canada, June(2006)."},{"key":"e_1_3_2_1_7_1","volume-title":"Software transactional memory should not be obstruction-free. Unpublished manuscript","author":"Ennals R.","year":"2005","unstructured":"Ennals , R. Software transactional memory should not be obstruction-free. Unpublished manuscript , Intel Research Cambridge( 2005 ). Ennals, R. Software transactional memory should not be obstruction-free. Unpublished manuscript, Intel Research Cambridge(2005)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345237"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_10_1","volume-title":"The Spin Model Checker: Primer and Reference Manual","author":"Holzmann G.","year":"2004","unstructured":"Holzmann , G. The Spin Model Checker: Primer and Reference Manual . Addison-Wesley , 2004 . Holzmann, G. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2004."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/503271.503216"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/45075.46163"},{"key":"e_1_3_2_1_13_1","volume-title":"ATEC'05: Proceedings of the USENIX Annual Technical Conference 2005 on USENIX Annual Technical Conference","author":"Li T.","year":"2005","unstructured":"Li , T. , Ellis , C. S. , Lebeck , A. R. , and Sorin , D. J . Pulse: a dynamic deadlock detection mechanism using speculative execution . In ATEC'05: Proceedings of the USENIX Annual Technical Conference 2005 on USENIX Annual Technical Conference ( Berkeley, CA, USA , 2005 ), USENIX Association, pp. 3--3. Li, T., Ellis, C. S., Lebeck, A. R., and Sorin, D. J. Pulse: a dynamic deadlock detection mechanism using speculative execution. In ATEC'05: Proceedings of the USENIX Annual Technical Conference 2005 on USENIX Annual Technical Conference (Berkeley, CA, USA, 2005), USENIX Association, pp. 3--3."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.701"},{"key":"e_1_3_2_1_15_1","volume-title":"Industrial Strength Formal Specification Techniques, 1998. Proceedings. 2nd IEEE Workshop on","author":"Mikk E.","year":"1998","unstructured":"Mikk , E. , Lakhnech , Y. , Siegel , M. , and Holzmann , G . Implementing statecharts in PROMELA\/SPIN . Industrial Strength Formal Specification Techniques, 1998. Proceedings. 2nd IEEE Workshop on ( 1998 ), 90--101. Mikk, E., Lakhnech, Y., Siegel, M., and Holzmann, G. Implementing statecharts in PROMELA\/SPIN. Industrial Strength Formal Specification Techniques, 1998. Proceedings. 2nd IEEE Workshop on (1998), 90--101."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.21759"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123001"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571830"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.43525"},{"key":"e_1_3_2_1_20_1","volume-title":"Dynamic software testing of mpi applications with umpire. sc 00","author":"Vetter J. S.","year":"2000","unstructured":"Vetter , J. S. , and de Supinski , B. R. Dynamic software testing of mpi applications with umpire. sc 00 ( 2000 ), 51. Vetter, J. S., and de Supinski, B. R. Dynamic software testing of mpi applications with umpire. sc 00 (2000), 51."}],"event":{"name":"SPAA08: 20th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Munich Germany","acronym":"SPAA08"},"container-title":["Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378585","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1378533.1378585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:53Z","timestamp":1750258673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378585"}},"subtitle":["efficient deadlock detection"],"short-title":[],"issued":{"date-parts":[[2008,6,14]]},"references-count":20,"alternative-id":["10.1145\/1378533.1378585","10.1145\/1378533"],"URL":"https:\/\/doi.org\/10.1145\/1378533.1378585","relation":{},"subject":[],"published":{"date-parts":[[2008,6,14]]},"assertion":[{"value":"2008-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}