{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:56:33Z","timestamp":1772024193432,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540366355","type":"print"},{"value":"9783540366362","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799573_13","type":"book-chapter","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T08:25:42Z","timestamp":1154939142000},"page":"148-162","source":"Crossref","is-referenced-by-count":2,"title":["Collapsing Closures"],"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":"2","key":"13_CR1","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., 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_CR2","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., Zaffanella, E.: Set-Sharing is Redundant for Pair-Sharing. Theoretical Computer Science\u00a0277(1-2), 3\u201346 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bagnara, R., Zaffanella, E., Hill, P.: Enhanced Sharing Analysis Techniques: A Comprehensive Evaluation. Theory and Practice of Logic Programming\u00a05 (2005)","DOI":"10.1017\/S1471068404001978"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Gabbrielli, M., Levi, G., Martelli, M.: The s-Semantics Approach: Theory and Applications. The Journal of Logic Programming\u00a019, 149\u2013197 (1994)","journal-title":"The Journal of Logic Programming"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M.: A Practical Framework for the Abstract Interpretation of Logic Programs. The Journal of Logic Programming\u00a010(2), 91\u2013124 (1991)","journal-title":"The Journal of Logic Programming"},{"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., Garc\u00eda de la Banda, M.: 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":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0743-1066(98)10024-9","volume":"38","author":"M. Codish","year":"1999","unstructured":"Codish, M.: Efficient Goal Directed Bottom-Up Evaluation of Logic Programs. The Journal of Logic Programming\u00a038(3), 355\u2013370 (1999)","journal-title":"The Journal of Logic Programming"},{"issue":"2","key":"13_CR8","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. The Journal of Logic Programming\u00a042(2), 111\u2013149 (2000)","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/200994.200998","volume":"17","author":"M. Codish","year":"1995","unstructured":"Codish, M., Mulkers, A., Bruynooghe, M., Garc\u00eda de la Banda, M., Hermenegildo, M.: Improving Abstract Interpretations by Combining Domains. ACM TOPLAS\u00a017(1), 28\u201344 (1995)","journal-title":"ACM TOPLAS"},{"issue":"5","key":"13_CR10","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.: Sharing and Groundness Dependencies in Logic Programs. ACM TOPLAS\u00a021(5), 948\u2013976 (1999)","journal-title":"ACM TOPLAS"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"Falaschi, M., Levi, G., Palamidessi, C., Martelli, M.: Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science\u00a069(3), 289\u2013318 (1989)","journal-title":"Theoretical Computer Science"},{"key":"13_CR12","unstructured":"Gallagher, J.: A Bottom-Up Analysis Toolkit. Technical Report 95-016, Department of Computer Science, University of Bristol (Invited paper at WAILL) (1995)"},{"key":"13_CR13","unstructured":"Hans, W., Winkler, S.: Aliasing and Groundness Analysis of Logic Programs through Abstract Interpretation and its Safety. Technical Report Nr. 92-27, RWTH Aachen, Lehrstuhl f\u00fcr Informatik II Ahornstra\u00dfe 55, W-5100 Aachen (1992)"},{"issue":"2 & 3","key":"13_CR14","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. The Journal of Logic Programming\u00a013(2 & 3), 291\u2013314 (1992)","journal-title":"The Journal of Logic Programming"},{"key":"13_CR15","unstructured":"Li, X., King, A., Lu, L.: Correctness of Closure Collapsing. Technical Report 2-06, University of Kent (2006), \n                    \n                      http:\/\/www.cs.kent.ac.uk\/pubs\/2006\/2370"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/11737414_13","volume-title":"Functional and Logic Programming","author":"X. Li","year":"2006","unstructured":"Li, X., King, A., Lu, L.: Lazy Set-Sharing Analysis. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol.\u00a03945, pp. 177\u2013191. Springer, Heidelberg (2006)"},{"issue":"2-3","key":"13_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. The Journal of Logic Programming\u00a013(2-3), 315\u2013347 (1992)","journal-title":"The Journal of Logic Programming"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11609773_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Schachte","year":"2005","unstructured":"Schachte, P., S\u00f8ndergaard, H.: Closure Operators for ROBDDs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"13_CR19","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\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)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799573_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:24:45Z","timestamp":1619493885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799573_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366355","9783540366362"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11799573_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}