{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T12:49:53Z","timestamp":1673009393613},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,7,1]],"date-time":"1979-07-01T00:00:00Z","timestamp":299635200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,7]]},"DOI":"10.1016\/0020-0190(79)90105-4","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"35-38","source":"Crossref","is-referenced-by-count":4,"title":["Implicit computation of synchronization primitives"],"prefix":"10.1016","volume":"9","author":[{"given":"Richard A.","family":"De Millo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond E.","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90105-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(79)90105-4_BIB2","series-title":"The Architecture of Concurrent Programs","author":"Hansen","year":"1977"},{"key":"10.1016\/0020-0190(79)90105-4_BIB3","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/0207027","article-title":"Deadlock prediction: easy and difficult cases","volume":"7","author":"Gold","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(79)90105-4_BIB4","series-title":"Introduction to Operating System Design","author":"Habermann","year":"1976"},{"key":"10.1016\/0020-0190(79)90105-4_BIB5","doi-asserted-by":"crossref","unstructured":"T. Kasai, A. Adachi and S. Iwata, Classes of pebble games and complete problems, SIAM J. Comput., to appear.","DOI":"10.1145\/800178.810161"},{"key":"10.1016\/0020-0190(79)90105-4_BIB6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(79)90105-4_BIB7","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1145\/361227.361234","article-title":"Reduction: a method of proving properties of parallel programs","volume":"18","author":"Lipton","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(79)90105-4_BIB8","series-title":"Ph.D. Thesis","article-title":"On synchronization primitive systems","author":"Lipton","year":"1973"},{"key":"10.1016\/0020-0190(79)90105-4_BIB9","unstructured":"R.J. Lipton, The reachability problem requires exponential space, Theoret. Comput. Sci., to appear."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T18:23:22Z","timestamp":1554920602000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079901054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,7]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,7]]}},"alternative-id":["0020019079901054"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90105-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,7]]}}}