{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:30:27Z","timestamp":1649003427101},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,5,1]],"date-time":"1982-05-01T00:00:00Z","timestamp":389059200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11400,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1982,5]]},"DOI":"10.1016\/0167-6423(82)90017-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"235-254","source":"Crossref","is-referenced-by-count":2,"title":["An exercise in program synthesis: algorithms for computing the transitive closure of a relation"],"prefix":"10.1016","volume":"1","author":[{"given":"Lothar","family":"Schmitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0167-6423(82)90017-X_BIB1","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(82)90017-X_BIB2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/954587.954588","article-title":"Towards a wide spectrum language to support program specification and program development","volume":"13","author":"Bauer","year":"1978","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0167-6423(82)90017-X_BIB3","first-page":"273","article-title":"Systematics of transformation rules","volume":"69","author":"Bauer","year":"1979"},{"issue":"1","key":"10.1016\/0167-6423(82)90017-X_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1093\/comjnl\/23.1.61","article-title":"Algorithm classification through synthesis","volume":"23","author":"Clark","year":"1980","journal-title":"Comput. J."},{"key":"10.1016\/0167-6423(82)90017-X_BIB5","first-page":"133","article-title":"Application of program transformation to program synthesis","author":"Darlington","year":"1973"},{"key":"10.1016\/0167-6423(82)90017-X_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00264597","article-title":"A synthesis of several sort programs","volume":"11","author":"Darlington","year":"1978","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(82)90017-X_BIB7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00271339","article-title":"On computing the transitive closure of a relation","volume":"8","author":"Eve","year":"1977","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(82)90017-X_BIB8","series-title":"Compiler Construction for Digital Computers","author":"Gries","year":"1971"},{"key":"10.1016\/0167-6423(82)90017-X_BIB9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth\u2014first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(82)90017-X_BIB10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","article-title":"A theorem on Boolean matrices","author":"Warshall","year":"1962","journal-title":"J. ACM"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764238290017X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764238290017X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:29:25Z","timestamp":1555075765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764238290017X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,5]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,5]]}},"alternative-id":["016764238290017X"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(82)90017-x","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1982,5]]}}}