{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T11:22:30Z","timestamp":1720437750929},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0167-6423(86)90026-2","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"213-272","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Program derivation through transformations: The evolution of list-copying algorithms"],"prefix":"10.1016","volume":"6","author":[{"given":"N.W.P.","family":"van Diepen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.P.","family":"de Roever","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(86)90026-2_BIB1","article-title":"An axiomatization of the intermittent assertion method (extended abstract)","author":"Apt","year":"1983"},{"key":"10.1016\/0167-6423(86)90026-2_BIB2","article-title":"Correctness Preserving Program Refinements: Proof Theory and Applications","volume":"131","author":"Back","year":"1980","journal-title":"Mathematical Centre Tracts"},{"issue":"4","key":"10.1016\/0167-6423(86)90026-2_BIB3","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/1780.1781","article-title":"The promotion and accumulation strategies in transformational programming","volume":"6","author":"Bird","year":"1984","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0167-6423(86)90026-2_BIB4","article-title":"Specified programming","author":"Blikle","year":"1978","journal-title":"ICS PAS Reports 333"},{"issue":"5","key":"10.1016\/0167-6423(86)90026-2_BIB5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/359488.359491","article-title":"A fast algorithm for copying list structures","volume":"21","author":"Clark","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(86)90026-2_BIB6","first-page":"1","article-title":"A synthesis of several sorting algorithms","volume":"11","author":"Darlington","year":"1980","journal-title":"Acta Informat."},{"issue":"5","key":"10.1016\/0167-6423(86)90026-2_BIB7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/360762.360764","article-title":"Copying cyclic list structures in linear time using bounded workspace","volume":"18","author":"Fisher","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(86)90026-2_BIB8","series-title":"Proc. 2nd Principles of Programming Languages Symposium","first-page":"54","article-title":"Correctness preserving program transformations","author":"Gerhart","year":"1975"},{"issue":"3","key":"10.1016\/0167-6423(86)90026-2_BIB9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/0205030","article-title":"Proof theory of partial correctness verification systems","volume":"5","author":"Gerhart","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(86)90026-2_BIB10","series-title":"Software Development: A Rigorous Approach, Series in Computer Science","author":"Jones","year":"1980"},{"key":"10.1016\/0167-6423(86)90026-2_BIB11","series-title":"Conference Record 6th Annual ACM Symposium on Principles of Programming Languages","first-page":"53","article-title":"The evolution of list copying algorithms and the need for structured program verification","author":"Lee","year":"1979"},{"issue":"4","key":"10.1016\/0167-6423(86)90026-2_BIB12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1145\/360924.360936","article-title":"Copying list structures using bounded workspace","volume":"17","author":"Lindstrom","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(86)90026-2_BIB13","series-title":"Th\u00e9orie des programmes","author":"Livercy","year":"1978"},{"key":"10.1016\/0167-6423(86)90026-2_BIB14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0167-6423(81)90004-6","article-title":"Deductive synthesis of the unification algorithm","volume":"1","author":"Manna","year":"1981","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(86)90026-2_BIB15","series-title":"1978 National Computer Conference","article-title":"Computer system security evaluation","author":"Neumann","year":"1978"},{"issue":"1","key":"10.1016\/0167-6423(86)90026-2_BIB16","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0167-6423(84)90010-8","article-title":"Structuring transformational developments: a case study based on Earley's recognizer","volume":"4","author":"Partsch","year":"1984","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(86)90026-2_BIB17","article-title":"Deriving efficient graph algorithms","author":"Reif","year":"1982","journal-title":"Report CMU-CS-82-155"},{"issue":"6","key":"10.1016\/0167-6423(86)90026-2_BIB18","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/359605.359628","article-title":"A bounded storage algorithm for copying cyclic list structures","volume":"20","author":"Robson","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(86)90026-2_BIB19","series-title":"Conference Record 8th Annual ACM Symposium on Principles of Programming Languages","first-page":"41","article-title":"Program improvement by internal specialization","author":"Scherlis","year":"1981"},{"key":"10.1016\/0167-6423(86)90026-2_BIB20","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/363534.363554","article-title":"An efficient machine-independent procedure for garbage collection in various list structures","volume":"10","author":"Schorr","year":"1967","journal-title":"Comm. ACM"},{"issue":"5","key":"10.1016\/0167-6423(86)90026-2_BIB21","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1145\/358506.358513","article-title":"Analysis of pointer \u2018rotation\u2019","volume":"25","author":"Suzuki","year":"1982","journal-title":"Comm. ACM"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900262?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900262?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T15:50:11Z","timestamp":1553442611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642386900262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":21,"alternative-id":["0167642386900262"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90026-2","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}