{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:51:47Z","timestamp":1725544307509},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540334385"},{"type":"electronic","value":"9783540334392"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11737414_13","type":"book-chapter","created":{"date-parts":[[2006,3,15]],"date-time":"2006-03-15T06:54:37Z","timestamp":1142405677000},"page":"177-191","source":"Crossref","is-referenced-by-count":2,"title":["Lazy Set-Sharing Analysis"],"prefix":"10.1007","author":[{"given":"Xuan","family":"Li","sequence":"first","affiliation":[]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[]},{"given":"Lunjin","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(96)00039-1","volume":"31","author":"T. Armstrong","year":"1998","unstructured":"Armstrong, T., Marriott, K., Schachte, P., S\u00f8ndergaard, H.: Two Classes of Boolean Functions for Dependency Analysis. Science of Computer Programming\u00a031(1), 3\u201345 (1998)","journal-title":"Science of Computer Programming"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ic.2004.04.005","volume":"193","author":"R. Bagnara","year":"2004","unstructured":"Bagnara, R., Gori, R., Hill, P.M., Zaffanella, E.: Finite-Tree Analysis for Constraint Logic-Based Languages. Information and Computation\u00a0193(2), 84\u2013116 (2004)","journal-title":"Information and Computation"},{"issue":"1-2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00312-1","volume":"277","author":"R. Bagnara","year":"2002","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Set-Sharing is Redundant for Pair-Sharing. Theoretical Computer Science\u00a0277(1-2), 3\u201346 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1&2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1471068404001978","volume":"5","author":"R. Bagnara","year":"2005","unstructured":"Bagnara, R., Zaffanella, E., Hill, P.M.: Enhanced Sharing Analysis Techniques: A Comprehensive Evaluation. Theory and Practice of Logic Programming\u00a05(1&2), 1\u201343 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-61739-6_38","volume-title":"Static Analysis","author":"M. Bruynooghe","year":"1996","unstructured":"Bruynooghe, M., Demoen, B., Boulanger, D., Denecker, M., Mulkers, A.: A Freeness and Sharing Analysis of Logic Programs Based on A Preinterpretation. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol.\u00a01145, pp. 128\u2013142. Springer, Heidelberg (1996)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-540-24754-8_10","volume-title":"Functional and Logic Programming","author":"F. Bueno","year":"2004","unstructured":"Bueno, F., de la Banda, M.G.: Set-sharing is not always redundant for pair-sharing. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998, pp. 117\u2013131. Springer, Heidelberg (2004)"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0743-1066(99)00007-2","volume":"42","author":"M. Codish","year":"2000","unstructured":"Codish, M., Lagoon, V., Bueno, F.: An Algebraic Approach to Sharing Analysis of Logic Programs. Journal of Logic Programming\u00a042(2), 111\u2013149 (2000)","journal-title":"Journal of Logic Programming"},{"issue":"5","key":"13_CR8","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1145\/330249.330252","volume":"21","author":"M. Codish","year":"1999","unstructured":"Codish, M., S\u00f8ndergaard, H., Stuckey, P.J.: Sharing and Groundness Dependencies in Logic Programs. ACM Transactions on Programming Languages and Systems\u00a021(5), 948\u2013976 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0743-1066(98)10026-2","volume":"38","author":"A. Cortesi","year":"1999","unstructured":"Cortesi, A., Fil\u00e9, G.: Sharing Is Optimal. Journal of Logic Programming\u00a038(3), 371\u2013386 (1999)","journal-title":"Journal of Logic Programming"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-61739-6_40","volume-title":"Static Analysis","author":"L. Crnogorac","year":"1996","unstructured":"Crnogorac, L., Kelly, A.D., Sondergaard, H.: A Comparison of Three Occur-Check Analysers. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol.\u00a01145, pp. 159\u2013173. Springer, Heidelberg (1996)"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/185403.185453","volume":"26","author":"J.C. Kergommeaux de","year":"1994","unstructured":"de Kergommeaux, J.C., Codognet, P.: Parallel Logic Programming Systems. ACM Computing Surveys\u00a026(3), 295\u2013336 (1994)","journal-title":"ACM Computing Surveys"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-61756-6_104","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"C. Fecht","year":"1996","unstructured":"Fecht, C.: An Efficient and Precise Sharing Domain for Logic Programs. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol.\u00a01140, pp. 469\u2013470. Springer, Heidelberg (1996)"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1017\/S1471068401001338","volume":"2","author":"P.M. Hill","year":"2002","unstructured":"Hill, P.M., Bagnara, R., Zaffanella, E.: Soundness, Idempotence and Commutativity of Set-Sharing. Theory and Practice of Logic Programming\u00a02(2), 155\u2013201 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1017\/S1471068403001868","volume":"4","author":"P.M. Hill","year":"2004","unstructured":"Hill, P.M., Zaffanella, E., Bagnara, R.: A Correct, Precise and Efficient Integration of Set-Sharing, Freeness and Linearity for The Analysis of Finite and Rational Tree Languages. Theory and Practice of Logic Programming\u00a04(3), 289\u2013323 (2004)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S1471068402001485","volume":"3","author":"J.M. Howe","year":"2003","unstructured":"Howe, J.M., King, A.: Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming\u00a03(1), 95\u2013124 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1017\/S1471068402001497","volume":"3","author":"J.M. Howe","year":"2003","unstructured":"Howe, J.M., King, A.: Three Optimisations for Sharing. Theory and Practice of Logic Programming\u00a03(2), 243\u2013257 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"13_CR17","first-page":"154","volume-title":"Proceedings of the North American Conference on Logic Programming","author":"D. Jacobs","year":"1989","unstructured":"Jacobs, D., Langen, A.: Accurate and Efficient Approximation of Variable Aliasing in Logic Programs. In: Overbeek, R.A., Lusk, E.L. (eds.) Proceedings of the North American Conference on Logic Programming, pp. 154\u2013165. MIT Press, Cambridge (1989)"},{"issue":"2&3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","volume":"13","author":"D. Jacobs","year":"1992","unstructured":"Jacobs, D., Langen, A.: Static Analysis of Logic Programs for Independent And-Parallelism. Journal of Logic Programming\u00a013(2&3), 291\u2013314 (1992)","journal-title":"Journal of Logic Programming"},{"issue":"1-2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(00)00009-1","volume":"46","author":"A. King","year":"2000","unstructured":"King, A.: Pair-Sharing over Rational Trees. Journal of Logic Programming\u00a046(1-2), 139\u2013155 (2000)","journal-title":"Journal of Logic Programming"},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/571157.571168","volume-title":"Proceedings of the 4th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming","author":"V. Lagoon","year":"2002","unstructured":"Lagoon, V., Stuckey, P.J.: Precise Pair-Sharing Analysis of Logic Programs. In: Proceedings of the 4th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 99\u2013108. ACM Press, New York (2002)"},{"key":"13_CR21","unstructured":"Langen, A.: Advanced Techniques for Approximating Variables Aliasing in Logic Programs. PhD thesis (1991)"},{"issue":"2-3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"Muthukumar, K., Hermenegildo, M.V.: Compile-Time Derivation of Variable Dependency Using Abstract Interpretation. Journal of Logic Programming\u00a013(2-3), 315\u2013347 (1992)","journal-title":"Journal of Logic Programming"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-50820-1_41","volume-title":"Programming Languages Implementation and Logic Programming","author":"U. Nilsson","year":"1989","unstructured":"Nilsson, U.: Towards a Framework for the Abstract Interpretation of Logic Programs. In: Deransart, P., Lorho, B., Maluszynski, J. (eds.) PLILP 1988. LNCS, vol.\u00a0348, pp. 68\u201382. Springer, Heidelberg (1989)"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-16442-1_25","volume-title":"ESOP 86","author":"H. S\u00f8ndergaard","year":"1986","unstructured":"S\u00f8ndergaard, H.: An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol.\u00a0213, pp. 327\u2013338. Springer, Heidelberg (1986)"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/10704567_25","volume-title":"Principles and Practice of Declarative Programming","author":"E. Zaffanella","year":"1999","unstructured":"Zaffanella, E., Bagnara, R., Hill, P.M.: Widening Sharing. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 414\u2013432. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11737414_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T18:36:29Z","timestamp":1627151789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11737414_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540334385","9783540334392"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11737414_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}