{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:59Z","timestamp":1725664979548},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617396"},{"type":"electronic","value":"9783540706748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61739-6_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:19:05Z","timestamp":1330294745000},"page":"270-284","source":"Crossref","is-referenced-by-count":20,"title":["Optimized algorithms for incremental analysis of logic programs"],"prefix":"10.1007","author":[{"given":"Germ\u00e1n","family":"Puebla","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"19_CR1","unstructured":"F. Bueno, M. Garc\u00eda de la Banda, and M. Hermenegildo. Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization. In International Symposium on Logic Programming, pages 320\u2013336. MIT Press, November 1994."},{"key":"19_CR2","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:91\u2013124, 1991.","journal-title":"Journal of Logic Programming"},{"key":"19_CR3","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"},{"issue":"1","key":"19_CR4","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":"19_CR5","doi-asserted-by":"crossref","unstructured":"S. Debray, editor. Journal of Logic Programming, Special Issue: Abstract Interpretation, volume 13(1\u20132). North-Holland, July 1992.","DOI":"10.1016\/0743-1066(92)90029-3"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"M. Hermenegildo, K. Marriott, G. Puebla, and P. Stuckey. Incremental Analysis of Logic Programs. In International Conference on Logic Programming. MIT Press, June 1995.","DOI":"10.7551\/mitpress\/4298.003.0075"},{"issue":"4","key":"19_CR7","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, August 1992.","journal-title":"Journal of Logic Programming"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"N. Jorgensen. Finding Fixpoints in Finite Function Spaces Using Neededness Analysis and Chaotic Iteration. In International Static Analysis Symposium. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58485-4_50"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"A. Krall and T. Berger. Incremental global compilation of prolog with the vienna abstract machine. In International Conference on Logic Programming. MIT Press, June 1995.","DOI":"10.7551\/mitpress\/4298.003.0038"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"B. Le Charlier, O. Degimbe, L. Michel, and P. Van Henteryck. Optimization Techniques for General Purpose Fixpoint Algorithms: Practical Efficiency for the Abstract Interpretation of Prolog. In International Workshop on Static Analysis. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57264-3_26"},{"key":"19_CR11","volume-title":"Technical Report ACT-DC-153-90","author":"K. Muthukumar","year":"1990","unstructured":"K. Muthukumar and M. Hermenegildo. Deriving A Fixpoint Computation Algorithm for Top-down Abstract Interpretation of Logic Programs. Technical Report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759, April 1990."},{"key":"19_CR12","unstructured":"K. Muthukumar and M. Hermenegildo, Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In International Conference on Logic Programming, MIT Press, June 1991."},{"issue":"2","key":"19_CR13","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 and 3):315\u2013347, July 1992.","journal-title":"Journal of Logic Programming"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"G. Puebla and M. Hermenegildo. Implementation of Multiple Specialization in Logic Programs. In Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation. ACM, June 1995.","DOI":"10.1145\/215465.215561"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"G. Puebla and M. Hermenegildo. Optimized Algorithms for Incremental Analysis of Logic Programs. Technical Report CLIP3\/96.0, Facultad de Inform\u00e1tica, UPM, 1996.","DOI":"10.1007\/3-540-61739-6_47"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"P. Van Roy and A.M. Despain. High-Performace Logic Programming with the Aquarius Prolog Compiler. IEEE Computer Magazine, pages 54\u201368, January 1992.","DOI":"10.1109\/2.108055"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"V. Santos-Costa, D.H.D. Warren, and R. Yang. The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model. In 1991 International Conference on Logic Programming. MIT Press, June 1991.","DOI":"10.1145\/109625.109635"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"B. Vergauwen, J. Wauman, and J. Levi. Efficient Fixpoint Computation. In International Static Analysis Symposium. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58485-4_49"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61739-6_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:45:12Z","timestamp":1713635112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}