{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:32:09Z","timestamp":1720625529894},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4920,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s1571-0661(04)00153-7","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"131-146","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Logic programs as specifications in the inductive verification of logic programs"],"prefix":"10.1016","volume":"48","author":[{"given":"Marco","family":"Comini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberta","family":"Gori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Levi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB1","series-title":"Formal Models and Semantics, Handbook of Theoretical Computer Science B","first-page":"495","article-title":"Introduction to logic programming","author":"Apt","year":"1990"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB2","unstructured":"Bueno F., P. Deransart, W. Drabent, G. Ferrand, M. Hermenegildo, J. Maluszynski and G. Puebla, On the role of semantic approximations in validation and diagnosis of constraint logic programs, in: M. Kamkar, editor, Proceedings of the AADEBUG'97 (The Third International Workshop on Automated Debugging) (1997), pp. 155\u2013169."},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB3","unstructured":"Comini M., R. Gori, G. Levi and P. Volpe, Abstract interpretation based verification of logic programs, submitted for publication."},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0743-1066(98)10033-X","article-title":"Abstract diagnosis","volume":"39","author":"Comini","year":"1999","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Cousot P. and R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of Fourth ACM Symp. Principles of Programming Languages, 1977, pp. 238\u2013252.","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Cousot P. and R. Cousot, Systematic design of program analysis frameworks, in: Proceedings of Sixth ACM Symp. Principles of Programming Languages, 1979, pp. 269\u2013282.","DOI":"10.1145\/567752.567778"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB7","series-title":"Meta-programming in Logic Programming","first-page":"383","article-title":"Algorithmic debugging with assertions","author":"Drabent","year":"1989"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0743-1066(87)90001-X","article-title":"Error diagnosis in logic programming, an adaptation of E.Y. Shapiro's method","volume":"4","author":"Ferrand","year":"1987","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Levi G. and P. Volpe, Derivation of proof methods by abstract interpretation, in: C. Palamidessi, H. Glaser and K. Meinke, editors, Principles of Declarative Programming. 10th, International Symposium, PLILP'98, Lecture Notes in Computer Science 1490 (1998), pp. 102\u2013117.","DOI":"10.1007\/BFb0056610"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB10","series-title":"\u201cFoundations of Logic Programming\u201d","author":"Lloyd","year":"1987"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB11","unstructured":"Pettorossi A. and M. Proietti, Map: A tool for program transformation. URL http:\/\/www.iasi.rm.cnr.it\/~proietti\/system.html"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB12","series-title":"Handbook of Logic in Artificial Intellince and Logic Programming 5","first-page":"697","article-title":"Transformation of logic programs","author":"Pettorossi","year":"1998"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0743-1066(99)00029-1","article-title":"Synthesis and transformation of logic programs using unfold\/fold proofs","volume":"41","author":"Pettorossi","year":"1999","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB14","series-title":"Analysis and Visualization Tools for Constraint Programming, number 1870 in LNCS","first-page":"23","article-title":"An Assertion Language for Constraint Logic Programs","author":"Puebla","year":"2000"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB15","series-title":"Analysis and Visualization Tools for Constraint Programming, number 1870 in LNCS","first-page":"63","article-title":"A generic preprocessor for program validation and debugging","author":"Puebla","year":"2000"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB16","series-title":"\u201cAlgorithmic Program Debugging\u201d","author":"Shapiro","year":"1983"},{"key":"10.1016\/S1571-0661(04)00153-7_NEWBIB17","doi-asserted-by":"crossref","unstructured":"Volpe P., A first-order language for expressing aliasing and type properties of logic programs, Science of Computer Programming (2000), to appear.","DOI":"10.1016\/S0167-6423(00)00017-4"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T23:03:51Z","timestamp":1682636631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":17,"alternative-id":["S1571066104001537"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00153-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}