{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:11Z","timestamp":1725561251322},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206422"},{"type":"electronic","value":"9783540245995"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24599-5_18","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:53:55Z","timestamp":1280393635000},"page":"254-268","source":"Crossref","is-referenced-by-count":7,"title":["Termination Analysis with Types Is More Accurate"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Lagoon","sequence":"first","affiliation":[]},{"given":"Fred","family":"Mesnard","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"From Logic Programming to Prolog","author":"K.R. Apt","year":"1997","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall, Englewood Cliffs (1997)"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(96)00039-1","volume":"31","author":"T. Armstrong","year":"1998","unstructured":"Armstrong, T., Marriott, K., Schachte, P., S\u00f8ndergaard, H.: Two classes of Boolean functions for dependency analysis. Science of Computer Programming\u00a031(1), 3\u201345 (1998)","journal-title":"Science of Computer Programming"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-45789-5_17","volume-title":"Static Analysis","author":"R. Bagnara","year":"2002","unstructured":"Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 213\u2013229. Springer, Heidelberg (2002)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-55253-7_5","volume-title":"ESOP \u201992","author":"A. Bossi","year":"1992","unstructured":"Bossi, A., Cocco, N., Fabris, M.: Typed norms. In: Krieg-Br\u00fcckner, B. (ed.) ESOP 1992. LNCS, vol.\u00a0582, pp. 73\u201392. Springer, Heidelberg (1992)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-45789-5_33","volume-title":"Static Analysis","author":"M. Bruynooghe","year":"2002","unstructured":"Bruynooghe, M., Codish, M., Genaim, S., Vanhoof, W.: Reuse of results in termination analysis of typed logic programs. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 477\u2013492. Springer, Heidelberg (2002)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Bruynooghe, M., Codish, M., Genaim, S., Vanhoof, W.: A note on the reuse of results in termination analysis of typed logic programs. Forthcoming TR, Dpt. CS, K.U. Leuven (2003)","DOI":"10.1007\/3-540-45789-5_33"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bruynooghe, M., Vanhoof, W., Codish, M.: Pos(T): Analyzing dependencies in typed logic programs. In: PSI 2001. LNCS, vol.\u00a02244, pp. 406\u2013420 (2001)","DOI":"10.1007\/3-540-45575-2_40"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"18_CR9","unstructured":"Decorte, S., De Schreye, D., Fabris, M.: Exploiting the power of typed norms in automatic inference of interargument relations. TR 246, Dpt. CS, K.U. Leuven (1997)"},{"issue":"6","key":"18_CR10","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1017\/S1471068401001120","volume":"1","author":"F. Fages","year":"2001","unstructured":"Fages, F., Coquery, E.: Typing constraint logic programs. Theory and Practice of Logic Programming\u00a01(6), 751\u2013777 (2001)","journal-title":"Theory and Practice of Logic Programming"},{"key":"18_CR11","first-page":"599","volume-title":"ICLP","author":"J. Gallagher","year":"1994","unstructured":"Gallagher, J., de Waal, A.: Fast and precise regular approximations of logic programs. In: ICLP, pp. 599\u2013613. MIT Press, Cambridge (1994)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45587-6_16","volume-title":"Practical Aspects of Declarative Languages","author":"J. Gallagher","year":"2002","unstructured":"Gallagher, J., Puebla, G.: Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. In: Krishnamurthi, S., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol.\u00a02257, pp. 243\u2013261. Springer, Heidelberg (2002)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-45788-7_3","volume-title":"Functional and Logic Programming","author":"M. Garc\u00eda de la Banda","year":"2002","unstructured":"Garc\u00eda de la Banda, M., Demoen, B., Marriott, K., Stuckey, P.J.: To the Gates of HAL: A HAL tutorial. In: Hu, Z., Rodr\u00edguez-Artalejo, M. (eds.) FLOPS 2002. LNCS, vol.\u00a02441, pp. 47\u201366. Springer, Heidelberg (2002)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-47813-2_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Genaim","year":"2002","unstructured":"Genaim, S., Codish, M., Gallagher, J., Lagoon, V.: Combining norms to prove termination. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol.\u00a02294, pp. 126\u2013138. Springer, Heidelberg (2002)"},{"key":"18_CR15","unstructured":"Halbwachs, N.: D\u00e9termination Automatique de Relations Lin\u00e9aires V\u00e9rifi\u00e9es par les Variables d\u2019un Programme. PhD thesis, USM de Grenoble, France (1979)"},{"key":"18_CR16","volume-title":"The G\u00f6del Language","author":"P. Hill","year":"1994","unstructured":"Hill, P., Lloyd, J.: The G\u00f6del Language. MIT Press, Cambridge (1994)"},{"issue":"1-3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. Journal of Logic Programming\u00a037(1-3), 1\u201346 (1998)","journal-title":"Journal of Logic Programming"},{"key":"18_CR18","unstructured":"Lagoon, V., Stuckey, P.J.: Polymorphic analysis of typed logic programs. TR, Dpt. CSSE, University of Melbourne, Australia (2003), \n                    \n                      www.cs.mu.oz.au\/~pjs\/papers\/poly-tr.ps"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-62718-9_13","volume-title":"Logic Program Synthesis and Transformation","author":"J. Martin","year":"1997","unstructured":"Martin, J., King, A., Soper, P.: Typed norms for typed logic programs. In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207, pp. 224\u2013238. Springer, Heidelberg (1997)"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-47764-0_6","volume-title":"Static Analysis","author":"F. Mesnard","year":"2001","unstructured":"Mesnard, F., Neumerkel, U.: Applying static analysis techniques for inferring termination conditions of logic programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 93\u2013110. Springer, Heidelberg (2001)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Milner, R.: A theory of type polymorphism in programming. Journal of Computer and System Sciences\u00a017, 348\u2013375 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"Mycroft, A., O\u2019Keefe, R.A.: A Polymorphic Type System for Prolog. Artificial Intelligence\u00a023, 295\u2013307 (1984)","journal-title":"Artificial Intelligence"},{"key":"18_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511530104","volume-title":"Purely Functional Data Structures","author":"C. Okasaki","year":"1998","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)"},{"issue":"1-3","key":"18_CR24","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming\u00a029(1-3), 17\u201364 (1996)","journal-title":"Journal of Logic Programming"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/BFb0032740","volume-title":"Static Analysis","author":"C. Speirs","year":"1997","unstructured":"Speirs, C., Somogyi, Z., S\u00f8ndergaard, H.: Termination analysis for Mercury. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 160\u2013171. Springer, Heidelberg (1997)"},{"key":"18_CR26","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)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24599-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:47:51Z","timestamp":1558298871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24599-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206422","9783540245995"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24599-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}