{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:22:38Z","timestamp":1760016158789},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650744"},{"type":"electronic","value":"9783540496748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49674-2_2","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T05:41:54Z","timestamp":1187070114000},"page":"28-48","source":"Crossref","is-referenced-by-count":3,"title":["Programs Without Failures"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"Bossi","sequence":"first","affiliation":[]},{"given":"Nicoletta","family":"Cocco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,11,18]]},"reference":[{"key":"2_CR1","series-title":"Formal Models and Semantics","volume-title":"Hand-book of Theoretical Computer Science","author":"K. R. Apt","year":"1990","unstructured":"K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Hand-book of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990."},{"key":"2_CR2","unstructured":"K. R. Apt. Declarative programming in Prolog. In D. Miller, editor, Proceedings of the 1993 International Symposium on Logic Programming, pages 12\u201335. The MIT Press, 1993."},{"key":"2_CR3","unstructured":"K. R. Apt. From Logic Programming to Prolog. Prentice Hall International Series in Computer Science, 1997."},{"issue":"6A","key":"2_CR4","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/BF01213601","volume":"6","author":"K. R. Apt","year":"1994","unstructured":"K. R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6(6A):743\u2013765, 1994.","journal-title":"Formal Aspects of Computing"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K. R. Apt","year":"1993","unstructured":"K. R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. Information and Computation, 106(1):109\u2013157, 1993.","journal-title":"Information and Computation"},{"key":"2_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-50940-2_30","volume-title":"TAPSOFT\u2019 89, Barcelona, Spain, March 1989","author":"A. Bossi","year":"1989","unstructured":"A. Bossi and N. Cocco. Verifying correctness of logic programs. In J. Diaz and F. Orejas, editors, TAPSOFT\u2019 89, Barcelona, Spain, March 1989, (Lecture Notes in Computer Science, vol. 352), pages 96\u2013110. Springer-Verlag, 1989."},{"key":"2_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-58431-5_19","volume-title":"Algebraic and Logic Programming-Proceedings ALP\u201994","author":"A. Bossi","year":"1994","unstructured":"A. Bossi and N. Cocco. Preserving Universal Termination through Unfold\/Fold. In G. Levi and M. Rodriguez-Artalejo, editors, Algebraic and Logic Programming-Proceedings ALP\u201994, volume 850 of Lecture Notes in Computer Science, pages 269\u2013286. Springer-Verlag, Berlin, 1994."},{"key":"2_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-62718-9_7","volume-title":"Proceedings LOPSTR\u201996","author":"A. Bossi","year":"1997","unstructured":"A. Bossi and N. Cocco. Replacement Can Preserve Termination. In J. Gallagher, editor, Proceedings LOPSTR\u201996, volume 1207 of Lecture Notes in Computer Science, pages 104\u2013129. Springer-Verlag, Berlin, 1997."},{"key":"2_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-56282-6_18","volume-title":"Meta Programming in Logic-Proceedings META\u201992","author":"A. Bossi","year":"1992","unstructured":"A. Bossi, N. Cocco, and S. Etalle. Transforming Normal Programs by Replacement. In A. Pettorossi, editor, Meta Programming in Logic-Proceedings META\u201992, volume 649 of Lecture Notes in Computer Science, pages 265\u2013279. Springer-Verlag, Berlin, 1992."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(92)00019-N","volume":"124","author":"A. Bossi","year":"1994","unstructured":"A. Bossi, N. Cocco, and M. Fabris. Norms on terms and their use in proving universal termination of a logic program. Theoretical Computer Science, 124:297\u2013328, 1994.","journal-title":"Theoretical Computer Science"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"J. Boye and J. Maluszynski. Two Aspects of Directional Types. In Sterling, editor, Proc. Int\u2019l Conf. on Logic Programming, pages 747\u2013761. MIT Press, 1995.","DOI":"10.7551\/mitpress\/4298.003.0071"},{"key":"2_CR12","unstructured":"F. Bronsard, T. K. Lakshman, and U. S. Reddy. A framework of directionalities for proving termination of logic programs. In K. R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 321\u2013335. The MIT Press, 1992."},{"key":"2_CR13","unstructured":"L. Colussi and E. Marchiori. Proving Correctness of Logic Programs using axiomatic semantics. In Proc. Eighth Int\u2019l Conf. on Logic Programming, pages 629\u2013644. MIT Press, 1991."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"S. Debray, P. Lopez-Garcia, and M. Hermenegildo. Non-Failure Analysis for Logic Programs. In Proceedings of the International Symposium on Logic Programming, pages 48\u201362, 1997.","DOI":"10.7551\/mitpress\/4299.003.0010"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(93)90107-5","volume":"118","author":"P. Deransart","year":"1993","unstructured":"P. Deransart. Proof Methods of Declarative Properties of Definite Programs. Theoretical Computer Science, 118:99\u2013166, 1993.","journal-title":"Theoretical Computer Science"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0304-3975(88)90099-0","volume":"59","author":"W. Drabent","year":"1988","unstructured":"W. Drabent and J. Maluszynski. Inductive assertion method for logic programs. Theoretical Computer Science, 59:133\u2013155, 1988.","journal-title":"Theoretical Computer Science"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"P.A. Gardner and J.C. Shepherdson. Unfold\/fold Transformations of Logic Programs. In J-L Lassez and editor G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. 1991.","DOI":"10.1017\/S0960129500001419"},{"key":"2_CR18","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":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.","edition":"Second edition"},{"key":"2_CR19","unstructured":"M.J. Maher. Correctness of a Logic Program Transformation System. IBM Research Report RC13496, T.J. Watson Research Center, 1987."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"D. Pedreschi and S. Ruggeri. Verification of Metainterpreters. Journal of Logic and Computation, 7(2), 1997.","DOI":"10.1093\/logcom\/7.2.267"},{"issue":"20","key":"2_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19","author":"A. Pettorossi","year":"1994","unstructured":"A. Pettorossi and M. Proietti. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming, 19(20):261\u2013320, 1994.","journal-title":"Journal of Logic Programming"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"M. Proietti and A. Pettorossi. Synthesis of Programs from Unfold\/Fold Proofs. In Y. Deville, editor, LOPSTR\u201993, pages 141\u2013158, 1994.","DOI":"10.1007\/978-1-4471-3234-9_13"},{"key":"2_CR23","series-title":"Lect Notes Comput Sci","first-page":"175","volume-title":"Second Int. Conference on Algebraic and Logic Programming, Nancy, France, October 1990","author":"T. Sato","year":"1990","unstructured":"T. Sato. An equivalence preserving first order unfold\/fold transformation system. In Second Int. Conference on Algebraic and Logic Programming, Nancy, France, October 1990, (Lecture Notes in Computer Science, Vol. 463), pages 175\u2013188. Springer-Verlag, 1990."},{"key":"2_CR24","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19\u201320","author":"D. Schreye De","year":"1994","unstructured":"D. De Schreye and S. Decorte. Termination of Logic Programs: the never-ending story. Journal of Logic Programming, 19\u201320:199\u2013260, 1994.","journal-title":"Journal of Logic Programming"},{"key":"2_CR25","unstructured":"L. Sterling and E. Shapiro. The Art of Prolog. The MIT Press, 1986."},{"key":"2_CR26","unstructured":"H. Tamaki and T. Sato. Unfold\/Fold Transformations of Logic Programs. In Sten-\u00c5ke T\u00e4rnlund, editor, Proc. Second Int\u2019l Conf. on Logic Programming, pages 127\u2013139, 1984."}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49674-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T11:01:51Z","timestamp":1708167711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49674-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650744","9783540496748"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-49674-2_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}