{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:49Z","timestamp":1725490249652},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540746089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74610-2_21","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T02:33:31Z","timestamp":1187922811000},"page":"302-316","source":"Crossref","is-referenced-by-count":0,"title":["Resource-Oriented Deadlock Analysis"],"prefix":"10.1007","author":[{"given":"Lee","family":"Naish","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E. Dijkstra","year":"1971","unstructured":"Dijkstra, E.: Hierarchical ordering of sequential processes. Acta Informatica\u00a01, 115\u2013138 (1971)","journal-title":"Acta Informatica"},{"key":"21_CR2","volume-title":"Parallel logic programming in PARLOG: the language and its implementation","author":"S. Gregory","year":"1987","unstructured":"Gregory, S.: Parallel logic programming in PARLOG: the language and its implementation. Addison-Wesley, Reading (1987)"},{"key":"21_CR3","first-page":"27","volume-title":"Concurrent Prolog: Collected Papers","author":"E. Shapiro","year":"1987","unstructured":"Shapiro, E.: A subset of Concurrent Prolog and its interpreter. In: Shapiro, E. (ed.) Concurrent Prolog: Collected Papers, vol.\u00a0I, pp. 27\u201383. MIT Press, London (1987)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Ueda, K.: Guarded Horn clauses. PhD thesis, University of Tokyo, Japan (1986)","DOI":"10.1007\/3-540-16479-0_17"},{"key":"21_CR5","unstructured":"Naish, L.: Parallelizing NU-Prolog. In: Proceedings of the Fifth International Conference\/Symposium on Logic Programming, pp. 1546\u20131564 (1988)"},{"key":"21_CR6","unstructured":"Naish, L.: Declarative diagnosis of floundering. Technical report, Department of Computer Science, University of Melbourne (submitted for publication, 2007)"},{"issue":"1","key":"21_CR7","first-page":"181","volume":"15","author":"L. Naish","year":"1993","unstructured":"Naish, L.: Coroutining and the construction of terminating logic programs. Australian Computer Science Communications\u00a015(1), 181\u2013190 (1993)","journal-title":"Australian Computer Science Communications"},{"key":"21_CR8","unstructured":"Naish, L.: A declarative view of floundering. Technical report, Department of Computer Science, University of Melbourne (submitted for publication, 2006)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","author":"P. Godefroid","year":"1996","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol.\u00a01032. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74610-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:30:09Z","timestamp":1619519409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74610-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746089"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74610-2_21","relation":{},"subject":[]}}