{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:36:01Z","timestamp":1725489361082},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_11","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"122-136","source":"Crossref","is-referenced-by-count":0,"title":["Adjunction for Garbage Collection with Application to Graph Rewriting"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Duval","sequence":"first","affiliation":[]},{"given":"Rachid","family":"Echahed","sequence":"additional","affiliation":[]},{"given":"Frederic","family":"Prost","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0304-3975(94)90090-6","volume":"131","author":"R. Banach","year":"1994","unstructured":"Banach, R.: Term graph rewriting and garbage collection using opfibrations. Theoretical Computer Science\u00a0131, 29\u201394 (1994)","journal-title":"Theoretical Computer Science"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume-title":"PARLE 1987","author":"H. Barendregt","year":"1987","unstructured":"Barendregt, H., van Eekelen, M., Glauert, J., Kenneway, R., Plasmeijer, M.J., Sleep, M.: Term graph rewriting. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 141\u2013158. Springer, Heidelberg (1987)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-53982-4_6","volume-title":"TAPSOFT 1991: Proceedings of the International Joint Conference on Theory and Practice of Software Development","author":"P.V.D. Broek","year":"1991","unstructured":"Broek, P.V.D.: Algebraic graph rewriting using a single pushout. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol.\u00a0493, pp. 90\u2013102. Springer, Heidelberg (1991)"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/356850.356854","volume":"13","author":"J. Cohen","year":"1981","unstructured":"Cohen, J.: Garbage collection of linked data structures. Computing Surveys\u00a013(3), 341\u2013367 (1981)","journal-title":"Computing Surveys"},{"issue":"12","key":"11_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1145\/367487.367501","volume":"3","author":"G. Collins","year":"1960","unstructured":"Collins, G.: A method for overlapping and erasure of lists. Communication of the ACM\u00a03(12), 655\u2013657 (1960)","journal-title":"Communication of the ACM"},{"key":"11_CR6","unstructured":"Duval, D., Echahed, R., Prost, F.: Modeling pointer redirection as cyclic term graph rewriting. In: TERMGRAPH 2006 (2006) (Extended version to appear in ENTCS)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: An algebraic approach. In: FOCS 1973, pp. 167\u2013180 (1973)","DOI":"10.1109\/SWAT.1973.11"},{"key":"11_CR8","volume-title":"Garbage Collection: Algorithms for Automatic Dynamic Memory Management","author":"R.E. Jones","year":"1996","unstructured":"Jones, R.E., Lins, R.: Garbage Collection: Algorithms for Automatic Dynamic Memory Management. J. Wiley & Son, New York (1996)"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy, J.: Recursive functions of symbolic expressions and their computation by machine-i. Communication of the ACM\u00a03(1), 184\u2013195 (1960)","journal-title":"Communication of the ACM"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:29Z","timestamp":1619518349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}