{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:21:10Z","timestamp":1737436870774,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679561"},{"type":"electronic","value":"9783540445203"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44520-x_50","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:51:43Z","timestamp":1188359503000},"page":"389-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Identifying and Validating Irregular Mutual Exclusion Synchronization in Explicitly Parallel Programs"],"prefix":"10.1007","author":[{"given":"Diego","family":"Novillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald C.","family":"Unrau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,8,18]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"D. Bacon, R. Konuru, C. Murthy, and M. Serrano. Thin Locks: Featherweight Synchronization for Java. In ACM SIGPLAN\u2019 98, June 1998.","DOI":"10.1145\/277650.277734"},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1006\/jpdc.1996.0136","volume":"38","author":"A. Krishnamurthy","year":"1996","unstructured":"A. Krishnamurthy and K. Yelick. Analyses and Optimizations for Shared Address Space Programs. J. Parallel and Distributed Computing, 38:130\u2013144, 1996.","journal-title":"J. Parallel and Distributed Computing"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"J. Lee, S. Midkiff, and D. A. Padua. Concurrent static single assignment form and constant propagation for explicitly parallel programs. In LCPC\u2019 97, August 1997.","DOI":"10.1007\/BFb0032687"},{"key":"50_CR4","unstructured":"S. P. Masticola. Static Detection of Deadlocks in Polynomial Time. PhD thesis, Department of Computer Science, Rutgers University, 1993."},{"key":"50_CR5","unstructured":"D. Novillo. Compiler Analysis and Optimization Techniques for Explicitly Parallel Programs. PhD thesis, University of Alberta, February 2000."},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"D. Novillo, R. Unrau, and J. Schaeffer. Concurrent SSA Form in the Presence of Mutual Exclusion. In ICPP\u2019 98, pages 356\u2013364, August 1998.","DOI":"10.1109\/ICPP.1998.708506"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2000 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44520-X_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:35:52Z","timestamp":1737398152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44520-X_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679561","9783540445203"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44520-x_50","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 August 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}