{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T18:17:06Z","timestamp":1674843426329},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2007,4]]},"abstract":"\n This article makes two contributions to the work on semantics-based termination analysis for logic programs. The first involves a novel notion of\n type<\/jats:italic>\n -\n based<\/jats:italic>\n norm where for a given type, a corresponding norm is defined to count in a term the number of subterms of that type. This provides a collection of candidate norms, one for each type defined in the program. The second enables an analyzer to base termination proofs on the combination of several different norms. This is useful when different norms are better suited to justify the termination of different parts of the program. Application of the two contributions together consists in considering the combination of the type-based candidate norms for a given program. This results in a powerful and practical technique. Both contributions have been introduced into a working termination analyzer. Experimentation indicates that they yield state-of-the-art results in a fully automatic analysis tool, improving with respect to methods that do not use both types and combined norms.\n <\/jats:p>","DOI":"10.1145\/1216374.1216378","type":"journal-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:11Z","timestamp":1181140631000},"page":"10","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Termination analysis of logic programs through combination of type-based norms"],"prefix":"10.1145","volume":"29","author":[{"given":"Maurice","family":"Bruynooghe","sequence":"first","affiliation":[{"name":"Katholieke Universiteit Leuven, Heverlee, Belgium"}]},{"given":"Michael","family":"Codish","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Beer-Sheva, Israel"}]},{"given":"John P.","family":"Gallagher","sequence":"additional","affiliation":[{"name":"Roskilde University, Roskilde, Denmark"}]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[{"name":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}]},{"given":"Wim","family":"Vanhoof","sequence":"additional","affiliation":[{"name":"University of Namur, Namur, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2007,4]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Handbook of Theoretical Computer Science","author":"Apt K. R.","unstructured":"Apt , K. R. 1990. Introduction to logic programming . In Handbook of Theoretical Computer Science , vol. B: Formal Models and Semantics, J. van Leeuwen, ed. Elsevier, Amsterdam, and MIT Press, Cambridge, MA. 495-- 574 . Apt, K. R. 1990. Introduction to logic programming. In Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, J. van Leeuwen, ed. Elsevier, Amsterdam, and MIT Press, Cambridge, MA. 495--574."},{"key":"e_1_2_1_2_1","volume-title":"From Logic Programming to Prolog","author":"Apt K. R.","unstructured":"Apt , K. R. 1997. From Logic Programming to Prolog . Prentice Hall . Apt, K. R. 1997. From Logic Programming to Prolog. Prentice Hall."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1051"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation (LOPSTR). 204--223","author":"Benoy F.","unstructured":"Benoy , F. and King , A . 1996. Inferring argument size relationships with CLP(R) . In Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation (LOPSTR). 204--223 . Benoy, F. and King, A. 1996. Inferring argument size relationships with CLP(R). In Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation (LOPSTR). 204--223."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001382"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT)","volume":"2","author":"Bossi A.","unstructured":"Bossi , A. , Cocco , N. , and Fabris , M . 1991. Proving termination of logic programs by exploiting term properties . In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT) , vol. 2 . S. Abramsky and T. Maibaum Eds. Lecture Notes in Computer Science , vol. 494. Springer Verlag, Berlin. 153--180. Bossi, A., Cocco, N., and Fabris, M. 1991. Proving termination of logic programs by exploiting term properties. In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), vol. 2. S. Abramsky and T. Maibaum Eds. Lecture Notes in Computer Science, vol. 494. Springer Verlag, Berlin. 153--180."},{"key":"e_1_2_1_7_1","volume-title":"Proceeedings of the 4th European Symposium on Programming (ESOP), B. Krieg-Br\u00fcckner, ed. Lecture Notes in Computer Science","volume":"582","author":"Bossi A.","unstructured":"Bossi , A. , Cocco , N. , and Fabris , M . 1992. Typed norms . In Proceeedings of the 4th European Symposium on Programming (ESOP), B. Krieg-Br\u00fcckner, ed. Lecture Notes in Computer Science , vol. 582 . Springer Verlag, Berlin. 73--92. Bossi, A., Cocco, N., and Fabris, M. 1992. Typed norms. In Proceeedings of the 4th European Symposium on Programming (ESOP), B. Krieg-Br\u00fcckner, ed. Lecture Notes in Computer Science, vol. 582. Springer Verlag, Berlin. 73--92."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/73721.73741"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 9th International Static Analysis Symposium, M. Hermenegildo and G. Puebla, eds. Lecture Notes in Computer Science","volume":"2477","author":"Bruynooghe M.","unstructured":"Bruynooghe , M. , Codish , M. , Genaim , S. , and Vanhoof , W . 2002. Reuse of results in termination analysis of typed logic programs . In Proceedings of the 9th International Static Analysis Symposium, M. Hermenegildo and G. Puebla, eds. Lecture Notes in Computer Science , vol. 2477 . Springer Verlag. 477--492. Bruynooghe, M., Codish, M., Genaim, S., and Vanhoof, W. 2002. Reuse of results in termination analysis of typed logic programs. In Proceedings of the 9th International Static Analysis Symposium, M. Hermenegildo and G. Puebla, eds. Lecture Notes in Computer Science, vol. 2477. Springer Verlag. 477--492."},{"key":"e_1_2_1_10_1","unstructured":"Bruynooghe M. Codish M. Genaim S. and Vanhoof W. 2003. A note on the reuse of the results of a termination analysis based on polymorphic types. Tech. Rep. Katholieke Universiteit Leuven Department of Computer Science. Rep. CW 383. http:\/\/www.cs.kuleuven.ac.be\/publicaties\/rapporten\/cw\/CW383.abs.html. Bruynooghe M. Codish M. Genaim S. and Vanhoof W. 2003. A note on the reuse of the results of a termination analysis based on polymorphic types. Tech. Rep. Katholieke Universiteit Leuven Department of Computer Science. Rep. CW 383. http:\/\/www.cs.kuleuven.ac.be\/publicaties\/rapporten\/cw\/CW383.abs.html."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11547662_5"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, (PSI). Lecture Notes in Computer Science","volume":"2244","author":"Bruynooghe M.","unstructured":"Bruynooghe , M. , Vanhoof , W. , and Codish , M . 2001. Pos(T): Analyzing dependencies in typed logic programs . In Proceedings of the Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, (PSI). Lecture Notes in Computer Science , vol. 2244 . Springer Verlag. 406--420. Bruynooghe, M., Vanhoof, W., and Codish, M. 2001. Pos(T): Analyzing dependencies in typed logic programs. In Proceedings of the Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, (PSI). Lecture Notes in Computer Science, vol. 2244. Springer Verlag. 406--420."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 13th International Workshop on Logic Programming Environments, F. Mesnard and A. Serebrenik, eds. http:\/\/www.cs.kuleuven.ac.be\/publicaties\/rapporten\/cw\/CW371","author":"Codish M.","unstructured":"Codish , M. and Genaim , S . 2003. Proving termination one loop at time . In Proceedings of the 13th International Workshop on Logic Programming Environments, F. Mesnard and A. Serebrenik, eds. http:\/\/www.cs.kuleuven.ac.be\/publicaties\/rapporten\/cw\/CW371 .abs.html. Codish, M. and Genaim, S. 2003. Proving termination one loop at time. In Proceedings of the 13th International Workshop on Logic Programming Environments, F. Mesnard and A. Serebrenik, eds. http:\/\/www.cs.kuleuven.ac.be\/publicaties\/rapporten\/cw\/CW371.abs.html."},{"key":"e_1_2_1_14_1","volume-title":"6th International Workshop on Termination. http:\/\/www.dsic.upv.es\/rdp03\/wst\/proceedings.html.","author":"Codish M.","unstructured":"Codish , M. , Genaim , S. , Bruynooghe , M. , Gallagher , J. , and Vanhoof , W . 2003. One loop at a time . In 6th International Workshop on Termination. http:\/\/www.dsic.upv.es\/rdp03\/wst\/proceedings.html. Codish, M., Genaim, S., Bruynooghe, M., Gallagher, J., and Vanhoof, W. 2003. One loop at a time. In 6th International Workshop on Termination. http:\/\/www.dsic.upv.es\/rdp03\/wst\/proceedings.html."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00006-0"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03038311"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the International Conference on 5th Generation Computer Systems (Japan). 481--488","author":"De Schreye D.","unstructured":"De Schreye , D. , Verschaetse , K. , and Bruynooghe , M . 1992. A framework for analyzing the termination of definite logic programs with respect to call patterns . In Proceedings of the International Conference on 5th Generation Computer Systems (Japan). 481--488 . De Schreye, D., Verschaetse, K., and Bruynooghe, M. 1992. A framework for analyzing the termination of definite logic programs with respect to call patterns. In Proceedings of the International Conference on 5th Generation Computer Systems (Japan). 481--488."},{"key":"e_1_2_1_19_1","volume-title":"Logic Programming - Proceedings of the International Symposium","author":"Decorte S.","unstructured":"Decorte , S. , De Schreye , D. , and Fabris , M . 1993. Automatic inference of norms: A missing link in automatic termination analysis . In Logic Programming - Proceedings of the International Symposium ( Vancouver, Canada), D. Miller, ed. MIT Press (Cambridge, MA.) 420--436. Decorte, S., De Schreye, D., and Fabris, M. 1993. Automatic inference of norms: A missing link in automatic termination analysis. In Logic Programming - Proceedings of the International Symposium (Vancouver, Canada), D. Miller, ed. MIT Press (Cambridge, MA.) 420--436."},{"key":"e_1_2_1_20_1","volume-title":"Tech. Rep. CW 222, K.U. Leuven, Department of Computer Science.","author":"Decorte S.","year":"1996","unstructured":"Decorte , S. , De Schreye , D. , and Fabris , M . 1996 . Integrating types in termination analysis. Tech. Rep. CW 222, K.U. Leuven, Department of Computer Science. Decorte, S., De Schreye, D., and Fabris, M. 1996. Integrating types in termination analysis. Tech. Rep. CW 222, K.U. Leuven, Department of Computer Science."},{"key":"e_1_2_1_21_1","volume-title":"Tech. Rep. CW 246, K.U. Leuven, Department of Computer Science.","author":"Decorte S.","year":"1997","unstructured":"Decorte , S. , De Schreye , D. , and Fabris , M . 1997 . Exploiting the power of typed norms in automatic inference of interargument relations. Tech. Rep. CW 246, K.U. Leuven, Department of Computer Science. Decorte, S., De Schreye, D., and Fabris, M. 1997. Exploiting the power of typed norms in automatic inference of interargument relations. Tech. Rep. CW 246, K.U. Leuven, Department of Computer Science."},{"key":"e_1_2_1_22_1","volume-title":"French Spring School of Theoretical Computer Science Advanced Course on Term Rewriting (Font Romeux, France, May), H. Comon and J.-P","author":"Dershowitz N.","unstructured":"Dershowitz , N. 1995. 33 examples of termination . In French Spring School of Theoretical Computer Science Advanced Course on Term Rewriting (Font Romeux, France, May), H. Comon and J.-P . Jouannaud, eds. Lecture Notes in Computer Science, vol. 909 . Springer Verlag . 16--26. Dershowitz, N. 1995. 33 examples of termination. In French Spring School of Theoretical Computer Science Advanced Course on Term Rewriting (Font Romeux, France, May), H. Comon and J.-P. Jouannaud, eds. Lecture Notes in Computer Science, vol. 909. Springer Verlag. 16--26."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002000100065"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359142"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/326619.326789"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the Practical Aspects of Declarative Languages, 4th International Symposium","volume":"2257","author":"Gallagher J.","unstructured":"Gallagher , J. and Puebla , G . 2002. Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs . In Proceedings of the Practical Aspects of Declarative Languages, 4th International Symposium ( Portland, OR, Jan. 19--20), S. Krishnamurthi and C. R. Ramakrishnan, eds. Lecture Notes in Computer Science , vol. 2257 . Springer, Verlag. 243--261. Gallagher, J. and Puebla, G. 2002. Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. In Proceedings of the Practical Aspects of Declarative Languages, 4th International Symposium (Portland, OR, Jan. 19--20), S. Krishnamurthi and C. R. Ramakrishnan, eds. Lecture Notes in Computer Science, vol. 2257. Springer, Verlag. 243--261."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 11th International Conference on Logic Programming (Santa Margherita Ligure, Italy), P. Van Hentenryck, ed. MIT Press","author":"Gallagher J. P.","unstructured":"Gallagher , J. P. and de Waal, D. A. 1994. Fast and precise regular approximations of logic programs . In Proceedings of the 11th International Conference on Logic Programming (Santa Margherita Ligure, Italy), P. Van Hentenryck, ed. MIT Press , Cambridge, MA. 599--613. Gallagher, J. P. and de Waal, D. A. 1994. Fast and precise regular approximations of logic programs. In Proceedings of the 11th International Conference on Logic Programming (Santa Margherita Ligure, Italy), P. Van Hentenryck, ed. MIT Press, Cambridge, MA. 599--613."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068404002236"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 3rd International Workshop on Verification, Model Checking and Abstract Interpretation, A. Cortesi, ed. Lecture Notes in Computer Science","volume":"2294","author":"Genaim S.","unstructured":"Genaim , S. , Codish , M. , Gallagher , J. , and Lagoon , V . 2002. Combining norms to prove termination . In Proceedings of the 3rd International Workshop on Verification, Model Checking and Abstract Interpretation, A. Cortesi, ed. Lecture Notes in Computer Science , vol. 2294 . Springer Verlag. 126--138. Genaim, S., Codish, M., Gallagher, J., and Lagoon, V. 2002. Combining norms to prove termination. In Proceedings of the 3rd International Workshop on Verification, Model Checking and Abstract Interpretation, A. Cortesi, ed. Lecture Notes in Computer Science, vol. 2294. Springer Verlag. 126--138."},{"key":"e_1_2_1_30_1","unstructured":"Graham R. L. Rothschild B. L. and Spencer J. H. 1980. Ramsey Theory. Wiley-Interscience Series in Discrete Mathematics. John Wiley New York. Graham R. L. Rothschild B. L. and Spencer J. H. 1980. Ramsey Theory. Wiley-Interscience Series in Discrete Mathematics. John Wiley New York."},{"key":"e_1_2_1_31_1","unstructured":"Hill P. M. and Topor R. W. 1992. A semantics for typed logic programs. In Types in Logic Programming F. Pfenning ed. MIT Press Cambridge MA. Hill P. M. and Topor R. W. 1992. A semantics for typed logic programs. In Types in Logic Programming F. Pfenning ed. MIT Press Cambridge MA."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268497"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the International Symposium on Logic Programming, J. Maluszynski, ed. MIT Press","author":"King A.","unstructured":"King , A. , Shen , K. , and Benoy , F . 1997. Lower-Bound time-complexity analysis of logic programs . In Proceedings of the International Symposium on Logic Programming, J. Maluszynski, ed. MIT Press , Cambridge, MA. 261--276. King, A., Shen, K., and Benoy, F. 1997. Lower-Bound time-complexity analysis of logic programs. In Proceedings of the International Symposium on Logic Programming, J. Maluszynski, ed. MIT Press, Cambridge, MA. 261--276."},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 19th International Conference on Logic Programming, C. Palamidessi, ed. Lecture Notes in Computer Science","volume":"2916","author":"Lagoon V.","unstructured":"Lagoon , V. , Mesnard , F. , and Stuckey , P . 2003. Termination analysis with types is more accurate . In Proceedings of the 19th International Conference on Logic Programming, C. Palamidessi, ed. Lecture Notes in Computer Science , vol. 2916 . Springer Verlag. 254--268. Lagoon, V., Mesnard, F., and Stuckey, P. 2003. Termination analysis with types is more accurate. In Proceedings of the 19th International Conference on Logic Programming, C. Palamidessi, ed. Lecture Notes in Computer Science, vol. 2916. Springer Verlag. 254--268."},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 5th International Symposium on Functional and Logic Programming (FLOPS). Lecture Notes in Computer Science","volume":"2024","author":"Lagoon V.","unstructured":"Lagoon , V. and Stuckey , P . 2001. A framework for analysis of typed logic programs . In Proceedings of the 5th International Symposium on Functional and Logic Programming (FLOPS). Lecture Notes in Computer Science , vol. 2024 . Springer Verlag. 296--310. Lagoon, V. and Stuckey, P. 2001. A framework for analysis of typed logic programs. In Proceedings of the 5th International Symposium on Functional and Logic Programming (FLOPS). Lecture Notes in Computer Science, vol. 2024. Springer Verlag. 296--310."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/373243.360210"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 14th International Conference on Logic Programming","author":"Lindenstrauss N.","unstructured":"Lindenstrauss , N. and Sagiv , Y . 1997. Automatic termination analysis of logic programs . In Proceedings of the 14th International Conference on Logic Programming ( Leuven, Belgium), L. Naish, ed. MIT Press, Cambridge, MA. 63--77. Lindenstrauss, N. and Sagiv, Y. 1997. Automatic termination analysis of logic programs. In Proceedings of the 14th International Conference on Logic Programming (Leuven, Belgium), L. Naish, ed. MIT Press, Cambridge, MA. 63--77."},{"key":"e_1_2_1_40_1","volume-title":"Foundations of Logic Programming","author":"Lloyd J.","unstructured":"Lloyd , J. 1987. Foundations of Logic Programming , 2 nd ed. Springer-Verlag , Berlin . Lloyd, J. 1987. Foundations of Logic Programming, 2nd ed. Springer-Verlag, Berlin.","edition":"2"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/176454.176519"},{"key":"e_1_2_1_42_1","volume-title":"6th International Workshop (LOPSTR), J. P. Gallagher, ed. Lecture Notes in Computer Science","volume":"1207","author":"Martin J.","unstructured":"Martin , J. , King , A. , and Soper , P . 1996. Typed norms for typed logic programs. In Logic Programming Synthesis and Transformation , 6th International Workshop (LOPSTR), J. P. Gallagher, ed. Lecture Notes in Computer Science , vol. 1207 . Springer Verlag, 224--238. Martin, J., King, A., and Soper, P. 1996. Typed norms for typed logic programs. In Logic Programming Synthesis and Transformation, 6th International Workshop (LOPSTR), J. P. Gallagher, ed. Lecture Notes in Computer Science, vol. 1207. Springer Verlag, 224--238."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the Joint International Conference and Syposium on Logic Programming","author":"Mesnard F.","year":"1996","unstructured":"Mesnard , F. 1996 . Inferring left-terminating classes of queries for constraint logic programs . In Proceedings of the Joint International Conference and Syposium on Logic Programming ( Bonn, Germany), M. J. Maher, ed. MIT Press, Cambridge, MA. 7--21. Mesnard, F. 1996. Inferring left-terminating classes of queries for constraint logic programs. In Proceedings of the Joint International Conference and Syposium on Logic Programming (Bonn, Germany), M. J. Maher, ed. MIT Press, Cambridge, MA. 7--21."},{"key":"e_1_2_1_44_1","volume-title":"8th International Symposium, P. Cousot, ed. Lecture Notes in Computer Science","volume":"2126","author":"Mesnard F.","unstructured":"Mesnard , F. and Neumerkel , U . 2001. Applying static analysis techniques for inferring termination conditions of logic programs. In Static Analysis , 8th International Symposium, P. Cousot, ed. Lecture Notes in Computer Science , vol. Springer Verlag. 2126 . 93--110. Mesnard, F. and Neumerkel, U. 2001. Applying static analysis techniques for inferring termination conditions of logic programs. In Static Analysis, 8th International Symposium, P. Cousot, ed. Lecture Notes in Computer Science, vol. Springer Verlag. 2126. 93--110."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(84)90017-1"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-30.1.264"},{"key":"e_1_2_1_47_1","volume-title":"10th International Workshop (LOPSTR).","volume":"2042","author":"Serebrenik A.","unstructured":"Serebrenik , A. and De Schreye, D. 2001. Non-Transformational termination analysis of logic programs, based on general term-orderings. In Logic Based Program Synthesis and Transformation , 10th International Workshop (LOPSTR). ( London, UK, Jul. 24--28), K.-K. Lau, ed. Lecture Notes in Computer Science , vol. 2042 . Springer Verlag. 69--85. Serebrenik, A. and De Schreye, D. 2001. Non-Transformational termination analysis of logic programs, based on general term-orderings. In Logic Based Program Synthesis and Transformation, 10th International Workshop (LOPSTR). (London, UK, Jul. 24--28), K.-K. Lau, ed. Lecture Notes in Computer Science, vol. 2042. Springer Verlag. 69--85."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00068-4"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Sterling L. and Shapiro E. 1994. The Art of Prolog 2nd ed. MIT Press Cambridge MA. Sterling L. and Shapiro E. 1994. The Art of Prolog 2nd ed. MIT Press Cambridge MA.","DOI":"10.1109\/MEX.1987.4307074"},{"key":"e_1_2_1_50_1","volume-title":"Terminweb: Semantic based termination analyser for logic programs","author":"Taboch C.","year":"2002","unstructured":"Taboch , C. , Genaim , S. , and Codish , M . 2002 . Terminweb: Semantic based termination analyser for logic programs . http:\/\/www.cs.bgu.ac.il\/~mcodish\/TerminWeb. Taboch, C., Genaim, S., and Codish, M. 2002. Terminweb: Semantic based termination analyser for logic programs. http:\/\/www.cs.bgu.ac.il\/~mcodish\/TerminWeb."},{"key":"e_1_2_1_51_1","volume-title":"11th International Workshop (LOPSTR), A. Pettorossi, ed. Lecture Notes in Computer Science","volume":"2372","author":"Vanhoof W.","unstructured":"Vanhoof , W. and Bruynooghe , M . 2002. When size does matter. In Logic Based Program Synthesis and Transformation , 11th International Workshop (LOPSTR), A. Pettorossi, ed. Lecture Notes in Computer Science , vol. 2372 . Springer Verlag. 129--147. Vanhoof, W. and Bruynooghe, M. 2002. When size does matter. In Logic Based Program Synthesis and Transformation, 11th International Workshop (LOPSTR), A. Pettorossi, ed. Lecture Notes in Computer Science, vol. 2372. Springer Verlag. 129--147."},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the 9th International Static Analysis Symposium. M. Hermenegildo and G. Puebla, eds. Lecture Notes in Computer Science","volume":"2477","author":"Vaucheret C.","unstructured":"Vaucheret , C. and Bueno , F . 2002. More precise yet efficient type inference for logic programs . In Proceedings of the 9th International Static Analysis Symposium. M. Hermenegildo and G. Puebla, eds. Lecture Notes in Computer Science , vol. 2477 . Springer Verlag. 102--116. Vaucheret, C. and Bueno, F. 2002. More precise yet efficient type inference for logic programs. In Proceedings of the 9th International Static Analysis Symposium. M. Hermenegildo and G. Puebla, eds. Lecture Notes in Computer Science, vol. 2477. Springer Verlag. 102--116."}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1216374.1216378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T19:45:11Z","timestamp":1672256711000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1216374.1216378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["10.1145\/1216374.1216378"],"URL":"http:\/\/dx.doi.org\/10.1145\/1216374.1216378","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":["Software"],"published":{"date-parts":[[2007,4]]},"assertion":[{"value":"2007-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}