{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:56Z","timestamp":1725489356029},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_12","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T12:49:53Z","timestamp":1187009393000},"page":"137-152","source":"Crossref","is-referenced-by-count":2,"title":["Non Strict Confluent Rewrite Systems for Data-Structures with Pointers"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Echahed","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Peltier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0743-1066(93)90043-G","volume":"16","author":"H. A\u00eft-Kaci","year":"1993","unstructured":"A\u00eft-Kaci, H., Podelski, A.: Towards a Meaning of LIFE. J. Log. Program\u00a016(3), 195\u2013234 (1993)","journal-title":"J. Log. Program"},{"issue":"1-2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1999.2824","volume":"156","author":"Z.M. Ariola","year":"2000","unstructured":"Ariola, Z.M., Klop, J.W., Plump, D.: Bisimilarity in term graph rewriting. Inf. Comput.\u00a0156(1-2), 2\u201324 (2000)","journal-title":"Inf. Comput."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bakewell, A., Plump, D., Runciman, C.: Checking the shape safety of pointer manipulations. RelMiCS, pp. 48\u201361 (2003)","DOI":"10.1007\/978-3-540-24771-5_5"},{"key":"12_CR4","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":"12_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1140335.1140350","volume-title":"Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming","author":"R. Caferra","year":"2006","unstructured":"Caferra, R., Echahed, R., Peltier, N.: Rewriting term-graphs with priority. In: Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 109\u2013120. ACM Press, New York (2006)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Cirstea, H., Kirchner, C., Liquori, L., Wack, B.: Rewrite strategies in the rewriting calculus. Electr. Notes Theor. Comput. Sci. 86(4) (2003)","DOI":"10.1016\/S1571-0661(05)82613-1"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics (B), pp. 243\u2013320 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"12_CR8","first-page":"325","volume-title":"Proceedings of 15th International Conference and Symposium on Logic Programming","author":"R. Echahed","year":"1998","unstructured":"Echahed, R., Janodet, J.-C.: Admissible graph rewriting and narrowing. In: Proceedings of 15th International Conference and Symposium on Logic Programming, Manchester, pp. 325\u2013340. MIT Press, Cambridge, MA (1998)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of ICGT (International Conference of Graph Transformation)","author":"R. Echahed","year":"2006","unstructured":"Echahed, R., Peltier, N.: Narrowing data-structures with pointers. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, Springer, Heidelberg (2006)"},{"key":"12_CR10","first-page":"394","volume-title":"Computational Logic: Essays in Honor of Alan Robinson","author":"G. Huet","year":"1991","unstructured":"Huet, G., L\u00e9vy, J.-J.: Computation in orthogonal rewriting systems. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic: Essays in Honor of Alan Robinson, pp. 394\u2013443. MIT Press, Cambridge, MA (1991)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/inco.1995.1075","volume":"119","author":"J.R. Kennaway","year":"1995","unstructured":"Kennaway, J.R., Klop, J.K., Sleep, M.R., De Vries, F.J.: Transfinite Reduction in Orthogonal Term Rewriting Systems. Information and Computation\u00a0119(1), 18\u201338 (1995)","journal-title":"Information and Computation"},{"key":"12_CR12","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"D. Plump","year":"1998","unstructured":"Plump, D.: Term graph rewriting. In: Ehrig, H., Engels, G., Kreowski, H., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a02, World Scientific, Singapore (1998)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11601548_16","volume-title":"Processes, Terms and Cycles","author":"D. Plump","year":"2005","unstructured":"Plump, D.: Confluence of graph transformation revisited. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 280\u2013308. Springer, Heidelberg (2005)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/363534.363554","volume":"10","author":"H. Schorr","year":"1967","unstructured":"Schorr, H., Waite, W.M.: An Efficient Machine Independent Procedure for Garbage Collection in Various List Structures. Communication of the ACM\u00a010, 501\u2013506 (1967)","journal-title":"Communication of the ACM"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.jsc.2004.12.011","volume":"40","author":"E. Visser","year":"2005","unstructured":"Visser, E.: A survey of strategies in rule-based program transformation systems. J. Symb. Comput.\u00a040(1), 831\u2013873 (2005)","journal-title":"J. Symb. Comput."}],"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_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:12:29Z","timestamp":1619503949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}