{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:10:21Z","timestamp":1725484221691},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438649"},{"type":"electronic","value":"9783540454656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_7","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T01:12:57Z","timestamp":1180228377000},"page":"69-72","source":"Crossref","is-referenced-by-count":2,"title":["Program Debugging and Validation Using Semantic Approximations and Partial Specifications"],"prefix":"10.1007","author":[{"given":"M.","family":"Hermenegildo","sequence":"first","affiliation":[]},{"given":"G.","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"F.","family":"Bueno","sequence":"additional","affiliation":[]},{"given":"P.","family":"L\u00f3pez-Garc\u00eda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"issue":"6","key":"7_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":"7_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":"7_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":"7_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, pages 123\u2013141, Link\u00f6ping, Sweden, May 1997. U. of Link\u00f6ping Press."},{"key":"7_CR5","unstructured":"F. Bueno, D. Cabeza, M. Carro, M. Hermenegildo, P. L\u00f3pez-Garc\u00eda, and G. Puebla. The Ciao Prolog System. Reference Manual. 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":"7_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":"7_CR7","unstructured":"F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M. Hermenegildo, J. Maluszyn-ski, 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."},{"issue":"1","key":"7_CR8","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):35\u2013101, 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-62950-5","volume-title":"Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop","author":"M. Comini","year":"1997","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":"7_CR10","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":"7_CR11","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 4th. ACM Symp. on Principles of Programming Languages, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"7_CR12","doi-asserted-by":"crossref","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.","DOI":"10.1145\/232706.232734"},{"key":"7_CR13","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":"7_CR14","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":"7_CR15","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":"7_CR16","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":"7_CR17","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":"7_CR18","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."},{"key":"7_CR19","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":"7_CR20","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":"7_CR21","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":"7_CR22","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."},{"issue":"2\/3","key":"7_CR23","doi-asserted-by":"crossref","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":"7_CR24","series-title":"Lect Notes Comput Sci","first-page":"63","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"P. G","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":"7_CR25","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":"7_CR26","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":"7_CR27","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":"7_CR28","unstructured":"E. Vetillard. Utilisation de Declarations en Programmation Logique avec Con-straintes. PhD thesis, U. of Aix-Marseilles II, 1994."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45465-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:06:03Z","timestamp":1556449563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}