{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:28:13Z","timestamp":1725550093561},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119989"},{"type":"electronic","value":"9783642119996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11999-6_8","type":"book-chapter","created":{"date-parts":[[2010,3,16]],"date-time":"2010-03-16T04:52:29Z","timestamp":1268715149000},"page":"111-127","source":"Crossref","is-referenced-by-count":1,"title":["Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation"],"prefix":"10.1007","author":[{"given":"Michael","family":"Leuschel","sequence":"first","affiliation":[]},{"given":"Salvador","family":"Tamarit","sequence":"additional","affiliation":[]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Amram, A.M., Lee, C.S.: Program termination analysis in polynomial time. ACM TOPLAS\u00a029(1) (2007)","DOI":"10.1145\/1180475.1180480"},{"issue":"1-2","key":"8_CR2","first-page":"259","volume":"5","author":"F. Benoy","year":"2005","unstructured":"Benoy, F., King, A., Mesnard, F.: Computing convex hulls with a linear solver. TPLP\u00a05(1-2), 259\u2013271 (2005)","journal-title":"TPLP"},{"issue":"1&2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0743-1066(93)90014-8","volume":"15","author":"M. Bezem","year":"1993","unstructured":"Bezem, M.: Strong Termination of Logic Programs. Journal of Logic Programming\u00a015(1&2), 79\u201397 (1993)","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"8_CR4","first-page":"125","volume":"2","author":"A. Bossi","year":"2002","unstructured":"Bossi, A., Etalle, S., Rossi, S.: Properties of input-consuming derivations. TPLP\u00a02(2), 125\u2013154 (2002)","journal-title":"TPLP"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1145\/1013560.1013564","volume":"5","author":"A. Bossi","year":"2004","unstructured":"Bossi, A., Etalle, S., Rossi, S., Smaus, J.-G.: Termination of simply moded logic programs with dynamic scheduling. ACM Trans. Comput. Log.\u00a05(3), 470\u2013507 (2004)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1","key":"8_CR6","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 basis for the termination analysis of logic programs. Journal of Logic Programming\u00a041(1), 103\u2013123 (1999)","journal-title":"Journal of Logic Programming"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/158511.158707","volume-title":"Proc. of POPL 1993","author":"C. Consel","year":"1993","unstructured":"Consel, C., Danvy, O.: Tutorial notes on Partial Evaluation. In: Proc. of POPL 1993, pp. 493\u2013501. ACM Press, New York (1993)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/11506676_4","volume-title":"Logic Based Program Synthesis and Transformation","author":"S.-J. Craig","year":"2005","unstructured":"Craig, S.-J., Gallagher, J., Leuschel, M., Henriksen, K.S.: Fully Automatic Binding-Time Analysis for Prolog. In: Etalle, S. (ed.) LOPSTR 2004. LNCS, vol.\u00a03573, pp. 53\u201368. Springer, Heidelberg (2005)"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"20","author":"D. Schreye","year":"1994","unstructured":"De Schreye, D., Decorte, S.: Termination of logic programs: The never ending story. The Journal of Logic Programming\u00a019 & 20, 199\u2013260 (1994)","journal-title":"The Journal of Logic Programming 19 &"},{"key":"8_CR10","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.F.: Termination Analysis for Tabled Logic Programming. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 111\u2013127. Springer, Heidelberg (1998)"},{"issue":"2-4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01530930","volume":"3","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A.: Deriving constraints among argument sizes in logic programs. Ann. Math. Artif. Intell.\u00a03(2-4), 361\u2013392 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and Improving Dependency Pairs. J. Autom. Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.entcs.2007.02.062","volume":"190","author":"M. G\u00f3mez-Zamalloa","year":"2007","unstructured":"G\u00f3mez-Zamalloa, M., Albert, E., Puebla, G.: Improving the decompilation of Java bytecode to Prolog by partial evaluation. Electr. Notes Theor. Comput. Sci.\u00a0190(1), 85\u2013101 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"8_CR14","first-page":"184","volume-title":"SCAM","author":"K.S. Henriksen","year":"2006","unstructured":"Henriksen, K.S., Gallagher, J.: Abstract interpretation of pic programs through logic programming. In: SCAM, pp. 184\u2013196. IEEE Computer Society, Los Alamitos (2006)"},{"key":"8_CR15","volume-title":"The G\u00f6del Programming Language","author":"P. Hill","year":"1994","unstructured":"Hill, P., Lloyd, J.W.: The G\u00f6del Programming Language. MIT Press, Cambridge (1994)"},{"issue":"5","key":"8_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker Spin. IEEE Trans. Software Eng.\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. Software Eng."},{"key":"8_CR17","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/373243.360210","volume":"28","author":"C.S. Lee","year":"2001","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The Size-Change Principle for Program Termination. SIGPLAN Notices (Proc. of POPL 2001)\u00a028, 81\u201392 (2001)","journal-title":"SIGPLAN Notices (Proc. of POPL 2001)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","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.: Specialising Interpreters Using Offline Partial Deduction. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 340\u2013375. Springer, Heidelberg (2004)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-00515-2_9","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M. Leuschel","year":"2009","unstructured":"Leuschel, M., Vidal, G.: Fast Offline Partial Evaluation of Large Logic Programs. In: Hanus, M. (ed.) Logic-Based Program Synthesis and Transformation. LNCS, vol.\u00a05438, pp. 119\u2013134. Springer, Heidelberg (2009)"},{"key":"8_CR21","unstructured":"Leuschel, M.: The ecce partial deduction system and the dppd library of benchmarks. Obtainable via 1996-2002, http:\/\/www.ecs.soton.ac.uk\/~mal"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1007\/978-3-540-45236-2_46","volume-title":"FME 2003: Formal Methods","author":"M. Leuschel","year":"2003","unstructured":"Leuschel, M., Butler, M.: ProB: A model checker for B. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol.\u00a02805, pp. 855\u2013874. Springer, Heidelberg (2003)"},{"issue":"2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0743-1066(97)10012-7","volume":"36","author":"M. Leuschel","year":"1998","unstructured":"Leuschel, M., De Schreye, D.: Creating specialised integrity checks through partial evaluation of meta-interpreters. The Journal of Logic Programming\u00a036(2), 149\u2013193 (1998)","journal-title":"The Journal of Logic Programming"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-88194-0_18","volume-title":"Formal Methods and Software Engineering","author":"M. Leuschel","year":"2008","unstructured":"Leuschel, M., Fontaine, M.: Probing the depths of CSP-M: A new FDR-compliant validation tool. In: Liu, S., Maibaum, T., Araki, K. (eds.) ICFEM 2008. LNCS, vol.\u00a05256, pp. 278\u2013297. Springer, Heidelberg (2008)"},{"key":"8_CR25","first-page":"63","volume-title":"Proc. of ICLP 1997","author":"N. Lindenstrauss","year":"1997","unstructured":"Lindenstrauss, N., Sagiv, Y.: Automatic Termination Analysis of Logic Programs. In: Proc. of ICLP 1997, pp. 63\u201377. MIT Press, Cambridge (1997)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/978-3-540-25951-0_14","volume-title":"Program Development in Computational Logic","author":"N. Lindenstrauss","year":"2004","unstructured":"Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 453\u2013498. Springer, Heidelberg (2004)"},{"issue":"1-3","key":"8_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10034-1","volume":"39","author":"E. Marchiori","year":"1999","unstructured":"Marchiori, E., Teusink, F.: Termination of Logic Programs with Delay Declarations. J. Log. Program.\u00a039(1-3), 95\u2013124 (1999)","journal-title":"J. Log. Program."},{"issue":"1","key":"8_CR28","first-page":"181","volume":"15","author":"L. Naish","year":"1993","unstructured":"Naish, L.: Coroutining and the construction of terminating logic programs. Australian Computer Science Communications\u00a015(1), 181\u2013190 (1993)","journal-title":"Australian Computer Science Communications"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-540-27775-0_4","volume-title":"Logic Programming","author":"J.-G. Smaus","year":"2004","unstructured":"Smaus, J.-G.: Termination of Logic Programs Using Various Dynamic Selection Rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 43\u201357. Springer, Heidelberg (2004)"},{"issue":"4","key":"8_CR30","first-page":"447","volume":"1","author":"J.-G. Smaus","year":"2001","unstructured":"Smaus, J.-G., Hill, P.M., King, A.: Verifying termination and error-freedom of logic programs with block declarations. TPLP\u00a01(4), 447\u2013486 (2001)","journal-title":"TPLP"},{"issue":"4","key":"8_CR31","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00200-005-0179-7","volume":"16","author":"R. Thiemann","year":"2005","unstructured":"Thiemann, R., Giesl, J.: The Size-Change Principle and Dependency Pairs for Termination of Term Rewriting. Applicable Algebra in Engineering, Communication and Computing\u00a016(4), 229\u2013270 (2005)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"1","key":"8_CR32","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/371282.371357","volume":"2","author":"S. Verbaeten","year":"2001","unstructured":"Verbaeten, S., Sagonas, K., De Schreye, D.: Termination Proofs for Logic Programs with Tabling. ACM Transactions on Computational Logic\u00a02(1), 57\u201392 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"8_CR33","first-page":"51","volume-title":"Proc. of PEPM 2007","author":"G. Vidal","year":"2007","unstructured":"Vidal, G.: Quasi-Terminating Logic Programs for Ensuring the Termination of Partial Evaluation. In: Proc. of PEPM 2007, pp. 51\u201360. ACM Press, New York (2007)"},{"issue":"2","key":"8_CR34","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00165-005-0066-9","volume":"17","author":"B. Wachter De","year":"2005","unstructured":"De Wachter, B., Genon, A., Massart, T., Meuter, C.: The formal design of distributed controllers with $_{\\mbox{d}}$ sl and Spin. Formal Asp. Comput.\u00a017(2), 177\u2013200 (2005)","journal-title":"Formal Asp. Comput."}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11999-6_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:46:16Z","timestamp":1606185976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11999-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119989","9783642119996"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11999-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}