{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:46:03Z","timestamp":1725486363964},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429579"},{"type":"electronic","value":"9783540456537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45653-8_40","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:57:30Z","timestamp":1181365050000},"page":"579-594","source":"Crossref","is-referenced-by-count":2,"title":["Boolean Functions for Finite-Tree Dependencies"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bagnara","sequence":"first","affiliation":[]},{"given":"Enea","family":"Zaffanella","sequence":"additional","affiliation":[]},{"given":"Roberta","family":"Gori","sequence":"additional","affiliation":[]},{"given":"Patricia M.","family":"Hill","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"issue":"1","key":"40_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(96)00039-1","volume":"31","author":"T. Armstrong","year":"1998","unstructured":"T. Armstrong, K. Marriott, P. Schachte, and H. S\u00f8ndergaard. Two classes of Boolean functions for dependency analysis. Science of Computer Programming, 31(1):3\u201345, 1998.","journal-title":"Science of Computer Programming"},{"key":"40_CR2","unstructured":"R. Bagnara. Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis, Dipartimento di Informatica, Universit\u00e1 di Pisa, Pisa, Italy, 1997. Printed as Report TD-1\/97."},{"key":"40_CR3","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\u00e1 di Parma, 2001. Available at http:\/\/www.cs.unipr.it\/~bagnara\/ .","DOI":"10.1007\/3-540-47764-0_10"},{"key":"40_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-47764-0_10","volume-title":"Static Analysis: 8th International Symposium, SAS 2001","author":"R. Bagnara","year":"2001","unstructured":"R. Bagnara, R. Gori, P. M. Hill, and E. Zaffanella. Finite-tree analysis for constraint logic-based languages. In P. Cousot, editor, Static Analysis: 8th International Symposium, SAS 2001, volume 2126 of Lecture Notes in Computer Science, pages 165\u2013184, Paris, France, 2001. Springer-Verlag, Berlin."},{"key":"40_CR5","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 the7th 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 the7th International Conference on Logic for Programming and Automated Reasoning(LPAR 2000), volume 1955 of Lecture Notes in Computer Science, pages 189\u2013206, R\u00e9union Island, France, 2000. Springer-Verlag, Berlin."},{"key":"40_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-49253-4_33","volume-title":"Proceedings of the \u201cSeventhInternational Conference on Algebraic Methodology and Software Technology(AMAST\u201998)\u201d","author":"R. Bagnara","year":"1999","unstructured":"R. Bagnara and P. Schachte. Factorizing equivalent variable pairs in ROBDDbased implementations of Pos. In A. M. Haeberer, editor, Proceedings of the \u201cSeventhInternational Conference on Algebraic Methodology and Software Technology(AMAST\u201998)\u201d, volume 1548 of Lecture Notes in Computer Science, pages 471\u2013485, Amazonia, Brazil, 1999. Springer-Verlag, Berlin."},{"key":"40_CR7","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"},{"issue":"5","key":"40_CR8","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1145\/330249.330252","volume":"21","author":"M. Codish","year":"1999","unstructured":"M. Codish, H. S\u00f8ndergaard, and P. J. Stuckey. Sharing and groundness dependencies in logic programs. ACM Transactions on Programming Languages and Systems, 21(5):948\u2013976, 1999.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"40_CR9","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":"40_CR10","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."},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1109\/LICS.1991.151656","volume-title":"Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science","author":"A. Cortesi","year":"1991","unstructured":"A. Cortesi, G. Fil\u00e9, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 322\u2013327, Amsterdam, The Netherlands, 1991. IEEE Computer Society Press."},{"key":"40_CR12","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":"40_CR13","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":"2&3","key":"40_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation and applications to logic programs. Journal of Logic Programming, 13(2&3):103\u2013179, 1992.","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"40_CR15","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":"40_CR16","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":"40_CR17","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"},{"issue":"1\u20132","key":"40_CR18","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":"40_CR19","unstructured":"K. Marriott and H. S\u00f8ndergaard. Notes for a tutorial on abstract interpretation of logic programs. North American Conference on Logic Programming, Cleveland,Ohio, USA, 1989."},{"issue":"1\u20134","key":"40_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/176454.176519","volume":"2","author":"K. Marriott","year":"1993","unstructured":"K. Marriott and H. S\u00f8ndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2(1\u20134):181\u2013196,1993.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"E. Schr\u00f6der. Der Operationskreis des Logikkalkuls. B. G. Teubner, Leibzig, 1877.","DOI":"10.1007\/BF01443206"},{"key":"40_CR22","series-title":"Lecture Notes in ComputerScience","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 ComputerScience, pages 327\u2013338. Springer-Verlag, Berlin, 1986."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45653-8_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T09:43:43Z","timestamp":1683884623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45653-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429579","9783540456537"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45653-8_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}