{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:44:22Z","timestamp":1725475462627},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665403"},{"type":"electronic","value":"9783540481645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10704567_25","type":"book-chapter","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T18:27:08Z","timestamp":1167330428000},"page":"414-431","source":"Crossref","is-referenced-by-count":7,"title":["Widening Sharing"],"prefix":"10.1007","author":[{"given":"Enea","family":"Zaffanella","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Bagnara","sequence":"additional","affiliation":[]},{"given":"Patricia M.","family":"Hill","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Bagnara, R.: Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis, Dipartimento di Informatica, Universitd\u0300 Pisa, Corso Italia 40, I-56125 Pisa, Italy, Printed as Report TD-1\/97 (March 1997)"},{"key":"25_CR2","unstructured":"Bagnara, R.: Widening Pos: Simple, effective, and rarely needed. Unpublished short note (1998)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0032733","volume-title":"Static Analysis","author":"R. Bagnara","year":"1997","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Set-sharing is redundant for pair-sharing. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 53\u201367. Springer, Heidelberg (1997)"},{"key":"25_CR4","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Set-sharing is redundant for pair-sharing. Theoretical Computer Science (1999) To appear"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Algebraic Methodology and Software Technology","author":"R. Bagnara","year":"1998","unstructured":"Bagnara, R., Schachte, P.: Factorizing equivalent variable pairs in ROBDDbased implementations of Pos. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol.\u00a01548, Springer, Heidelberg (1998)"},{"issue":"9","key":"25_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph. Communications of the ACM\u00a016(9), 575\u2013577 (1973)","journal-title":"Communications of the ACM"},{"key":"25_CR7","unstructured":"Bruynooghe, M., Codish, M., Mulkers, A.: Abstract unification for a composite domain deriving sharing and freeness properties of program variables. In: de Boer, F.S., Gabbrielli, M. (eds.) Verification and Analysis of Logic Languages, Proceedings of the W2 Post-Conference Workshop, International Conference on Logic Programming, Santa Margherita Ligure, Italy, pp. 213\u2013230 (1994)"},{"key":"25_CR8","unstructured":"Codish, M., S\u03c6ndergaard, H., Stuckey, P.J.: Sharing and groundness dependencies in logic programs. Submitted for publication"},{"key":"25_CR9","unstructured":"Cortesi, A., Fil\u00e9, G.: Comparison and design of abstract domains for sharing analysis. In: Sacc\u00e0, D. (ed.) Proceedings of the Eighth Italian Conference on Logic Programming (GULP 1993), Gizzeria, Italy, pp. 251\u2013265. Mediterranean Press (1993)"},{"issue":"3","key":"25_CR10","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":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Programming Language Implementation and Logic Programming","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Comparing the Galois connection and widening\/ narrowing approaches to abstract interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol.\u00a0631, Springer, Heidelberg (1992)"},{"key":"25_CR12","series-title":"An efficient and precise sharing domain for logic programs","doi-asserted-by":"crossref","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. An efficient and precise sharing domain for logic programs, vol.\u00a01140, pp. 469\u2013470. Springer, Heidelberg (1996)"},{"key":"25_CR13","unstructured":"Fecht, C.: Efficient and precise sharing domains for logic programs. Technical Report A\/04\/96, Universit\u00e4t des Saarlandes, Fachbereich 14 Informatik, Saarbr\u00fccken, Germany (1996)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/3-540-49727-7_6","volume-title":"Static Analysis","author":"P.M. Hill","year":"1998","unstructured":"Hill, P.M., Bagnara, R., Zaffanella, E.: The correctness of set-sharing. In: Levi, G. (ed.) SAS 1998. LNCS, vol.\u00a01503, pp. 99\u2013114. Springer, Heidelberg (1998)"},{"issue":"2&3","key":"25_CR15","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"},{"key":"25_CR16","unstructured":"Langen, A.: Static Analysis for Independent And-Parallelism in Logic Programs. PhD thesis, Computer Science Department, University of Southern California, Printed as Report TR 91-05 (1990)"},{"issue":"2&3","key":"25_CR17","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.: 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":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-16442-1_25","volume-title":"ESOP 86","author":"H. S\u03c6ndergaard","year":"1986","unstructured":"S\u03c6ndergaard, 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":"25_CR19","doi-asserted-by":"crossref","unstructured":"Zaffanella, E., Bagnara, R., Hill, P.M.: Widening Sharing. Submitted for publication (1999), Available at http:\/\/www.cs.unipr.it\/~bagnara\/","DOI":"10.1007\/10704567_25"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10704567_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:13:35Z","timestamp":1556003615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10704567_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665403","9783540481645"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/10704567_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}