{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:07:49Z","timestamp":1742987269955,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009863"},{"type":"electronic","value":"9783540366072"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36607-5_1","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T15:21:25Z","timestamp":1183476085000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Abstract Verification and Debugging of Constraint Logic Programs"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Hermenegildo","sequence":"first","affiliation":[]},{"given":"Germ\u00e1n","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Bueno","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"L\u00f3pez-Garc\u00eda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"issue":"6","key":"1_CR1","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(6):743\u2013765, 1994.","journal-title":"Formal Aspects of Computing"},{"issue":"106","key":"1_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"1","author":"K. R. Apt","year":"1993","unstructured":"K. R. Apt and D. Pedreschi. Reasoning about termination of pure PROLOG programs. Information and Computation, 1(106):109\u2013157, 1993.","journal-title":"Information and Computation"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"F. Bourdoncle. Abstract debugging of higher-order imperative languages. In Programming Languages Design and Implementation\u201993, pages 46\u201355, 1993.","DOI":"10.1145\/173262.155095"},{"key":"1_CR4","unstructured":"J. Boye, W. Drabent, and J. Ma\u0142uszy\u0144ski. Declarative diagnosis of constraint programs: an assertion-based approach. In Proc. of the 3rd. Int\u2019l Workshop on Automated Debugging-AADEBUG\u201997, 123\u2013141, Link\u00f6ping, Sweden, May 1997. U. of Link\u00f6ping Press."},{"key":"1_CR5","unstructured":"F. Bueno, D. Cabeza, M. Carro, M. Hermenegildo, P. L\u00f3pez-Garc\u00eda, and G. Puebla. The Ciao Prolog System. Reference Manual. The Ciao System Documentation Series-TR CLIP3\/97.1, School of Computer Science, Technical University of Madrid (UPM), August 1997. System and on-line version of the manual available at http:\/\/clip.dia.fi.upm.es\/Software\/Ciao\/."},{"key":"1_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-61055-3_32","volume-title":"European Symposium on Programming","author":"F. Bueno","year":"1996","unstructured":"F. Bueno, D. Cabeza, M. Hermenegildo, and G. Puebla. Global Analysis of Standard Prolog Programs. In European Symposium on Programming, number 1058 in LNCS, pages 108\u2013124, Sweden, April 1996. Springer-Verlag."},{"key":"1_CR7","unstructured":"F. Bueno, 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 Proc. of the 3rd. Int\u2019l Workshop on Automated Debugging-AADEBUG\u201997, pages 155\u2013170, Link\u00f6ping, Sweden, May 1997. U. of Link\u00f6ping Press."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"D. Cabeza and M. Hermenegildo. The Ciao Module System: A New Module System for Prolog. In Special Issue on Parallelism and Implementation of (C)LP Systems, volume 30 of Electronic Notes in Theoretical Computer Science. Elsevier-North Holland, March 2000.","DOI":"10.1016\/S1571-0661(05)80105-7"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/174625.174627","volume":"16","author":"B. Le Charlier","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):35\u2013101, 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR10","series-title":"Lect Notes Comput Sci","first-page":"22","volume-title":"Analysis and Verification of Multiple-Agent Languages","author":"M. Comini","year":"1996","unstructured":"M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Proving properties of logic programs by abstract diagnosis. In M. Dams, editor, Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop, number 1192 in Lecture Notes in Computer Science, pages 22\u201350. Springer-Verlag, 1996."},{"issue":"1\u20133","key":"1_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0743-1066(98)10033-X","volume":"39","author":"M. Comini","year":"1999","unstructured":"M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Abstract diagnosis. Journal of Logic Programming, 39(1\u20133):43\u201393, 1999.","journal-title":"Journal of Logic Programming"},{"key":"1_CR12","first-page":"275","volume-title":"1995 International Logic Programming Symposium","author":"M. Comini","year":"1995","unstructured":"M. Comini, G. Levi, and G. Vitiello. Declarative diagnosis revisited. In 1995 International Logic Programming Symposium, pages 275\u2013287, Portland, Oregon, December 1995. MIT Press, Cambridge, MA."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Fourth ACM Symposium on Principles of Programming Languages, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"1_CR14","unstructured":"P.W. Dart and J. Zobel. A Regular Type Language for Logic Programs. In F. Pfenning, editor, Types in Logic Programming, pages 157\u2013187. MIT Press, 1992."},{"key":"1_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":"1_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/10722311","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"P. Deransart","year":"2000","unstructured":"P. Deransart, M. Hermenegildo, and J. Maluszynski. Analysis and Visualization Tools for Constraint Programming. Number 1870 in LNCS. Springer-Verlag, September 2000."},{"key":"1_CR17","unstructured":"W. Drabent, S. Nadjm-Tehrani, and J. Ma\u0142uszy\u0144ski. The Use of Assertions in Algorithmic Debugging. In Proceedings of the Intl. Conf. on Fifth Generation Computer Systems, pages 573\u2013581, 1988."},{"key":"1_CR18","unstructured":"W. Drabent, S. Nadjm-Tehrani, and J. Maluszynski. Algorithmic debugging with assertions. In H. Abramson and M.H. Rogers, editors, Meta-programming in Logic Programming, pages 501\u2013522. MIT Press, 1989."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0743-1066(87)90001-X","volume":"4","author":"G. Ferrand","year":"1987","unstructured":"G. Ferrand. Error diagnosis in logic programming. J. Logic Programming, 4:177\u2013198, 1987.","journal-title":"J. Logic Programming"},{"key":"1_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45587-6_16","volume-title":"Fourth International Symposium on Practical Aspects of Declarative Languages","author":"J. Gallagher","year":"2002","unstructured":"J. Gallagher and G. Puebla. Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. In Fourth International Symposium on Practical Aspects of Declarative Languages, number 2257 in LNCS, pages 243\u2013261. Springer-Verlag, January 2002."},{"key":"1_CR21","unstructured":"J.P. Gallagher and D.A. de Waal. Fast and precise regular approximations of logic programs. In Pascal Van Hentenryck, editor, Proc. of the 11th International Conference on Logic Programming, pages 599\u2013613. MIT Press, 1994."},{"issue":"5","key":"1_CR22","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1145\/232706.232734","volume":"18","author":"M. Garc\u00eda de la Banda","year":"1996","unstructured":"M. Garc\u00eda de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems, 18(5):564\u2013615, September 1996.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"M. Hermenegildo. A Documentation Generator for (C)LP Systems. In International Conference on Computational Logic, CL2000, number 1861 in LNAI, pages 1345\u20131361. Springer-Verlag, July 2000.","DOI":"10.1007\/3-540-44957-4_90"},{"key":"1_CR24","unstructured":"M. Hermenegildo, F. Bueno, G. Puebla, and P. L\u00f3pez-Garc\u00eda. Program Analysis, Debugging and Optimization Using the Ciao System Preprocessor. In 1999 International Conference on Logic Programming, pages 52\u201366, Cambridge, MA, November 1999. MIT Press."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"M. Hermenegildo, G. Puebla, and F. Bueno. Using Global Analysis, Partial Specifications, and an Extensible Assertion Language for Program Validation and Debugging. In K. R. Apt, V. Marek, M. Truszczynski, and D. S. Warren, editors, The Logic Programming Paradigm: a 25-Year Perspective, pages 161\u2013192. Springer-Verlag, July 1999.","DOI":"10.1007\/978-3-642-60085-2_7"},{"key":"1_CR26","volume-title":"The Goedel Programming Language","author":"P. Hill","year":"1994","unstructured":"P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Y. Lichtenstein and E. Y. Shapiro. Abstract algorithmic debugging. In R. A. Kowalski and K. A. Bowen, editors, Fifth International Conference and Symposium on Logic Programming, pages 512\u2013531, Seattle, Washington, August 1988. MIT.","DOI":"10.1145\/68210.69239"},{"issue":"2\/3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"K. Muthukumar and M. Hermenegildo. Compile-time Derivation of Variable Dependency Using Abstract Interpretation. Journal of Logic Programming, 13(2\/3):315\u2013347, July 1992.","journal-title":"Journal of Logic Programming"},{"key":"1_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/10722311_3","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"G. Puebla","year":"2000","unstructured":"G. Puebla, F. Bueno, and M. Hermenegildo. A Generic Preprocessor for Program Validation and Debugging. In P. Deransart, M. Hermenegildo, and J. Maluszynski, editors, Analysis and Visualization Tools for Constraint Programming, number 1870 in LNCS, pages 63\u2013107. Springer-Verlag, September 2000."},{"key":"1_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/10722311_2","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"G. Puebla","year":"2000","unstructured":"G. Puebla, F. Bueno, and M. Hermenegildo. An Assertion Language for Constraint Logic Programs. In P. Deransart, M. Hermenegildo, and J. Maluszynski, editors, Analysis and Visualization Tools for Constraint Programming, number 1870 in LNCS, pages 23\u201361. Springer-Verlag, September 2000."},{"key":"1_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/10720327_16","volume-title":"Logic-based Program Synthesis and Transformation (LOPSTR\u201999)","author":"G. Puebla","year":"2000","unstructured":"G. Puebla, F. Bueno, and M. Hermenegildo. Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs. In Logic-based Program Synthesis and Transformation (LOPSTR\u201999), number 1817 in LNCS, pages 273\u2013292. Springer-Verlag, 2000."},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. JLP, 29(1\u20133), October 1996.","DOI":"10.1016\/S0743-1066(96)00068-4"},{"key":"1_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/3-540-45789-5_10","volume-title":"International Static Analysis Symposium","author":"C. Vaucheret","year":"2002","unstructured":"C. Vaucheret and F. Bueno. More precise yet efficient type inference for logic programs. In International Static Analysis Symposium, number 2477 in LNCS, pages 102\u2013116. Springer-Verlag, September 2002."},{"key":"1_CR34","unstructured":"E. Vetillard. Utilisation de Declarations en Programmation Logique avec Constraintes. PhD thesis, U. of Aix-Marseilles II, 1994."},{"key":"1_CR35","unstructured":"E. Yardeni and E. Shapiro. A Type System for Logic Programs. Concurrent Prolog: Collected Papers, pages 211\u2013244, 1987."}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36607-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T01:51:45Z","timestamp":1676685105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-36607-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009863","9783540366072"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-36607-5_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"15 April 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}