{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300581},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571865"},{"type":"electronic","value":"9783540479451"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57186-8_88","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:14:41Z","timestamp":1330258481000},"page":"318-331","source":"Crossref","is-referenced-by-count":2,"title":["A lattice of abstract graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Clark","sequence":"first","affiliation":[]},{"given":"Chris","family":"Hankin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"H.P. Barendregdt, M.C.J.D. Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph rewriting. In PARLE '87 (Volume II), pages 141\u2013158. Springer Verlag LNCS 259, 1987.","DOI":"10.1007\/3-540-17945-3_8"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. In 4th POPL, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"22_CR3","unstructured":"E. Goubault and C. L. Hankin. A lattice for the abstract interpretation of term graph rewriting systems. In M. J. Plasmeijer M. R. Sleep and M. C. van Eekelen, editors, Term Graph Rewriting: Theory and Practice. John Wiley and Sons Ltd., 1993."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"C. Hankin. Static analysis of term graph rewriting systems. In PARLE '91 (Volume II), pages 367\u2013384. Springer Verlag LNCS 506, 1991.","DOI":"10.1007\/3-540-54152-7_75"},{"key":"22_CR5","unstructured":"A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh, 1981."},{"key":"22_CR6","unstructured":"E.G.J.M.H. N\u00f6cker. Strictness analysis based on abstract reduction. In Proceedings of the Second International Workshop on Implementation of Functional Languages on Parallel Architectures, pages 297\u2013321. University of Nijmegen Technical Report 90\u201316, 1990."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"E.G.J.M.H. N\u00f6cker, J.E.W. Smetsers, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Concurrent clean. In PARLE '91 (Volume II), pages 202\u2013219. Springer Verlag LNCS 506, 1991.","DOI":"10.1007\/3-540-54152-7_66"},{"key":"22_CR8","unstructured":"M.C. van Eekelen, E. Goubault, C.L. Hankin, and E.G.J.M.H. N\u00f6cker. Abstract reduction: Towards a theory via abstract interpretation. In M. J. Plasmeijer M. R. Sleep and M. C. van Eekelen, editors, Term Graph Rewriting: Theory and Practice. John Wiley and Sons Ltd., 1993."}],"container-title":["Lecture Notes in Computer Science","Progamming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57186-8_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:09:06Z","timestamp":1605647346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57186-8_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571865","9783540479451"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-57186-8_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}