{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:10:03Z","timestamp":1737094203064,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423140"},{"type":"electronic","value":"9783540477648"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47764-0_10","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T04:55:55Z","timestamp":1181624155000},"page":"165-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Finite-Tree Analysis for Constraint Logic-Based Languages"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bagnara","sequence":"first","affiliation":[]},{"given":"Roberta","family":"Gori","sequence":"additional","affiliation":[]},{"given":"Patricia M.","family":"Hill","sequence":"additional","affiliation":[]},{"given":"Enea","family":"Zaffanella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"R. Bagnara, R. Gori, P. M. Hill, and E. Zaffanella. Finite-tree analysis for constraint logic-based languages. Quaderno 251, Dipartimento di Matematica, Universit\u00e0 di Parma, 2001. Available at http:\/\/www.cs.unipr.it\/~bagnara\/ .","DOI":"10.1007\/3-540-47764-0_10"},{"key":"10_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-44404-1_13","volume-title":"Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR 2000)","author":"R. Bagnara","year":"2000","unstructured":"R. Bagnara, P. M. Hill, and E. Zaffanella. Efficient structural information analysis for real CLP languages. In M. Parigot and A. Voronkov, editors, Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR 2000), volume 1955 of Lecture Notes in Computer Science, pages 189\u2013206, Reunion Island, France, 2000. Springer-Verlag, Berlin."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"R. Bagnara, P. M. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. Theoretical Computer Science, 2001. To appear.","DOI":"10.1016\/S0304-3975(00)00312-1"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"R. Bagnara, E. Zaffanella, R. Gori, and P. M. Hill. Boolean functions for finite-tree dependencies. Quaderno 252, Dipartimento di Matematica, Universit\u00e0 di Parma, 2001. Available at http:\/\/www.cs.unipr.it\/~bagnara\/ .","DOI":"10.1007\/3-540-45653-8_40"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"R. Bagnara, E. Zaffanella, and P. M. Hill. Enhanced sharing analysis techniques: A comprehensive evaluation. In M. Gabbrielli and F. Pfenning, editors, Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pages 103\u2013114, Montreal, Canada, 2000. Association for Computing Machinery.","DOI":"10.1145\/351268.351280"},{"key":"10_CR6","volume-title":"Technical Report CW 196","author":"M. Bruynooghe","year":"1994","unstructured":"M. Bruynooghe, M. Codish, and A. Mulkers. A composite domain for freeness, sharing, and compoundness analysis of logic programs. Technical Report CW 196, Department of Computer Science, K.U. Leuven, Belgium, July 1994."},{"key":"10_CR7","unstructured":"J. A. Campbell, editor. Implementations of Prolog. Ellis Horwood\/Halsted Press\/Wiley, 1984."},{"key":"10_CR8","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511530098","volume-title":"The Logic of Typed Feature Structures with Applications to Unification-based Grammars, Logic Programming and Constraint Resolution","author":"B. Carpenter","year":"1992","unstructured":"B. Carpenter. The Logic of Typed Feature Structures with Applications to Unification-based Grammars, Logic Programming and Constraint Resolution, volume 32 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, New York, 1992."},{"key":"10_CR9","unstructured":"M. Codish, D. Dams, and E. Yardeni. Derivation and safety of an abstract unification algorithm for groundness and aliasing analysis. In K. Furukawa, editor, Logic Programming: Proceedings of the Eighth International Conference on Logic Programming, MIT Press Series in Logic Programming, pages 79\u201393, Paris, France, 1991. The MIT Press."},{"key":"10_CR10","first-page":"231","volume-title":"Logic Programming, APIC Studies in Data Processing","author":"A. Colmerauer","year":"1982","unstructured":"A. Colmerauer. Prolog and infinite trees. In K. L. Clark and S. \u00c5. T\u00e4rnlund, editors, Logic Programming, APIC Studies in Data Processing, volume 16, pages 231\u2013251. Academic Press, New York, 1982."},{"key":"10_CR11","unstructured":"A. Colmerauer. Equations and inequations on finite and infinite trees. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS\u201984), pages 85\u201399, Tokyo, Japan, 1984. ICOT."},{"issue":"7","key":"10_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/79204.79210","volume":"33","author":"A. Colmerauer","year":"1990","unstructured":"A. Colmerauer. An introduction to Prolog-III. Communications of the ACM, 33(7):69\u201390, 1990.","journal-title":"Communications of the ACM"},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0743-1066(98)10026-2","volume":"38","author":"A. Cortesi","year":"1999","unstructured":"A. Cortesi and G. Fil\u00e9. Sharing is optimal. Journal of Logic Programming, 38(3):371\u2013386, 1999.","journal-title":"Journal of Logic Programming"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combinations of abstract domains for logic programming: Open product and generic pattern construction. Science of Computer Programming, 38(1\u20133), 2000.","DOI":"10.1016\/S0167-6423(99)00045-3"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511\u2013547, 1992.","journal-title":"Journal of Logic and Computation"},{"key":"10_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-61739-6_40","volume-title":"Static Analysis: Proceedings of the 3rd International Symposium","author":"L. Crnogorac","year":"1996","unstructured":"L. Crnogorac, A. D. Kelly, and H. S\u00f8ndergaard. A comparison of three occur-check analysers. In R. Cousot and D. A. Schmidt, editors, Static Analysis: Proceedings of the 3rd International Symposium, volume 1145 of Lecture Notes in Computer Science, pages 159\u2013173, Aachen, Germany, 1996. Springer-Verlag, Berlin."},{"key":"10_CR18","unstructured":"P. R. Eggert and K. P. Chow. Logic programming, graphics and infinite terms. Technical Report UCSB DoCS TR 83-02, Department of Computer Science, University of California at Santa Barbara, 1983."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"G. Erbach. ProFIT: Prolog with Features, Inheritance and Templates. In Proceedings of the 7th Conference of the European Chapter of the Association for Computational Linguistics, pages 180\u2013187, Dublin, Ireland, 1995.","DOI":"10.3115\/976973.976999"},{"key":"10_CR20","unstructured":"M. Filgueiras. A Prolog interpreter working with infinite terms. InCampbell [7], pages 250\u2013258."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0743-1066(84)90013-X","volume":"3","author":"F. Giannesini","year":"1984","unstructured":"F. Giannesini and J. Cohen. Parser generation and grammar manipulation using Prolog\u2019s infinite trees. Journal of Logic Programming, 3:253\u2013265, 1984.","journal-title":"Journal of Logic Programming"},{"key":"10_CR22","unstructured":"W. Hans and S. Winkler. Aliasing and groundness analysis of logic programs through abstract interpretation and its safety. Technical Report 92-27, Technical University of Aachen (RWTH Aachen), 1992."},{"key":"10_CR23","unstructured":"S. Haridi and D. Sahlin. Efficient implementation of unification of cyclic structures. InCampbell [7], pages 234\u2013249."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"P. M. Hill, R. Bagnara, and E. Zaffanella. Soundness, idempotence and commutativity of set-sharing. Theory and Practice of Logic Programming, 2001. To appear. Available at http:\/\/arXiv.org\/abs\/cs.PL\/0102030 .","DOI":"10.1017\/S1471068401001338"},{"issue":"3","key":"10_CR25","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1006\/jsco.1996.0012","volume":"21","author":"B. Intrigila","year":"1996","unstructured":"B. Intrigila and M. Venturini Zilli. A remark on infinite matching vs infinite unification. Journal of Symbolic Computation, 21(3):2289\u20132292, 1996.","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR26","unstructured":"D. Jacobs and A. Langen. Accurate and efficient approximation of variable aliasing in logic programs. In E. L. Lusk and R. A. Overbeek, editors, Logic Programming: Proceedings of the North American Conference, MIT Press Series in Logic Programming, pages 154\u2013165, Cleveland, Ohio, USA, 1989. The MIT Press."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J-L. Lassez, and M. J. Maher. Prolog-II as an instance of the logic programming scheme. In M. Wirsing, editor, Formal Descriptions of Programming Concepts III, pages 275\u2013299. North-Holland, 1987.","DOI":"10.1145\/41625.41635"},{"key":"10_CR28","series-title":"PhD thesis","volume-title":"Tree Constraints","author":"T. Keisu","year":"1994","unstructured":"T. Keisu. Tree Constraints. PhD thesis, The Royal Institute of Technology, Stockholm, Sweden, May 1994."},{"issue":"1\u20132","key":"10_CR29","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(00)00009-1","volume":"46","author":"A. King","year":"2000","unstructured":"A. King. Pair-sharing over rational trees. Journal of Logic Programming, 46(1\u20132):139\u2013155, 2000.","journal-title":"Journal of Logic Programming"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings, Third Annual Symposium on Logic in Computer Science, pages 348\u2013357, Edinburgh, Scotland, 1988. IEEE Computer Society.","DOI":"10.1109\/LICS.1988.5132"},{"key":"10_CR31","unstructured":"K. Mukai. Constraint Logic Programming and the Unification of Information. PhD thesis, Department of Computer Science, Faculty of Engineering, Tokio Institute of Technology, 1991."},{"key":"10_CR32","volume-title":"Head-Driven Phrase Structure Grammar","author":"C. Pollard","year":"1994","unstructured":"C. Pollard and I. A. Sag. Head-Driven Phrase Structure Grammar. University of Chicago Press, Chicago, 1994."},{"key":"10_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/978-3-540-45099-3_21","volume-title":"Static Analysis: 7th International Symposium, SAS 2000","author":"F. Scozzari","year":"2000","unstructured":"F. Scozzari. Abstract domains for sharing analysis by optimal semantics. In J. Palsberg, editor, Static Analysis: 7th International Symposium, SAS 2000, volume 1824 of Lecture Notes in Computer Science, pages 397\u2013412, Santa Barbara, CA, USA, 2000. Springer-Verlag, Berlin."},{"issue":"3","key":"10_CR34","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","volume":"18","author":"G. Smolka","year":"1994","unstructured":"Gert Smolka and Ralf Treinen. Records for logic programming. Journal of Logic Programming, 18(3):229\u2013258, 1994.","journal-title":"Journal of Logic Programming"},{"key":"10_CR35","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-16442-1_25","volume-title":"Proceedings of the 1986 European Symposium on Programming","author":"H. S\u00f8ndergaard","year":"1986","unstructured":"H. S\u00f8ndergaard. An application of abstract interpretation of logic programs: Occur check reduction. In B. Robinet and R. Wilhelm, editors, Proceedings of the 1986 European Symposium on Programming, volume 213 of Lecture Notes in Computer Science, pages 327\u2013338. Springer-Verlag, Berlin, 1986."},{"key":"10_CR36","unstructured":"Swedish Institute of Computer Science, Programming Systems Group. SICStus Prolog User\u2019s Manual, release 3 #0 edition, 1995."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47764-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:55:55Z","timestamp":1737093355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47764-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423140","9783540477648"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-47764-0_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"4 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}