{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:43:58Z","timestamp":1725522238506},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899815"},{"type":"electronic","value":"9783540899822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89982-2_77","type":"book-chapter","created":{"date-parts":[[2008,12,14]],"date-time":"2008-12-14T22:09:15Z","timestamp":1229292555000},"page":"785-789","source":"Crossref","is-referenced-by-count":2,"title":["An Algorithm for Sophisticated Code Matching in Logic Programs"],"prefix":"10.1007","author":[{"given":"Wim","family":"Vanhoof","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Degrave","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"77_CR1","series-title":"Objet Technology Series","volume-title":"Refactoring: Improving the Design of Existing Code","author":"M. Fowler","year":"1999","unstructured":"Fowler, M., Beck, K., Brant, J., Opdyke, W., Roberts, D.: Refactoring: Improving the Design of Existing Code. Objet Technology Series. Addison-Wesley, Reading (1999)"},{"issue":"2","key":"77_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1017\/S1471068407003134","volume":"8","author":"A. Serebrenik","year":"2008","unstructured":"Serebrenik, A., Schrijvers, T., Demoen, B.: Improving Prolog programs: Refactoring for Prolog. Theory and Practice of Logic Programming\u00a08(2), 201\u2013215 (2008)","journal-title":"Theory and Practice of Logic Programming"},{"key":"77_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11506676_1","volume-title":"Logic Based Program Synthesis and Transformation","author":"W. Vanhoof","year":"2005","unstructured":"Vanhoof, W.: Searching semantically equivalent code fragments in logic programs. In: Etalle, S. (ed.) LOPSTR 2004. LNCS, vol.\u00a03573, pp. 1\u201318. Springer, Heidelberg (2005)"},{"key":"77_CR4","first-page":"39","volume-title":"String Processing and Information Retrieval","author":"L. Bergroth","year":"2000","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: String Processing and Information Retrieval, pp. 39\u201348. IEEE, Los Alamitos (2000)"},{"key":"77_CR5","doi-asserted-by":"crossref","unstructured":"Schleimer, S., Wilkerson, D., Aiken, A.: Winnowing: Local algorithms for document fingerprinting. In: Proceedings of the 2003 ACM SIGMOD international conference on Management of Data, San Diego, CA (2003)","DOI":"10.1145\/872757.872770"},{"issue":"6","key":"77_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/93548.93574","volume":"25","author":"S. Horwitz","year":"1990","unstructured":"Horwitz, S.: Identifying the semantic and textual differences between two versions of a program. ACM SIGPLAN Notices\u00a025(6), 234\u2013245 (1990)","journal-title":"ACM SIGPLAN Notices"},{"issue":"7","key":"77_CR7","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1002\/spe.4380210706","volume":"21","author":"W. Yang","year":"1991","unstructured":"Yang, W.: Identifying syntactic differences between two programs. Software Practice and Experience\u00a021(7), 739\u2013755 (1991)","journal-title":"Software Practice and Experience"},{"key":"77_CR8","unstructured":"Winstead, J., Evans, D.: Towards differential program analysis. In: Proceedings of the 2003 Workshop on Dynamic Analysis (2003)"},{"key":"77_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-78769-3_4","volume-title":"Logic-Based Program Synthesis and Transformation","author":"F. Degrave","year":"2008","unstructured":"Degrave, F., Vanhoof, W.: Towards a normal form for Mercury programs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol.\u00a04915, pp. 43\u201358. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89982-2_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T05:55:42Z","timestamp":1551678942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}