{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:54Z","timestamp":1751983674440},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552536"},{"type":"electronic","value":"9783540468035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55253-7_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:57:00Z","timestamp":1330250220000},"page":"73-92","source":"Crossref","is-referenced-by-count":7,"title":["Typed norms"],"prefix":"10.1007","author":[{"given":"A.","family":"Bossi","sequence":"first","affiliation":[]},{"given":"N.","family":"Cocco","sequence":"additional","affiliation":[]},{"given":"M.","family":"Fabris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Apt K.R., Pedreschi D., Studies in Pure Prolog: Termination, in Proceedings Symposium on Computational Logic, J. W. Lloyd Ed., Basic Research Series 1, Springer-Verlag (1990), 150\u2013176.","DOI":"10.1007\/978-3-642-76274-1_9"},{"key":"5_CR2","unstructured":"Apt K.R., Introduction to Logic Programming, in Handbook of Theoretical Computer Science, J. van Leeuwen Ed., Elsevier Science Publishers 1990."},{"key":"5_CR3","volume-title":"Proving Termination of General Prolog Programs. Technical Report","author":"K. R. Apt","year":"1991","unstructured":"Apt K.R., Pedreschi D., Proving Termination of General Prolog Programs. Technical Report, CWI, Amsterdam, 1991."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"M. Baudinet. Proving termination properties of PROLOG Programs. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science (LICS), Edinburgh, Scotland (1988), 336\u2013347.","DOI":"10.1109\/LICS.1988.5131"},{"key":"5_CR5","unstructured":"Bezem M., Characterizing Termination of Logic Programs, in Proceedings NACLP'89, E. L. Lusk, R. A. Overbeek, Eds., The MIT Press (1989), 69\u201380."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bossi A., Cocco N., Verifying Correctness of Logic Programs, in Proceedings TAPSOFT'89, Vol. 2, J. Diaz, F. Orejas, Eds., LNCS 352, Springer-Verlag, (1989), 96\u2013110.","DOI":"10.1007\/3-540-50940-2_30"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bossi A., Cocco N., Fabris M., Proving Termination of Logic Programs by Exploiting Term Properties, in Proceedings CCPSD-TAPSOFT '91, S. Abramsky, T.S.E. Maibaum, Eds., LNCS 494, Springer-Verlag, (1991), 153\u2013180.","DOI":"10.1007\/3540539816_66"},{"key":"5_CR8","unstructured":"Bossi A., Cocco N., Fabris M., Norms on terms and their use in proving universal termination of a logic program, CNR Technical Report \u201cProgetto Finalizzato Sistemi Informatici e Calcolo Parallelo\u201d, n. 4\/29 (March 1991)."},{"key":"5_CR9","volume-title":"Technical Report Dip. Matematica Pura e Applicata","author":"A. Bossi","year":"1991","unstructured":"Bossi A., Cocco N., Fabris M., Typed Norms for Logic Programs. Technical Report Dip. Matematica Pura e Applicata, Universit\u00e0 di Padova, Italy, (December 1991)."},{"key":"5_CR10","unstructured":"Bruynooghe M., Janssens G., Callebaut A., Demoen B., Abstract Interpretation: towards the global optimization of Prolog programs, In Proceedings Symp. on Logic Programmming, IEEE Society Press, (1987), 192\u2013204."},{"key":"5_CR11","first-page":"322","volume-title":"Proceedings of LICS 91","author":"A. Cortesi","year":"1991","unstructured":"Cortesi A., Fil\u00e8 G., Winsborough W., Prop Revisited: Propositional Formula as Abstract Domain for Groundness Analysis. In Proceedings of LICS 91. Amsterdam, The Netherlands (July 1991), IEEE Computer Society Press, 322\u2013327."},{"key":"5_CR12","unstructured":"Colussi L., Marchiori E, Proving Correctness of Logic Programs Using Axiomatic Semantics, in Proceedings ICLP'91, K. Furukawa, Ed., The MIT Press (1991) 629\u2013642."},{"issue":"3","key":"5_CR13","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1145\/65979.65983","volume":"11","author":"S. Debray","year":"1989","unstructured":"Debray S., Static Inference of Modes and data Dependencies in Logic Programs, ACM Trans. on Programming Languages and Systems 11, No. 3, (1989), 418\u2013450.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"5_CR14","unstructured":"Deville Y., Logic Programming Systematic Program Development, Addison-Wesley 1990."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Francez N., Grumberg O., Katz S., Pnueli A., Proving Termination of Prolog Programs. In Logics of Programs LNCS 193, Springer-Verlag, 1985, 89\u2013105.","DOI":"10.1007\/3-540-15648-8_8"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Fil\u00e8 G. and Sottero P., Abstract Interpretation for Type Checking. In Procceding of PLILP 91, J. Maluszynski and M. Wirsing (eds), LNCS 528, Springer-Verlag, (1991), 311\u2013322.","DOI":"10.1007\/3-540-54444-5_108"},{"key":"5_CR17","unstructured":"Janssens G., Bruynooghe M., Deriving Descriptions of Possible Values of Program Variables by means of Abstract Interpretation, Technical Report CW 107, Dept. of Computer Science, K.U. Leuven, (March 1990), to appear in Journal of Logic Programming."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Lloyd J. W., Foundations of Logic Programming, second edition, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"5_CR19","unstructured":"Marriott K., S\u00f8ndergaard H., Abstract Interpretation of Logic Programs: the Denotational Approach. In Proceedings GULP '90, A. Bossi (ed.), Padova (June 1990), 399\u2013425."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Pl\u00fcmer L., Termination Proofs for Logic Programs based on Predicate Inequalities, in Proceedings ICLP'90, (1990), 634\u2013648.","DOI":"10.1007\/3-540-52837-7"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Pl\u00fcmer L., Termination Proofs for Logic Programs, Lecture Notes in Artificial Intelligence 446, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"2","author":"J. D. Ullman","year":"1988","unstructured":"Ullman J.D., Van Gelder A., Efficient Tests for Top-Down Termination of Logical Rules, JACM 35, No. 2, (1988), 345\u2013373.","journal-title":"JACM 35"},{"key":"5_CR23","unstructured":"Vasak T., Potter J., Characterisation of Terminating Logic Programs, in Proceedings Int. Symposium on Logic Programming '86, IEEE, (1986) 140\u2013147."},{"key":"5_CR24","first-page":"301","volume-title":"Proceedings ICLP'91","author":"K. Verschaetse","year":"1991","unstructured":"Verschaetse K., De Schreye D., Deriving Termination Proofs for Logic Programs Using Abstract Procedures. In Proceedings ICLP'91, Paris, June 1991. The MIT Press, 301\u2013315."},{"key":"5_CR25","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1142\/9789814368452_0021","volume-title":"Perspective in Theoretical Computer Science, Commemorative Volume","author":"B. Wang","year":"1989","unstructured":"Wang B., Shryamasunder R.K., Proving Termination of Logic Programs, In Perspective in Theoretical Computer Science, Commemorative Volume, Ed. R. Narasimhan, World Scientific Publishers, Singapore, 380\u2013397 (1989)."},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Wang B., Shryamasunder R.K., Methodology for Proving the Termination of Logic Programs, In Proceedings STACS'91. Hamburg, Germany, February 1991.","DOI":"10.1007\/BFb0020800"}],"container-title":["Lecture Notes in Computer Science","ESOP '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55253-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:30Z","timestamp":1605646710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55253-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552536","9783540468035"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-55253-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}