{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:48Z","timestamp":1725455928937},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013835","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"322-334","source":"Crossref","is-referenced-by-count":0,"title":["Serialisation analysis of concurrent logic programs"],"prefix":"10.1007","author":[{"given":"Andy","family":"King","sequence":"first","affiliation":[]},{"given":"Paul","family":"Soper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"A. King and P. Soper, \u201cGranularity analysis of concurrent logic programs,\u201d in The Fifth International Symposium on Computer and Information Sciences, (Nevsehir, Cappadocia, Turkey), October (1990)."},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF03037210","volume":"7","author":"E. Tick","year":"1990","unstructured":"E. Tick, \u201cCompile-time granularity analysis for parallel logic programming languages,\u201d New Generation Computing, vol. 7, pp. 325\u2013337, (1990).","journal-title":"New Generation Computing"},{"key":"21_CR3","volume-title":"Task granularity analysis in logic programs","author":"S. K. Debray","year":"1990","unstructured":"S. K. Debray, N. Lin, and M. Hermenegildo, \u201cTask granularity analysis in logic programs,\u201d in Proceedings of the Conference on Programming Languages Design and Implementation, (White Plains, New York), ACM, June (1990)."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"A. King and P. Soper, \u201cReducing scheduling overheads for concurrent logic programs,\u201d in International Workshop on Processing Declarative Knowledge, (Kaiserslautern, Germany), (1991).","DOI":"10.1007\/BFb0013537"},{"key":"21_CR5","unstructured":"A. King and P. Soper, \u201cA semantic approach to producer and consumer analysis,\u201d in International Conference on Logic Programming Workshop on Concurrent Logic Programming, (Paris, France), (1991)."},{"key":"21_CR6","unstructured":"I. Foster and W. Winsborough, \u201cCopy avoidance through compile-time analysis and local reuse,\u201d in Proceedings of the 1991 International Logic Programming Symposium, MIT Press, (1991)."},{"key":"21_CR7","first-page":"3","volume-title":"A New Implementation Technique for flat GHC","author":"K. Ueda","year":"1990","unstructured":"K. Ueda and M. Morita, A New Implementation Technique for flat GHC, pp. 3\u201317. Jerusalem: MIT Press, (1990)."},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1145\/65979.65983","volume":"11","author":"S. K. Debray","year":"1989","unstructured":"S. K. Debray, \u201cStatic inference of modes and data dependencies in logic programs,\u201d ACM Transactions on Programming Languages and Systems, vol. 11, pp. 418\u2013450, July (1989).","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR9","unstructured":"H. Touati and A. Despain, \u201cAn empirical study of the warren abstract machine,\u201d in Proceedings of the 1987 Symposium on Logic Programming, (San Francisco, California), pp. 114\u2013124, (1987)."},{"key":"21_CR10","first-page":"109","volume-title":"ch. Graph colouring algorithms","author":"G. M. D. W. Matula","year":"1972","unstructured":"G. M. D. W. Matula and J. D. Isaacson, Graph theory and computing, ch. Graph colouring algorithms, pp. 109\u2013122. London: Academic Press, (1972). Edited by R.C. Read."},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/3-540-15975-4_49","volume-title":"Second Conference of Functional Programming Languages and Computer Architectures","author":"P. Hudak","year":"1985","unstructured":"P. Hudak and B. Goldberg, \u201cSerial combinators: Optimal grains for parallelism,\u201d in Second Conference of Functional Programming Languages and Computer Architectures, (Nancy, France), pp. 382\u2013399, Springer-Verlag, September (1985)."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013835.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:08:12Z","timestamp":1607353692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0013835","relation":{},"subject":[]}}