{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:35Z","timestamp":1725663575322},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572640"},{"type":"electronic","value":"9783540480273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57264-3_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:34:26Z","timestamp":1330259666000},"page":"15-26","source":"Crossref","is-referenced-by-count":3,"title":["Optimization techniques for general purpose fixpoint algorithms practical efficiency for the abstract interpretation of Prolog"],"prefix":"10.1007","author":[{"given":"Baudouin","family":"Charlier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Degimbe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Michel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"crossref","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":"2_CR2","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 Proc.POPL'77, January 1977.","DOI":"10.1145\/512950.512973"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"V. Englebert, B. Le Charlier, D. Roland, and P. Van Hentenryck. Generic abstract interpretation algorithms for Prolog: Two optimization techniques and their experimental evaluation. December 1991. To appear in Software Practice and Experience.","DOI":"10.1007\/3-540-55844-6_144"},{"issue":"4","key":"2_CR4","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0743-1066(92)90053-6","volume":"13","author":"M. Hermenegildo","year":"1992","unstructured":"M. Hermenegildo, R. Warren, and S. Debray. Global Flow Analysis as a Practical Compilation Tool. Journal of Logic Programming, 13(4):349\u2013367, 1992.","journal-title":"Journal of Logic Programming"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"N.D. Jones and A. Mycroft. Dataflow analysis of applicative programs using minimal function graphs. In Proc. POPL'86, 1986.","DOI":"10.1145\/512644.512672"},{"key":"2_CR6","unstructured":"B. Le Charlier, K. Musumbu, and P. Van Hentenryck. Efficient and accurate algorithms for the abstract interpretation of Prolog programs. Technical Report 37\/90, Namur, Belgium, 1990."},{"key":"2_CR7","volume-title":"A generic abstract interpretation algorithm and its complexity analysis","author":"B. Charlier Le","year":"1991","unstructured":"B. Le Charlier, K. Musumbu, and P. Van Hentenryck. A generic abstract interpretation algorithm and its complexity analysis. In Proc. ICLP'91, Paris, France, June 1991. MIT Press."},{"key":"2_CR8","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog. To appear in TOPLAS."},{"key":"2_CR9","volume-title":"Technical Report 92-22","author":"B. Charlier Le","year":"1992","unstructured":"B. Le Charlier and P. Van Hentenryck. A universal top-down fixpoint algorithm. Technical Report 92-22, Institute of Computer Science, University of Namur, Belgium, April 1992."},{"key":"2_CR10","unstructured":"K. Marriott and H. S\u00d8ndergaard. Semantics-based dataflow analysis of logic programs. In G. Ritter, editor, Information Processing'89, pages 601\u2013606, San Fransisco, California, 1989."},{"key":"2_CR11","volume-title":"PhD thesis","author":"K. Musumbu","year":"1990","unstructured":"K. Musumbu. Interpr\u00e9tation Abstraite de Programmes Prolog. PhD thesis, Institute of Computer Science, University of Namur, Belgium, September 1990. In French."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"W. Winsborough. Multiple specialization using minimal-function graph semantics. Journal of Logic Programming, 13(4), February 1992.","DOI":"10.1016\/0743-1066(92)90033-Y"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57264-3_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:24:28Z","timestamp":1640928268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57264-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572640","9783540480273"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57264-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}