{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:26Z","timestamp":1725488606653},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003892"},{"type":"electronic","value":"9783540363880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36388-2_20","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T09:50:36Z","timestamp":1186825836000},"page":"286-303","source":"Crossref","is-referenced-by-count":0,"title":["WAM Local Analysis"],"prefix":"10.1007","author":[{"given":"Michel","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Damas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"1. Hassan A\u00eft-Kaci. Warren\u2019s Abstract Machine - A Tutorial Reconstruction. MIT Press, 1991.","DOI":"10.7551\/mitpress\/7160.001.0001"},{"key":"20_CR2","unstructured":"Mats Carlsson. Internals of Sicstus Prolog version 0.6. Internal Report, Gigalips Project, November 1987."},{"key":"20_CR3","unstructured":"Mats Carlsson. Design and Implementation of an OR-Parallel Prolog Engine. SICS Dissertation Series 02, The Royal Institute of Technology, 1990."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Philippe Codognet and Daniel Diaz. wamcc: Compiling Prolog to C. In Leon Sterling, editor, Proc. of the 12th International Conference on Logic Programming, pages 317\u2013332, Cambridge, June 13-18 1995. MIT Press.","DOI":"10.7551\/mitpress\/4298.003.0037"},{"key":"20_CR5","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. of SPPL\u201977, pages 238\u2013252, Los Angeles, California, 1977.","DOI":"10.1145\/512950.512973"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. The Journal of Logic Programming, 13(1, 2, 3 and 4):103\u2013179, 1992.","journal-title":"The Journal of Logic Programming"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"S. K. Debray. Abstract Interpretation and Low-Level Code Optimization. In Proc. of PEPM\u201995, pages 111\u2013121. ACM Press, June 1995.","DOI":"10.1145\/215465.215571"},{"key":"20_CR8","unstructured":"M. Ferreira. Advanced Specialization Techniques for the Compilation of Declarative Languages . PhD thesis, Universidade do Porto, April 2002."},{"key":"20_CR9","series-title":"Lect Notes Comput Sci","first-page":"243","volume-title":"Multiple specialization of WAM code","author":"M. Ferreira","year":"1999","unstructured":"M. Ferreira and L. Damas. Multiple specialization of WAM code. Proc. of PADL\u201999, LNCS, 1551:243\u2013258, 1999."},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","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. K. Debray. Global Flow Analysis as a Practical Compilation Tool. JLP, 13(4):349\u2013367, August 1992.","journal-title":"JLP"},{"key":"20_CR11","unstructured":"D. Jacobs, A. Langen, and W. Winsborough. Multiple specialization of logic programs with run-time tests. Proc. of ICLP\u201990, pages 717\u2013731, June 1990."},{"key":"20_CR12","unstructured":"A. Kelly, A. Macdonald, K. Marriott, P. Stuckey, and R. Yap. Effectiveness of optimizing compilation for CLP(R). Proc. of JICSLP\u201996, pages 37\u201351, 1996."},{"key":"20_CR13","unstructured":"A. King and P. Soper. Depth-k sharing and freeness. In Proc. of the ICLP\u201994, pages 553\u2013568. The MIT Press, 1994."},{"key":"20_CR14","unstructured":"A. Krall and T. Berger. The VAMAI-an abstract machine for incremental global dataflow analysis of Prolog. In ICLP\u201995 Post-Conference Workshop on Abstract Interpretation of Logic Languages, pages 80\u201391, Tokyo, 1995."},{"key":"20_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0024180","volume-title":"The Vienna Abstract Machine","author":"A. Krall","year":"1990","unstructured":"A. Krall and U. Neumerkel. The Vienna Abstract Machine. In Proc. of PLIP\u201990, number 456 in LNCS, pages 121\u2013135. Sweeden, Springer-Verlag, 1990."},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(96)00050-7","volume":"28","author":"T. Lindgren","year":"1996","unstructured":"Thomas Lindgren. Polyvariant detection of uninitialized arguments of Prolog predicates. Journal of Logic Programming, 28(3):217\u2013229, September 1996.","journal-title":"Journal of Logic Programming"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"G. Puebla and M. Hermenegildo. Implementation of Multiple Specialization in Logic Programs. In Proc. of PEPM\u201995, pages 77\u201387. ACM Press, June 1995.","DOI":"10.1145\/215465.215561"},{"issue":"1\u20132","key":"20_CR18","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","volume":"34","author":"T. Sato","year":"1984","unstructured":"Taisuke Sato and Hisao Tamaki. Enumeration of success patterns in logic programs. Theoretical Computer Science, 34(1\u20132):227\u2013240, November 1984.","journal-title":"Theoretical Computer Science"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"J. Tan and I. Lin. Compiling dataflow analysis of logic programs. In Proc. of PLDI\u201992, pages 106\u2013115, San Francisco, California, 1992. SIGPLAN.","DOI":"10.1145\/143095.143123"},{"key":"20_CR20","unstructured":"A. Taylor. Removal of Dereferencing and Trailing in Prolog Compilation. In Proc. of ICLP\u201989, pages 48\u201360, Lisbon, 1989. The MIT Press."},{"key":"20_CR21","unstructured":"A. Taylor. High Performance Prolog Implementation. PhD thesis, University of Sydney, June 1991."},{"key":"20_CR22","unstructured":"P. Van Roy. Can Logic Programming Execute as Fast as Imperative Programming? PhD thesis, University of California at Berkeley, November 1990."},{"key":"20_CR23","unstructured":"W. H. Winsborough. Path-dependent reachability analysis for multiple specialization. In Proc. of NACLP\u201989. \u201cMIT Press\u201d, 1989."}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36388-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T10:11:35Z","timestamp":1708164695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36388-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,16]]},"ISBN":["9783540003892","9783540363880"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36388-2_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002,12,16]]}}}