{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:37Z","timestamp":1725536017049},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034657"},{"type":"electronic","value":"9783642034664"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03466-4_9","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T07:20:54Z","timestamp":1249284054000},"page":"140-154","source":"Crossref","is-referenced-by-count":12,"title":["A Deadlock-Free Semantics for Shared Memory Concurrency"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Boudol","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Boyapati, C., Lee, R., Rinard, M.: Ownership types for safe programming: preventing data-races and deadlocks. In: OOPSLA 2002, pp. 211\u2013230 (2002)","DOI":"10.1145\/582419.582440"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/356586.356588","volume":"3","author":"E.G. Coffman Jr","year":"1971","unstructured":"Coffman Jr, E.G., Elphick, M.J., Shoshani, A.: System Deadlocks. ACM Comput. Surveys\u00a03(2), 67\u201378 (1971)","journal-title":"ACM Comput. Surveys"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-49099-X_7","volume-title":"Programming Languages and Systems","author":"C. Flanagan","year":"1999","unstructured":"Flanagan, C., Abadi, M.: Types for safe locking. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol.\u00a01576, pp. 91\u2013108. Springer, Heidelberg (1999)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/3-540-54415-1_71","volume-title":"Theoretical Aspects of Computer Software","author":"S. Hayashi","year":"1991","unstructured":"Hayashi, S.: Singleton, union and intersection types for program extraction. In: Ito, T., Meyer, A.R. (eds.) TACS 1991. LNCS, vol.\u00a0526, pp. 701\u2013730. Springer, Heidelberg (1991)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11817949_16","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"N. Kobayashi","year":"2006","unstructured":"Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 233\u2013247. Springer, Heidelberg (2006)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Lucassen, J.M., Gifford, D.K.: Polymorphic effect systems. In: POPL 1988, pp. 47\u201357 (1988)","DOI":"10.1145\/73560.73564"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"McCloskey, B., Zhou, F., Gray, D., Brewer, E.: Autolocker: synchronization inference for atomic sections. In: POPL 2006, pp. 346\u2013358 (2006)","DOI":"10.1145\/1111037.1111068"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Nanevski, A., Morrisett, G., Shinnar, A., Birkedal, L.: Ynot: dependent types for imperative programs. In: ICFP 2008, pp. 229\u2013240 (2008)","DOI":"10.1145\/1411204.1411237"},{"key":"9_CR9","volume-title":"Beautiful Code","author":"S.L. Peyton Jones","year":"2007","unstructured":"Peyton Jones, S.L.: Beautiful concurrency. In: Oram, A., Wilson, G. (eds.) Beautiful Code. O\u2019Reilly, Sebastopol (2007)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-89330-1_12","volume-title":"Programming Languages and Systems","author":"K. Suenaga","year":"2008","unstructured":"Suenaga, K.: Type-based deadlock-freedom verification for non-block-structured lock primitives and mutable references. In: Ramalingam, G. (ed.) APLAS 2008. LNCS, vol.\u00a05356, pp. 155\u2013170. Springer, Heidelberg (2008)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Vasconcelos, V., Martins, F., Cogumbreiro, T.: Type inference for deadlock detection in a multithreaded polymorphic typed assembly language. In: Proceedings of PLACES 2009 (2009)","DOI":"10.4204\/EPTCS.17.8"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Wang, Y., Lafortune, S., Kelly, T., Kudlur, M., Mahlke, S.: The theory of deadlock avoidance via discrete control. In: POPL 2009, pp. 252\u2013263 (2009)","DOI":"10.1145\/1594834.1480913"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A. Wright","year":"1994","unstructured":"Wright, A., Felleisen, M.: A syntactic approach to type soundness. Information and Computation\u00a0115(1), 38\u201394 (1994)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03466-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:36:05Z","timestamp":1558470965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03466-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034657","9783642034664"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03466-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}