{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:50Z","timestamp":1725490250859},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540746089"},{"type":"electronic","value":"9783540746102"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74610-2_25","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T22:33:31Z","timestamp":1187908411000},"page":"364-379","source":"Crossref","is-referenced-by-count":1,"title":["Automatic Correctness Proofs for Logic Program Transformations"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Pettorossi","sequence":"first","affiliation":[]},{"given":"Maurizio","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Valerio","family":"Senni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","first-page":"493","volume-title":"Handbook of Theoretical Computer Science","author":"K.R. Apt","year":"1990","unstructured":"Apt, K.R.: Introduction to logic programming. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 493\u2013576. Elsevier, Amsterdam (1990)"},{"key":"25_CR2","first-page":"69","volume-title":"Proc. of NACLP","author":"M. Bezem","year":"1989","unstructured":"Bezem, M.: Characterizing termination of logic programs with level mappings. In: Proc. of NACLP, Cleveland, Ohio (USA), pp. 69\u201380. MIT Press, Cambridge (1989)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-58431-5_19","volume-title":"Algebraic and Logic Programming","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Cocco, N.: Preserving universal termination through unfold\/fold. In: Rodr\u00edguez-Artalejo, M., Levi, G. (eds.) ALP 1994. LNCS, vol.\u00a0850, pp. 269\u2013286. Springer, Heidelberg (1994)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-55844-6_135","volume-title":"Programming Language Implementation and Logic Programming","author":"A. Bossi","year":"1992","unstructured":"Bossi, A., Cocco, N., Etalle, S.: On safe folding. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol.\u00a0631, pp. 172\u2013186. Springer, Heidelberg (1992)"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. Journal of the ACM\u00a024(1), 44\u201367 (1977)","journal-title":"Journal of the ACM"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-58792-6_4","volume-title":"Logic Program Synthesis and Transformation - Meta-Programming in Logic","author":"J. Cook","year":"1994","unstructured":"Cook, J., Gallagher, J.P.: A transformation system for definite programs based on termination analysis. In: Fribourg, L., Turini, F. (eds.) LOPSTR 1994 and META 1994. LNCS, vol.\u00a0883, pp. 51\u201368. Springer, Heidelberg (1994)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(95)00148-4","volume":"166","author":"S. Etalle","year":"1996","unstructured":"Etalle, S., Gabbrielli, M.: Transformations of CLP modules. Theoretical Computer Science\u00a0166, 101\u2013146 (1996)","journal-title":"Theoretical Computer Science"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-58402-1_24","volume-title":"Programming Language Implementation and Logic Programming","author":"M. Gergatsoulis","year":"1994","unstructured":"Gergatsoulis, M., Katzouraki, M.: Unfold\/fold transformations for definite clause programs. In: Penjam, J. (ed.) PLILP 1994. LNCS, vol.\u00a0844, pp. 340\u2013354. Springer, Heidelberg (1994)"},{"key":"25_CR9","unstructured":"Kanamori, T., Fujita, H.: Unfold\/fold transformation of logic programs with counters. Technical Report 179, ICOT, Tokyo, Japan (1986)"},{"key":"25_CR10","unstructured":"Kott, L.: About transformation system: A theoretical study. In: 3\u00e8me Colloque International sur la Programmation, Paris (France), Dunod, pp. 232\u2013247 (1978)"},{"key":"25_CR11","first-page":"480","volume-title":"Proceedings of ILPS 1995","author":"K.-K. Lau","year":"1995","unstructured":"Lau, K.-K., Ornaghi, M., Pettorossi, A., Proietti, M.: Correctness of logic program transformation based on existential termination. In: Lloyd, J.W. (ed.) Proceedings of ILPS 1995, pp. 480\u2013494. MIT Press, Cambridge (1995)"},{"key":"25_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"25_CR13","unstructured":"McCarthy, J.: Towards a mathematical science of computation. In: Proceedings of IFIP 1962, Amsterdam, pp. 21\u201328. North Holland (1963)"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/1014007.1014023","volume-title":"Proceedings of PEPM 2004","author":"A. Pettorossi","year":"2004","unstructured":"Pettorossi, A., Proietti, M.: A theory of totally correct logic program transformations. In: Proceedings of PEPM 2004, pp. 159\u2013168. ACM Press, New York (2004)"},{"issue":"3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129054102001175","volume":"13","author":"A. Roychoudhury","year":"2002","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V.: Beyond Tamaki-Sato style unfold\/fold transformations for normal logic programs. Int. Journal on Foundations of Computer Science\u00a013(3), 387\u2013403 (2002)","journal-title":"Int. Journal on Foundations of Computer Science"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/982158.982160","volume":"26","author":"A. Roychoudhury","year":"2004","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V.: An unfold\/fold transformation framework for definite logic programs. ACM Transactions on Programming Languages and Systems\u00a026, 264\u2013509 (2004)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/227699.227716","volume":"18","author":"D. Sands","year":"1996","unstructured":"Sands, D.: Total correctness by local improvement in the transformation of functional programs. ACM Toplas\u00a018(2), 175\u2013234 (1996)","journal-title":"ACM Toplas"},{"key":"25_CR18","unstructured":"Sato, T., Tamaki, H.: Examples of logic program transformation and synthesis, 1985 (unpublished manuscript)"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(91)90007-O","volume":"86","author":"H. Seki","year":"1991","unstructured":"Seki, H.: Unfold\/fold transformation of stratified programs. Theoretical Computer Science\u00a086, 107\u2013139 (1991)","journal-title":"Theoretical Computer Science"},{"key":"25_CR20","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformation of logic programs. In: Proceedings of ICLP 1984, Uppsala, Sweden, pp. 127\u2013138. Uppsala University (1984)"},{"key":"25_CR21","unstructured":"Tamaki, H., Sato, T.: A generalized correctness proof of the unfold\/fold logic program transformation. Technical Report 86-4, Ibaraki University, Japan (1986)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74610-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:22:43Z","timestamp":1558261363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74610-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540746089","9783540746102"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74610-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}