{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:56Z","timestamp":1751983676897},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627180"},{"type":"electronic","value":"9783540684947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62718-9_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:49:28Z","timestamp":1330278568000},"page":"204-223","source":"Crossref","is-referenced-by-count":42,"title":["Inferring argument size relationships with CLP( $$\\mathcal{R}$$ )"],"prefix":"10.1007","author":[{"given":"Florence","family":"Benoy","sequence":"first","affiliation":[]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"12_CR1","unstructured":"R. Bagnara. On the detection of implicit and redundant numeric constraints in CLP programs. In GULP-PRODE'94, pages 312\u2013326, 1994."},{"key":"12_CR2","volume-title":"Technical Report TR-96-10","author":"R. Bagnara","year":"1996","unstructured":"R. Bagnara. A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages. Technical Report TR-96-10, Dipartimento di Informatic\u00e1, Universita di Pisa corso Italia 40, 56125 Pisa, Italy, 1996."},{"key":"12_CR3","unstructured":"R. Bagnara, R. Giacobazzi, and G. Levi. Static Analysis of clp Programs over Numeric Domains. In WSA'92, 1992."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"V. Balasundaram and K. Kennedy. A Technique for Summarizing Data Access and Its Use in Parallelism Enhancing Transformations. In PLDI'89, pages 41\u201353. ACM Press, 1989.","DOI":"10.1145\/73141.74822"},{"key":"12_CR5","unstructured":"A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: theory and applications. Journal of Logic Programming, 1991."},{"key":"12_CR6","volume-title":"Technical report","author":"M. Codish","year":"1995","unstructured":"M. Codish and V. Lagoon. Persistant Type Analysis using a Non-Ground Domain. Technical report, Dept of Maths and Computer Science, Ben-Gurion University of the Negev, Israel, 1995."},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/79204.79210","volume":"33","author":"A. Colmerauer","year":"1990","unstructured":"A. Colmerauer. An Introduction to Prolog III. In CACM, volume 33, pages 70\u201390, July 1990.","journal-title":"CACM"},{"key":"12_CR8","volume-title":"Technical Report LIENS-92-16","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Comparing the Galois Connection and Widening\/Narrowing Approaches to Abstract Interpretation. Technical Report LIENS-92-16, Laboratoire d'Informatique de l'Ecole Normale Superi\u00e9ure, 45 Rue d'Ulm, 7523 Paris C\u00e9dex 05, France, 1992."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"P. Cousot and N. Halbwachs. Automatic Discovery of Linear Restraints among Variables of a Program. In POPL'78, pages 84\u201397, 1978.","DOI":"10.1145\/512760.512770"},{"key":"12_CR10","unstructured":"B. De Backer and H. Beringer. A CLP language handling disjunctions of linear constraints. In ICLP'93, pages 550\u2013563. MIT Press, 1993."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"S. Debray and N. Lin. Cost Analysis for Logic Programs. ACM Transactions on Programming Languages and Systems, July 1992.","DOI":"10.1145\/161468.161472"},{"key":"12_CR12","unstructured":"S. Decorte, D. De Schreye, and M. Fabris. Automatic Inference of Norms: a Missing Link in Automatic Termination Analysis. In ICLP'93, pages 420\u2013436, 1993."},{"key":"12_CR13","unstructured":"J. Gallagher, D. Boulanger, and Y. Saglam. Practical Model-Based Static Analysis for Definite Logic Programs. Technical Report CSTR-95-011, Department of Computer Science, University of Bristol, June 1995."},{"key":"12_CR14","unstructured":"R. Giacobazzi, S. Debray, and G. Levi. Generalised Semantics and Abstract Interpretation for Constraint Logic Programs. Technical report, Dipartimento di Informatica, Universit\u00e1 di Pisa, 1992."},{"key":"12_CR15","unstructured":"N. Halbwachs. D\u00e9termination automatique de relations lin\u00e9aires v\u00e9rifi\u00e9es par les variables d'un programme. Universit'e scientifique et m\u00e9dicale de Grenoble, 1979. Th\u00e8se de 3 \u00e8me d'informatique."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"N. Halbwachs, Y.E. Proy, and P. Raymond. Verification of linear hybrid systems by means of convex approximations. In First International Static Analysis Symposium. Springer Verlag, September 1994.","DOI":"10.1007\/3-540-58485-4_43"},{"key":"12_CR17","unstructured":"N. C. Heintze, J. Jafar, S. Michaylov, P. J. Stuckey, and R. H. C. Yap. The CLP( $$\\mathcal{R}$$ ) Programmer's Manual Version 1.2, 1992."},{"key":"12_CR18","unstructured":"R. N. Horspool. Analyzing List Usage in Prolog Code. University of Victoria, March 1990."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"G. Janssens, M. Bruynooghe, and V. Englebert. Abstracting numeric values in CLP(H,N). In PLILP'94, pages 400\u2013414. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58402-1_28"},{"key":"12_CR20","doi-asserted-by":"publisher","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":"12_CR21","unstructured":"D. B. Kemp and P. J. Stuckey. Analysis Based Constraint Query Optimisation. In ICLP'93, pages 666\u2013682, 1993."},{"key":"12_CR22","unstructured":"A. Kerbrat. Personal Communication on Polyhedral library polyhedra.tar. October, 1993."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"J. Martin, A. King, and P. Soper. Typed Norms for Typed Logic Programs. In LOPSTR'96. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62718-9_13"},{"key":"12_CR24","first-page":"308","volume-title":"META'92","author":"F. Mesnard","year":"1992","unstructured":"F. Mesnard and J.-G. Ganascia. CLP( $$\\mathcal{Q}$$ ) for Proving Interargument Relations. In META'92, pages 308\u2013320, Uppsala, Sweden, 1992. Springer-Verlag."},{"key":"12_CR25","unstructured":"H. Millroth. Reforming Compilation of Logic Programs. PhD thesis, Computing Science Department, Uppsala University, 1990."},{"key":"12_CR26","unstructured":"H. Millroth. Personal Communication on the r\u00f4le of Argument Relationships in Reform. October, 1993."},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"L. Pl\u00fcmer. Termination Proofs for Logic Programs. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"K. Sohn. Constraints among Argument Sizes in Logic Programs. In PODS'94, pages 68\u201374. ACM Press, 1994.","DOI":"10.1145\/182591.182599"},{"issue":"3","key":"12_CR29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","volume":"10","author":"J. D. Ullman","year":"1985","unstructured":"J. D. Ullman. Implementation of Logical Query Languages for Databases. ACM Transactions on Database Systems, 10(3):289\u2013321, 1985.","journal-title":"ACM Transactions on Database Systems"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"A. Van Gelder. Deriving constraints among argument sizes in logic programs. Annals of Mathematics and Artifical Intelligence, (3), 1991.","DOI":"10.1007\/BF01530930"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"K. Verschaetse and D. De Schreye. Derivation of Linear Size Relations by Abstract Interpretation. In PLILP'92, pages 296\u2013310. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55844-6_143"},{"key":"12_CR32","volume-title":"Technical Report PI-785","author":"D. Wilde","year":"1993","unstructured":"D. Wilde. A Library for doing Polyhedral Operations. Technical Report PI-785, Institut de Recherche en Informatique et Systemes Aleatoires, Campus Universitaire de Beauilieu, 35042 Rennes Cedex, France, 1993."}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62718-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:22:23Z","timestamp":1640931743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62718-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627180","9783540684947"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-62718-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}