{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:26:45Z","timestamp":1748071605941},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665403"},{"type":"electronic","value":"9783540481645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10704567_24","type":"book-chapter","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T23:27:08Z","timestamp":1167348428000},"page":"396-413","source":"Crossref","is-referenced-by-count":10,"title":["A Parameterized Unfold\/Fold Transformation Framework for Definite Logic Programs"],"prefix":"10.1007","author":[{"given":"Abhik","family":"Roychoudhury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. Narayan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Aravindan, C., Dung, P.M.: On the correctness of unfold\/fold transformations of normal and extended logic programs. Journal of Logic Programming, 295\u2013322 (1995)","DOI":"10.1016\/0743-1066(94)00104-E"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Bossi, A., Cocco, N., Dulli, S.: A method of specializing logic programs. ACM TOPLAS, 253\u2013302 (1990)","DOI":"10.1145\/78942.78947"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Boulanger, D., Bruynooghe, M.: Deriving unfold\/fold transformations of logic programs using extended OLDT-based abstract interpretation. Journal of Symbolic Computation, 495\u2013521 (1993)","DOI":"10.1016\/S0747-7171(06)80003-9"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0056604","volume-title":"Principles of Declarative Programming","author":"B. Cui","year":"1998","unstructured":"Cui, B., Dong, Y., Du, X., Narayan Kumar, K., Ramakrishnan, C.R., Ramakr, I.V.: Logic programming and model checking. In: Palamidessi, C., Meinke, K., Glaser, H. (eds.) ALP 1998 and PLILP 1998. LNCS, vol.\u00a01490, pp. 1\u201320. Springer, Heidelberg (1998)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Etalle, S., Gabrielli, M., Meo, M.C.: Unfold\/fold transformations of CCP programs. In: Proceedings of CONCUR (1998)","DOI":"10.1007\/BFb0055633"},{"issue":"12","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/s002360050151","volume":"35","author":"N.D. Francesco","year":"1998","unstructured":"Francesco, N.D., Santone, A.: A transformation system for concurrent processes. Acta Informatica\u00a035(12), 1037\u20131073 (1998)","journal-title":"Acta Informatica"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (1994)"},{"key":"24_CR8","unstructured":"Kanamori, T., Fujita, H.: Unfold\/fold transformation of logic programs with counters. USA-Japan Seminar on Logics of Programs (1987)"},{"key":"24_CR9","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1993","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1993)","edition":"2"},{"key":"24_CR10","unstructured":"Maher, M.J.: Correctness of a logic program transformation system. Technical report, IBM T.J. Watson Research Center (1987)"},{"key":"24_CR11","series-title":"Handbook of Logic in Artificial Intelligence","first-page":"697","volume-title":"Transformation of logic programs","year":"1998","unstructured":"Pettorossi, A., Proietti, M. (eds.): Transformation of logic programs. Handbook of Logic in Artificial Intelligence, vol.\u00a05, pp. 697\u2013787. Oxford University Press, Oxford (1998)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Pettorossi, A., Proietti, M., Renault, S.: Reducing nondeterminism while specializing logic programs. Proceedings of POPL, 414\u2013427 (1997)","DOI":"10.1145\/263699.263759"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V.: A generalized unfold\/fold transformation system for definite logic programs. Technical Report 98\/37, Dept. of Computer Science, SUNY Stony Brook (1998)","DOI":"10.1007\/10704567_24"},{"key":"24_CR14","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V.: Proofs by program transformations. Accepted for LOPSTR (1999)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, I.V.: Beyond TamakiSato style unfold\/fold transformations for normal logic programs. Technical Report 99\/21, Dept. of Computer Science, SUNY Stony Brook (1999)","DOI":"10.1007\/3-540-46674-6_27"},{"key":"24_CR16","unstructured":"Roychoudhury, A., Ramakrishnan, C.R., Ramakrishnan, I.V., Smolka, S.A.: Tabulation based Induction proofs with applications to Automated Verification. In: Workshop on Tabulation in Parsing and Deduction, pp. 83\u201388 (1998)"},{"issue":"2","key":"24_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":"24_CR18","doi-asserted-by":"crossref","unstructured":"Seki, H.: Unfold\/fold transformation of stratified programs. Theoretical Computer Science, 107\u2013139 (1991)","DOI":"10.1016\/0304-3975(91)90007-O"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Seki, H.: Unfold\/fold transformation of general logic programs for well-founded semantics. Journal of Logic Programming, 5\u201323 (1993)","DOI":"10.1016\/0743-1066(93)90021-8"},{"key":"24_CR20","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformations of logic programs. In: Proceedings of International Conference on Logic Programming, pp. 127\u2013138 (1984)"},{"key":"24_CR21","unstructured":"Tamaki, H., Sato, T.: A generalized correctness proof of the unfold\/ fold logic program transformation. Technical report, Ibaraki University, Japan (1986)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10704567_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T06:59:02Z","timestamp":1683701942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10704567_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665403","9783540481645"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/10704567_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}