{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:17Z","timestamp":1725467417770},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558446"},{"type":"electronic","value":"9783540472971"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55844-6_143","type":"book-chapter","created":{"date-parts":[[2006,7,13]],"date-time":"2006-07-13T05:22:29Z","timestamp":1152768149000},"page":"296-310","source":"Crossref","is-referenced-by-count":8,"title":["Derivation of linear size relations by abstract interpretation"],"prefix":"10.1007","author":[{"given":"Kristof","family":"Verschaetse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"De Schreye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,28]]},"reference":[{"key":"20_CR1","unstructured":"R. Barbuti, R. Giacobazzi, and G. Levi. A general framework for semantics based bottom-up abstract interpretation of logic programs. Technical Report 20\/89, Dipartimento di Informatics., Universita di Pisa, 1989. To appear in ACM transactions on programming languages and systems."},{"key":"20_CR2","unstructured":"A. Bossi, N. Cocco, and M. Fabris. Norms on terms and their use in proving universal termination of a logic program. Technical Report 4\/29, CNR, Department of Mathematics, University of Padova, March 1991."},{"issue":"2","key":"20_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. Journal Logic Programming, 10(2):91\u2013124, 1991.","journal-title":"Journal Logic Programming"},{"key":"20_CR4","series-title":"Lecture Notes in Artificial Intelligence 567","first-page":"309","volume-title":"Proceedings PDK'91","author":"M. Bruynooghe","year":"1991","unstructured":"M. Bruynooghe, V. Dumortier, and G. Janssens. Improving the efficiency of constraint logic programming languages by deriving specialized versions. In Proceedings PDK'91, Lecture Notes in Artificial Intelligence 567, pages 309\u2013317, Kaiserslautern, July 1991, Springer-Verlag."},{"key":"20_CR5","volume-title":"Technical Report 13","author":"P. Codognet","year":"1991","unstructured":"Ph. Codognet and G. Fil\u00e9. Computations, abstractions and constraints in logic programs. Technical Report 13, Department of Mathematics, University of Padova, Italy, November 1991."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings 5th ACM symposium on principles of programming languages, pages 84\u201396, 1978.","DOI":"10.1145\/512760.512770"},{"key":"20_CR7","unstructured":"D. De Schreye and K. Verschaetse. Termination analysis of definite logic programs with respect to call patterns. Technical Report CW 138, Department Computer Science, K.U. Leuven, January 1992."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"D. De Schreye, K. Verschaetse, and M. Bruynooghe. A framework for analysing the termination of definite logic programs with respect to call patterns. In Proceedings FGCS'92, Tokyo, June 1992.","DOI":"10.1007\/3-540-56282-6_5"},{"key":"20_CR9","unstructured":"S.K. Debray and N.-W. Lin. Automatic complexity analysis of logic programs. In Proceedings ICLP'91, pages 599\u2013613, June 1991."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"S.K. Debray, N.-W. Lin, and M. Hermenegildo. Task granularity analysis in logic programs. In Proceedings ACM SIGPLAN'90 conference on programming language design and implementation, pages 174\u2013188, June 1990.","DOI":"10.1145\/93542.93564"},{"issue":"3","key":"20_CR11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behaviour of logic languages. Theoretical Computer Science, 69(3):289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"key":"20_CR12","unstructured":"R. Giacobazzi, S.K. Debray, and G. Levi. A generalized semantics for constraint logic programs. In Proceedings FGCS'92, Tokyo, June 1992."},{"key":"20_CR13","unstructured":"P.E. Gill, W. Murray, and M. H. Wright. Numerical linear algebra and optimization, Volume 1. Addison-Wesley, 1991."},{"key":"20_CR14","unstructured":"G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Technical Report CW 107, Department of Computer Science, K.U. Leuven, March 1990. To appear in Journal of Logic Programming, in print."},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M. Karr","year":"1976","unstructured":"M. Karr. Affine relationships among variables of a program. Acta Informatica, 6:133\u2013151, 1976.","journal-title":"Acta Informatica"},{"key":"20_CR16","unstructured":"H. Millroth. Reforming compilation of logic programs. PhD thesis, UPMAIL Computing Science Department, Uppsala University, 1990."},{"key":"20_CR17","unstructured":"A. Mulkers. Deriving Live Data Structures in Logic Programs by means of Abstract. Interpretation. PhD thesis, Department of Computer Science, K.U. Leuven, 1991."},{"key":"20_CR18","first-page":"49","volume-title":"Proceedings ICLP'91","author":"K. Muthukumar","year":"1991","unstructured":"K. Muthukumar and M. Hermenegildo. Combined determination of sharing and freeness of program variables through abstract interpretation. In Proceedings ICLP'91, pages 49\u201363, Paris, June 1991. MIT Press."},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"L. Pl\u00fcmer. Termination proofs for logic programs. Lecture Notes in Artificial Intelligence 446. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"20_CR20","unstructured":"A. Schrijver. Theory of linear and integer programming. Wiley & Sons, 1986."},{"issue":"2","key":"20_CR21","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J.D. Ullman","year":"1988","unstructured":"J.D. Ullman and A. Van Gelder. Efficient tests for top-down termination of logical rules. Journal ACM, 35(2):345\u2013373, April 1988.","journal-title":"Journal ACM"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"A. Van Gelder. Deriving constraints among argument sizes in logic programs. In Proceedings 9th symposium on principles of database systems, pages 47\u201360. Acm Press, April 1990.","DOI":"10.1145\/298514.298541"},{"key":"20_CR23","unstructured":"K. Verschaetse. Static Termination Analysis for Definite Horn Clause Programs. PhD thesis, Department Computer Science, K.U. Leuven, June 1992."},{"key":"20_CR24","first-page":"301","volume-title":"Proceedings ICLP'91","author":"K. Verschaetse","year":"1991","unstructured":"K. Verschaetse and D. De Schreye. Deriving termination proofs for logic programs, using abstract procedures. In Proceedings ICLP'91, pages 301\u2013315, Paris, June 1991. MIT Press."},{"key":"20_CR25","unstructured":"K. Verschaetse and D. De Schreye. Automatic derivation of linear size relations. Technical Report CW 139, Department Computer Science, K.U. Leuven, January 1992."}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55844-6_143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T20:40:03Z","timestamp":1555706403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55844-6_143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558446","9783540472971"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-55844-6_143","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}