{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:24Z","timestamp":1725665004795},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627180"},{"type":"electronic","value":"9783540684947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62718-9_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:49:05Z","timestamp":1330296545000},"page":"38-57","source":"Crossref","is-referenced-by-count":5,"title":["Specification-based automatic verification of Prolog programs"],"prefix":"10.1007","author":[{"given":"Agostino","family":"Cortesi","sequence":"first","affiliation":[]},{"given":"Baudouin","family":"Charlier","sequence":"additional","affiliation":[]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","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":"3_CR2","volume-title":"Cardinality Analysis of Prolog","author":"C. Braem","year":"1994","unstructured":"C. Braem, B. Le Charlier, S. Modart, and P. Van Hentenryck. Cardinality Analysis of Prolog. In Proc. Int'l Logic Programming Symposium, (ILPS'94), Ithaca, NY. The MIT Press, Cambridge, Mass., 1994."},{"key":"3_CR3","first-page":"293","volume-title":"Advances in Data Base Theory","author":"K.L. Clark","year":"1978","unstructured":"K.L. Clark. Negation as Failure. In H. Gallaire and J. Minker editors, Advances in Data Base Theory, Plenum Press, New York, pp. 293\u2013322, 1978."},{"issue":"3","key":"3_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/355744.355751","volume":"3","author":"J. Cohen","year":"1977","unstructured":"J. Cohen and J. Katcoff. Symbolic solution of finite-difference equations. ACM Transactions on Mathematical Software, 3(3):261\u2013271, 1977.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"3_CR5","unstructured":"A. Cortesi, B. Le Charlier and P. van Hentenryck, Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product. Technical Report CS-93-13, Brown University, 1993."},{"key":"3_CR6","first-page":"227","volume-title":"Combinations of Abstract. Domains for Logic Programming","author":"A. Cortesi","year":"1994","unstructured":"A. Cortesi, B. Le Charlier and P. van Hentenryck, Combinations of Abstract. Domains for Logic Programming, In Proc. 21th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'94), ACM-Press, New York, pp. 227\u2013239, 1994."},{"key":"3_CR7","volume-title":"LNCS 456","author":"P. Boeck De","year":"1990","unstructured":"P. De Boeck and B. Le Charlier. Static Type Analysis of Prolog Procedures for Ensuring Correctness. In P. Deransart and J. Maluszy\u0144ski, editors, Proc. Second Int'l Symposium on Programming Language Implementation and Logic Programming, (PLILP'90), LNCS 456, Springer-Verlag, Berlin, 1990."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"P. De Boeck and B. Le Charlier. Mechanical Transformation of Logic Definitions Augmented with Type Information into Prolog Procedures: Some Experiments. In Proc. Int'l Workshop on Logic Program Synthesis and Transformation, (LOPSTR'93). Springer Verlag, July 1993.","DOI":"10.1007\/978-1-4471-3234-9_19"},{"issue":"5","key":"3_CR9","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/161468.161472","volume":"15","author":"S. K. Debray","year":"1993","unstructured":"S. K. Debray and N. W. Lin. Cost analysis of logic programs. ACM Transactions on Programming Languages and Systems, 15(5):826\u2013875, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"D. De Schreye, K. Verschaetse, and M. Bruynooghe. A Framework for analyzing the termination of definite logic programs with respect to call patterns. In H. Tanaka, editor, FGCS'92, 1992.","DOI":"10.1007\/3-540-56282-6_5"},{"key":"3_CR11","unstructured":"Y. Deville. Logic Programming: Systematic Program Development. Addison-Wesley, 1990."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"J. Henrard and B. Le Charlier. FOLON: An Environment for Declarative Construction of Logic Programs (extended abstract). In M. Bruynooghe and M. Wirsing, editors, Proc. Fourth Int'l Workshop on Programming Language Implementation and Logic Programming (PLILP'92), LNCS 631 Springer-Verlag, pp. 237\u2013231, 1992.","DOI":"10.1007\/3-540-55844-6_138"},{"issue":"1","key":"3_CR13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/355769.355772","volume":"4","author":"J. Ivie","year":"1978","unstructured":"J. Ivie. Some MACSYMA programs for solving recurrence relations. ACM Transactions on Mathematical Software, 4(1):24\u201333, 1978.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"3_CR14","unstructured":"B. Le Charlier, and S. Rossi. Automatic Derivation of Totally Correct Prolog Procedures from Logic Descriptions. Research Report RP-95-009, University of Namur."},{"key":"3_CR15","volume-title":"An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut","author":"B. Charlier Le","year":"1994","unstructured":"B. Le Charlier, S. Rossi, and P. Van Hentenryck. An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut. In Proc. Int. Logic Programming Symposium, (ILPS'94), Ithaca, NY. The MIT Press, Cambridge, Mass., 1994."},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/174625.174627","volume":"16","author":"B. Charlier Le","year":"1994","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. ACM Transactions on Programming Languages and Systems, 16(1), pp. 35\u2013101, 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR17","volume-title":"Research Paper N. RP-96-028","author":"C. Lecl\u00e8re","year":"1996","unstructured":"C. Lecl\u00e8re and B. Le Charlier. Two Dual Abstract Operations to Duplicate, Eliminate, Equalize, Introduce and Rename Place-Holders Occurring Inside Abstract Descriptions. Research Paper N. RP-96-028, University of Namur, Belgium, September 1996."},{"key":"3_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"},{"issue":"3","key":"3_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(94)00029-6","volume":"23","author":"P. Hentenryck van","year":"1995","unstructured":"P. van Hentenryck, A. Cortesi, and B. Le Charlier, Evaluation of the Domain Prop. The Journal of Logic Programming 23(3):237\u2013278, 1995.","journal-title":"Prop. The Journal of Logic Programming"}],"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-62718-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:11Z","timestamp":1605647651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62718-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627180","9783540684947"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-62718-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}