{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:24:40Z","timestamp":1784183080418,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540266556","type":"print"},{"value":"9783540316831","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11506676_4","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T16:07:52Z","timestamp":1279469272000},"page":"53-68","source":"Crossref","is-referenced-by-count":9,"title":["Fully Automatic Binding-Time Analysis for Prolog"],"prefix":"10.1007","author":[{"given":"Stephen-John","family":"Craig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John P.","family":"Gallagher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Leuschel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim S.","family":"Henriksen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Benoy, F., King, A., Mesnard, F.: Computing Convex Hulls with a Linear Solver. Theory and Practice of Logic Programming (January 2004)","DOI":"10.1017\/S1471068404002261"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-58485-4_33","volume-title":"Static Analysis","author":"D. Boulanger","year":"1994","unstructured":"Boulanger, D., Bruynooghe, M.: A systematic construction of abstract domains. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 61\u201377. Springer, Heidelberg (1994)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-58402-1_30","volume-title":"Programming Language Implementation and Logic Programming","author":"D. Boulanger","year":"1994","unstructured":"Boulanger, D., Bruynooghe, M., Denecker, M.: Abstracting s-semantics using a model-theoretic approach. In: Penjam, J. (ed.) PLILP 1994. LNCS, vol.\u00a0844, pp. 432\u2013446. Springer, Heidelberg (1994)"},{"key":"4_CR4","first-page":"669","volume-title":"Proceedings of ICLP\/SLP","author":"M. Bruynooghe","year":"1988","unstructured":"Bruynooghe, M., Janssens, G.: An instance of abstract interpretation integrating type and mode inferencing. In: Kowalski, R., Bowen, K. (eds.) Proceedings of ICLP\/SLP, pp. 669\u2013683. MIT Press, Cambridge (1988)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BFb0053561","volume-title":"Programming Languages and Systems","author":"M. Bruynooghe","year":"1998","unstructured":"Bruynooghe, M., Leuschel, M., Sagonas, K.: A polyvariant binding-time analysis for off-line partial deduction. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, pp. 27\u201341. Springer, Heidelberg (1998)"},{"key":"4_CR6","volume-title":"Proceedings of the 1993 International Symposium on Logic Programming, Vancouver","author":"M. Codish","year":"1993","unstructured":"Codish, M., Demoen, B.: Analysing logic programs using \u201cProp\u201d-ositional logic programs and a magic wand. In: Miller, D. (ed.) Proceedings of the 1993 International Symposium on Logic Programming, Vancouver. MIT Press, Cambridge (1993)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Static Analysis","author":"M. Codish","year":"1994","unstructured":"Codish, M., Demoen, B.: Deriving type dependencies for logic programs using multiple incarnations of Prop. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(98)00122-4","volume":"238","author":"M. Codish","year":"2000","unstructured":"Codish, M., Lagoon, V.: Type dependencies for logic programs using ACI-unification. Theoretical Computer Science\u00a0238(1-2), 131\u2013159 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish, M., Taboch, C.: A semantic basic for the termination analysis of logic programs. The Journal of Logic Programming\u00a041(1), 103\u2013123 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"4_CR10","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1999), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-49674-2_6","volume-title":"Logic Program Synthesis and Transformation","author":"S. Decorte","year":"1998","unstructured":"Decorte, S., De Schreye, D., Leuschel, M., Martens, B., Sagonas, K.: Termination analysis for tabled logic programming. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 111\u2013127. Springer, Heidelberg (1998)"},{"key":"4_CR12","unstructured":"Gallagher, J., Boulanger, D., Sa\u011flam, H.: Practical model-based static analysis for definite logic programs. In: Lloyd, J.W. (ed.) Proc. of International Logic Programming Symposium, pp. 351\u2013365 (1995)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-27775-0_3","volume-title":"Logic Programming","author":"J.P. Gallagher","year":"2004","unstructured":"Gallagher, J.P., Henriksen, K.: Abstract domains based on regular types. In: Lifschitz, V., Demoen, B. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 27\u201342. Springer, Heidelberg (2004)"},{"key":"4_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45653-8_47","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Genaim","year":"2001","unstructured":"Genaim, S., Codish, M.: Inferring termination conditions of logic programs by backwards analysis. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 681\u2013690. Springer, Heidelberg (2001)"},{"key":"4_CR15","first-page":"421","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"P. Hill","year":"1998","unstructured":"Hill, P., Gallagher, J.: Meta-programming in logic programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol.\u00a05, pp. 421\u2013497. Oxford Science Publications, Oxford University Press, Oxford (1998)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-19426-6_13","volume-title":"Logic Programming \u201987","author":"K. Horiuchi","year":"1988","unstructured":"Horiuchi, K., Kanamori, T.: Polymorphic type inference in prolog by abstract interpretation. In: Furukawa, K., Fujisaki, T., Tanaka, H. (eds.) Logic Programming 1987. LNCS, vol.\u00a0315, pp. 195\u2013214. Springer, Heidelberg (1988)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-24599-5_18","volume-title":"Logic Programming","author":"V. Lagoon","year":"2003","unstructured":"Lagoon, V., Mesnard, F., Stuckey, P.J.: Termination analysis with types is more accurate. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 254\u2013268. Springer, Heidelberg (2003)"},{"key":"4_CR18","unstructured":"Leuschel, M.: The ecce partial deduction system and the dppd library of benchmarks (1996-2002). Obtainable via, http:\/\/www.ecs.soton.ac.uk\/~mal"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-25951-0_11","volume-title":"Program Development in Computational Logic","author":"M. Leuschel","year":"2004","unstructured":"Leuschel, M., Craig, S.-J., Bruynooghe, M., Vanhoof, W.: Specializing interpreters using offline partial deduction. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 341\u2013376. Springer, Heidelberg (2004)"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1017\/S1471068403001662","volume":"4","author":"M. Leuschel","year":"2004","unstructured":"Leuschel, M., J\u00f8rgensen, J., Vanhoof, W., Bruynooghe, M.: Offline specialisation in Prolog using a hand-written compiler generator. Theory and Practice of Logic Programming\u00a04(1), 139\u2013191 (2004)","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR21","first-page":"57","volume-title":"Meta-logics and Logic Programming","author":"B. Martens","year":"1995","unstructured":"Martens, B., De Schreye, D.: Two semantics for definite meta-programs, using the non-ground representation. In: Apt, K.R., Turini, F. (eds.) Meta-logics and Logic Programming, pp. 57\u201382. MIT Press, Cambridge (1995)"},{"key":"4_CR22","first-page":"597","volume-title":"Proceedings ICLP1995","author":"B. Martens","year":"1995","unstructured":"Martens, B., Gallagher, J.: Ensuring global termination of partial deduction while allowing flexible polyvariance. In: Sterling, L. (ed.) Proceedings ICLP1995, Kanagawa, Japan, June 1995, pp. 597\u2013613. MIT Press, Cambridge (1995)"},{"key":"4_CR23","first-page":"214","volume-title":"Logic Program Synthesis and Transformation. Proceedings of LOPSTR1992","author":"T. Mogensen","year":"1992","unstructured":"Mogensen, T., Bondorf, A.: Logimix: A self-applicable partial evaluator for Prolog. In: Lau, K.-K., Clement, T. (eds.) Logic Program Synthesis and Transformation. Proceedings of LOPSTR1992, pp. 214\u2013227. Springer, Heidelberg (1992)"},{"key":"4_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-44404-1_25","volume-title":"Logic for Programming and Automated Reasoning","author":"W. Vanhoof","year":"2000","unstructured":"Vanhoof, W.: Binding-time analysis by constraint solving: a modular and higher-order approach for Mercury. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 399\u2013416. Springer, Heidelberg (2000)"},{"key":"4_CR25","first-page":"500","volume-title":"Proceedings of the International Conference on Logic Programming ICLP1999","author":"W. Vanhoof","year":"1999","unstructured":"Vanhoof, W., Bruynooghe, M.: Binding-time analysis for Mercury. In: De Schreye, D. (ed.) Proceedings of the International Conference on Logic Programming ICLP1999, pp. 500\u2013514. MIT Press, Cambridge (1999)"},{"key":"4_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/3-540-45653-8_49","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"W. Vanhoof","year":"2001","unstructured":"Vanhoof, W., Bruynooghe, M.: Binding-time annotations without binding-time analysis. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 707\u2013722. Springer, Heidelberg (2001)"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45607-4_8","volume-title":"Logic Based Program Synthesis and Transformation","author":"W. Vanhoof","year":"2002","unstructured":"Vanhoof, W., Bruynooghe, M.: When size does matter. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol.\u00a02372, pp. 129\u2013147. Springer, Heidelberg (2002)"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-25951-0_7","volume-title":"Program Development in Computational Logic","author":"W. Vanhoof","year":"2004","unstructured":"Vanhoof, W., Bruynooghe, M., Leuschel, M.: Binding-time analysis for mercury. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 189\u2013232. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11506676_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:28Z","timestamp":1605643408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11506676_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540266556","9783540316831"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11506676_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}