{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:48Z","timestamp":1725664188616},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:26:35Z","timestamp":1330255595000},"page":"1-25","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The costs and benefits of abstract interpretation-driven Prolog optimization"],"prefix":"10.1007","author":[{"given":"Thomas W.","family":"Getzinger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"1_CR1","unstructured":"M. Bruynooghe, G. Janssens, Alain Callebaut, and B. Demoen. Abstract Interpretation: Towards the Global Optimisation of Prolog Programs. In 1987 IEEE Symposium on Logic Programming, pp. 192\u2013204, 1987."},{"key":"1_CR2","unstructured":"M. Bruynooghe and G. Janssens. An Instance of Abstract Interpretation Integrating Type and Mode Inferencing. In Logic Programming: Proceedings of the 5th International Conference, pp. 669\u2013683, August 1988."},{"key":"1_CR3","unstructured":"M. Bruynooghe. A Frameworkfor the Abstract Interpretation of Logic Programs. Report CW 62, Dept. of Computer Science, K.U. Leuven, October 1987."},{"key":"1_CR4","unstructured":"J. Chang and A. Despain. Semi-Intelligent Backtracking of Prolog Based on A Static Data Dependency Analysis. In Logic Programming conference, July 1985."},{"key":"1_CR5","series-title":"Report UCB\/CSD #88\/415","volume-title":"Ph.D. Thesis","author":"W. Citrin","year":"1988","unstructured":"W. Citrin. Parallel Unification Scheduling in Prolog. Ph.D. Thesis, University of California, Berkeley, Report UCB\/CSD #88\/415, 1988."},{"key":"1_CR6","unstructured":"A. Cortesi, G. File, and W. Winsborough. Comparison of Abstract Interpretations. Internal report 14 \u2014 18.11.1991. Departmento di Matematica. November 1991."},{"key":"1_CR7","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 POPL, pp. 238\u2013252, June 1977.","DOI":"10.1145\/512950.512973"},{"key":"1_CR8","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation and Application to Logic Programs. Research Report 92-12, LIENS Laboratoire d'Informatique de l'Ecole Normale Superieure, June 1992."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"S. Debray and D. S. Warren. Detection and Optimization of Functional Computations in Prolog. In Proceedings of the Third International Conference on Logic Programming, pp. 490\u2013504. July 1986.","DOI":"10.1007\/3-540-16492-8_97"},{"key":"1_CR10","unstructured":"S. Debray and D. S. Warren. Automatic Mode Inference for Prolog Programs. In IEEE 1986 Symposium on Logic Programming, pp. 78\u201388, September 1986."},{"key":"1_CR11","unstructured":"S. Dietrich. Extension Tables: Memo Relations in Logic Programming. In Proceedings of the 4th International Symposium on Logic Programming, pp. 264\u2013272. 1987."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"B. Holmer, et al. Fast Prolog with an Extended General Purpose Architecture. In The 17th Annual International Symposium on Computer Architecture Conference Proceedings, pp. 282\u2013291, June 1990.","DOI":"10.1145\/325164.325154"},{"key":"1_CR13","unstructured":"T. Getzinger. Abstract Interpretation for the Compile-time Optimization of Logic Programs. Ph.D. Thesis, University of Southern California, December 1993."},{"key":"1_CR14","unstructured":"G. Gudjonsson and W. Winsborough. Update in Place: Overview of the Siva Project. Technical Report CS-93-11, Pennsylvania State University, May 1993."},{"key":"1_CR15","unstructured":"D. Jacobs and A. Langen. Accurate and Efficient Approximation of Variable Aliasing in Logic Programs. In Logic Programming: Proceedings of the North American Conference 1989, pp. 154\u2013165, October 1989."},{"key":"1_CR16","unstructured":"D.Jacobs. A Framework for the Abstract Interpretation of Logic Programs. (Unpublished). October 1991."},{"key":"1_CR17","unstructured":"G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Report CW 107, Department of Computer Science, K. U. Leuven. March 1990."},{"key":"1_CR18","unstructured":"G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation: definitions and proofs. Report CW 108, Department of Computer Science, K. U. Leuven. April 1990."},{"key":"1_CR19","unstructured":"N. Jones and H. S\u00f8ndergaard. A Semantics-Based Framework for the Abstract Interpretation of Prolog. Report No. 86\/14, Institute of Datalogy, University of Copenhagen, 1986."},{"key":"1_CR20","unstructured":"R. Kemp and G. Ringwood. An Algebraic Framework for Abstract Interpretation of Definite Programs. In Proceedings of the North American Conference on Logic Programming '90, pp. 516\u2013530, October 1990."},{"key":"1_CR21","unstructured":"F. Kluzniak. Compile Time Garbage Collection for Ground Prolog. In Logic Programming: Proceedings of the 5th International Conference, pp. 1490\u20131505, 1988."},{"key":"1_CR22","unstructured":"A. Langen. Advanced Techniques for Approximating Variable Aliasing in Logic Programs. PhD Thesis. University of Southern California. December 1990."},{"key":"1_CR23","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog. Technical Report No. CS-91-55, Brown University, August 1991."},{"key":"1_CR24","volume-title":"Research Paper No. RP-90\/9","author":"B. Charlier Le","year":"1990","unstructured":"B. Le Charlier, K. Musumbu, and P. Van Hentenryck. Efficient and Accurate Algorithms for the Abstract Interpretation of Prolog Programs. Research Paper No. RP-90\/9, University of Namur, Belgium, August 1990."},{"key":"1_CR25","unstructured":"B. Le Charlier and P. Van Hentenryck. Reexecution in Abstract Interpretation of Prolog. Technical Report No. CS-92-12, Brown University. March 1992."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"J. Lloyd. Foundations of Logic Programming, Springer-Verlag 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"1_CR27","unstructured":"A. Marien and B. Demoen. On the Management of Choicepoint and Environment Frames in the WAM. In Logic Programming: Proceedings of the North American Conference 1989, pp. 1030\u20131047, October 1989."},{"key":"1_CR28","unstructured":"A. Marien, G. Janssens, A. Mulkers, and M. Bruynooghe. The impact of abstract interpretation: an experiment in code generation. In Logic Programming: Proceedings of the 6th International Conference, pp. 33\u201347, June 1989."},{"key":"1_CR29","unstructured":"K. Marriott and H. S\u00f8ndergaard. Analysis of Constraint Logic Programs. In Proceedings of the North American Conference on Logic Programming '90, pp. 531\u2013547, October 1990."},{"key":"1_CR30","unstructured":"H. Mannila and E. Ukkonen. Flow Analysis of Prolog Programs. In 1987 IEEE Symposium on Logic Programming, pp. 205\u2013214, 1987."},{"key":"1_CR31","unstructured":"M. Meier. Recursion vs. Iteration in Prolog. In Proceedings of the Eighth International Conference on Logic Programming, pp. 157\u2013169, June 1991."},{"key":"1_CR32","unstructured":"C. Mellish. Automatic Generation of Mode Declarations for Prolog Programs (Draft). DAI Research Paper 163, Dept. of Artificial Intelligence, University of Edinburgh, August 1981."},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"C. Mellish. Abstract Interpretation of Prolog Programs. In Proceedings of the Third International Conference on Logic Programming, pp. 463\u2013474, July 1986.","DOI":"10.1007\/3-540-16492-8_95"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0743-1066(85)90004-4","volume":"2","author":"C. Mellish","year":"1985","unstructured":"C. Mellish. Some Global Optimizations for a Prolog Compiler. In Journal of Logic Programming, Vol 2, pp. 43\u201366, April 1985.","journal-title":"Journal of Logic Programming"},{"key":"1_CR35","unstructured":"K. Muthukumar and M. Hermenegildo. Determination of Variable Dependence Information Through Abstract Interpretation. In Proceedings of the North American Conference on Logic Programming '89, pp. 166\u2013185, August 1989."},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"U. Nilsson. Towards a Framework for the Abstract Interpretation of Logic Programs. In Lecture Notes in Computer Science, Vol. 348 (Programming Languages Implementation and Logic Programming International Workshop '88), pp. 68\u201382, May 1988.","DOI":"10.1007\/3-540-50820-1_41"},{"key":"1_CR37","unstructured":"T. Pabst, Dataflow Analysis and Modular Logic Programs. Diplomarbeit, TU-Berlin, November 1991."},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"J. Tan and I. Lin. Compiling Dataflow Analysis of Logic Programs. (Unpublished) 1992.","DOI":"10.1145\/143095.143123"},{"key":"1_CR39","unstructured":"A. Taylor. Removal of Dereferencing and Trailing in Prolog Compilation. In Logic Programming: Proceedings of the 6th International Conference, pp. 48\u201360, June 1989."},{"key":"1_CR40","unstructured":"A. Taylor. High Performance Prolog Implementation. PhD Thesis. University of Sydney, June 1991."},{"key":"1_CR41","unstructured":"H. Touati and A. Despain. An empirical study of the Warren Abstract Machine. In Proceedings of the 1987 Symposium on Logic Programming, pp. 114\u2013124. San Francisco 1987."},{"key":"1_CR42","series-title":"Report UCB\/CSD#90\/600","volume-title":"Ph.D. Thesis","author":"P. Roy Van","year":"1990","unstructured":"P. Van Roy. Can Logic Programming Execute as Fast as Imperative Programming?. Ph.D. Thesis, University of California, Berkeley, Report UCB\/CSD#90\/600, December 1990."},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"P. Van Roy and A. Despain. High-Performance Logic Programming with the Aquarius Prolog Compiler. In Computer, pp. 54\u201368, January 1992.","DOI":"10.1109\/2.108055"},{"key":"1_CR44","unstructured":"A. W\u00e6rn. An Implementation Technique for the Abstract Interpretation of Prolog. In Logic Programming: Proceedings of the 5th International Conference, pp. 700\u2013710, August 1988."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:46:52Z","timestamp":1640918812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}