{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:20:26Z","timestamp":1725484826395},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430759"},{"type":"electronic","value":"9783540455752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45575-2_39","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T21:30:22Z","timestamp":1180560622000},"page":"395-405","source":"Crossref","is-referenced-by-count":0,"title":["Reexecution-Based Analysis of Logic Programs with Delay Declarations"],"prefix":"10.1007","author":[{"given":"Agostino","family":"Cortesi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baudouin Le","family":"Charlier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"key":"39_CR1","unstructured":"K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997."},{"key":"39_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-60043-4_47","volume-title":"Verification of logic programs with delay declarations","author":"K. R. Apt","year":"1995","unstructured":"K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. Lecture Notes in Computer Science, 936:66\u201380, 1995."},{"issue":"2","key":"39_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming, 10(2):91\u2013124, February 1991.","journal-title":"Journal of Logic Programming"},{"key":"39_CR4","unstructured":"M. Bruynooghe, G. Janssens, A. Callebaut, and B. Demoen. Abstract interpretation: Towards the global optimization of Prolog programs. In Proceedings of the 1987 Symposium on Logic Programming, pages 192\u2013204, San Francisco, California, August 1987. Computer Society Press of the IEEE."},{"issue":"2","key":"39_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0743-1066(95)00123-9","volume":"27","author":"A. Cortesi","year":"1996","unstructured":"A. Cortesi, G. Fil\u00e9, and W. Winsborough. Optimalgroundness analysis using propositionall ogic. Journal of Logic Programming, 27(2):137\u2013167, May 1996.","journal-title":"Journal of Logic Programming"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combination of abstract domains for logic programming. In Proceedings of the 21th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201994), Portland, Oregon, January 1994.","DOI":"10.1145\/174675.177880"},{"issue":"1\u20133","key":"39_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0167-6423(99)00045-3","volume":"28","author":"A. Cortesi","year":"2000","unstructured":"A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combination of abstract domains for logic programming: open product and generic pattern construction. Science of Computer Programming, 28(1\u20133):27\u201371, 2000.","journal-title":"Science of Computer Programming"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"A. Cortesi, S. Rossi, and B. Le Charlier. Operational semantics for reexecutionbased analysis of logic programs with delay declarations. Electronic Notes in Theoretical Computer Science, 48(1), 2001. http:\/\/www.elsevier.nl\/locate\/entcs .","DOI":"10.1016\/S1571-0661(04)00148-3"},{"key":"39_CR9","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 Conference Record of Fourth ACM Symposium on Programming Languages (POPL\u201977), pages 238\u2013252, Los Angeles, California, January 1977.","DOI":"10.1145\/512950.512973"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of Sixth ACM Symposium on Programming Languages (POPL\u201979), pages 269\u2013282, Los Angeles, California, January 1979.","DOI":"10.1145\/567752.567778"},{"key":"39_CR11","unstructured":"M. Garcia de la Banda, K. Marriott, and P. Stuckey. Efficient analysis of logic programs with dynamic scheduling. In J. Lloyd, editor, Proc. Twelfth International Logic Programming Symposium, pages 417\u2013431. MIT Press, 1995."},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/inco.1997.2638","volume":"137","author":"M. Falaschi","year":"1997","unstructured":"M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Constraint logic programming with dynamic scheduling: A semantics based on closure operators. Information and Computation, 137(1):41\u201367, 1997.","journal-title":"Information and Computation"},{"key":"39_CR13","unstructured":"Intelligent Systems Laboratory, Swedish Institute of Computer Science, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog User\u2019s Manual, 1998. http:\/\/www.sics.se\/isl\/sicstus\/sicstus toc.html ."},{"issue":"1","key":"39_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/174625.174627","volume":"16","author":"B. L. 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 (TOPLAS), 16(1):35\u2013101, January 1994.","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01178260","volume":"32","author":"B. L. Charlier","year":"1995","unstructured":"B. Le Charlier and P. Van Hentenryck. Reexecution in abstract interpretation of Prolog. Acta Informatica, 32:209\u2013253, 1995.","journal-title":"Acta Informatica"},{"key":"39_CR16","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer Series: Symbolic Computation-Artificial Intelligence. Springer-Verlag, second, extended edition, 1987."},{"key":"39_CR17","unstructured":"E. Marchiori and F. Teusink. Proving termination of logic programs with delay declarations. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 447\u2013464, Cambridge, December 4\u20137 1995. MIT Press."},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"K. Marriott, M. Garcia de la Banda, and M. Hermenegildo. Analyzing logic programs with dynamic scheduling. In Proc. 21st Annual ACM Symp. on Principles of Programming Languages, pages 240\u2013253. ACM Press, 1994.","DOI":"10.1145\/174675.177883"},{"key":"39_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Negation and control in Prolog","author":"L. Naish","year":"1986","unstructured":"L. Naish. Negation and control in Prolog. Number 238 in Lecture Notes in Computer Science. Springer-Verlag, New York, 1986."},{"issue":"3","key":"39_CR20","doi-asserted-by":"publisher","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. Journal of Logic Programming, 23(3):237\u2013278, June 1995.","journal-title":"Prop. Journal of Logic Programming"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"K. Yelick and J. Zachary. Moded type systems for logic programming. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages (POPL\u201989), pages 116\u2013124, 1989.","DOI":"10.1145\/75277.75287"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45575-2_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T09:35:05Z","timestamp":1556444105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45575-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430759","9783540455752"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45575-2_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}