{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:03:00Z","timestamp":1725487380710},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404385"},{"type":"electronic","value":"9783540450139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45013-0_6","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:06:29Z","timestamp":1184587589000},"page":"52-70","source":"Crossref","is-referenced-by-count":0,"title":["A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing Properties"],"prefix":"10.1007","author":[{"given":"Gianluca","family":"Amato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Scozzari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"6_CR1","unstructured":"G. Amato and F. Scozzari. Optimality in goal-dependent analysis of sharing. Technical Report TR-02-06, Dipartimento di Informatica, Univ. di Pisa, May 2002."},{"issue":"1\u20132","key":"6_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00312-1","volume":"277","author":"R. Bagnara","year":"2002","unstructured":"R. Bagnara, P. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. Theoretical Computer Science, 277(1\u20132):3\u201346, 2002.","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"R. Bagnara, E. Zaffanella, and P. M. Hill. Enhanced sharing analysis techniques: A comprehensive evaluation. In Proc. of ACM Conf. PPDP, pp. 103\u2013114, 2000.","DOI":"10.1145\/351268.351280"},{"key":"6_CR4","unstructured":"M. Codish, D. Dams, and E. Yardeni. Derivation and safety of an abstract unification algorithm for groundness and aliasing analysis. In ICLP, pp. 79\u201393, 1991."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/BFb0032734","volume-title":"Static Analysis","author":"Michael Codish","year":"1997","unstructured":"M. Codish, V. Lagoon, and F. Bueno. An algebraic approach to sharing analysis of logic programs. In Static Analysis Symposium, pp. 68\u201382, 1997."},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0743-1066(95)00123-9","volume":"27","author":"A. Cortesi","year":"1996","unstructured":"A. Cortesi, G. Fil\u00e9, and W. W. Winsborough. Optimal groundness analysis using propositional logic. Journal of Logic Programming, 27(2):137\u2013167, 1996.","journal-title":"Journal of Logic Programming"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. ACM POPL, pp. 269\u2013282, 1979.","DOI":"10.1145\/567752.567778"},{"issue":"2 & 3","key":"6_CR8","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"},{"key":"6_CR9","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."},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(93)00007-F","volume":"22","author":"M. V. Hermenegildo","year":"1995","unstructured":"M. V. Hermenegildo and F. Rossi. Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions. Journal of Logic Programming, 22(1):1\u201345, 1995.","journal-title":"Journal of Logic Programming"},{"key":"6_CR11","unstructured":"P. M. Hill, E. Zaffanella, and R. Bagnara. A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages. Available at http:\/\/www.cs.unipr.it\/~bagnara\/ ."},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1017\/S1471068402001497","volume":"3","author":"J. Howe","year":"2003","unstructured":"J. Howe and A. King. Three Optimisations for Sharing. Theory and Practice of Logic Programming, 3(2):243\u2013257, 2003.","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2 & 3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","volume":"13","author":"D. Jacobs","year":"1992","unstructured":"D. Jacobs and A. Langen. Static Analysis of Logic Programs for Independent AND Parallelism. Journal of Logic Programming, 13(2 & 3):291\u2013314, 1992.","journal-title":"Journal of Logic Programming"},{"key":"6_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/3-540-57880-3_24","volume-title":"ESOP","author":"A. King","year":"1994","unstructured":"A. King. A synergistic analysis for sharing and groundness which traces linearity. In ESOP, vol. 788 of LNCS, pp. 363\u2013378, 1994."},{"issue":"1\u20132","key":"6_CR15","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. JLP, 46(1\u20132):139\u2013155, Nov. 2000.","journal-title":"JLP"},{"key":"6_CR16","series-title":"Technical Report","volume-title":"Abstract matching can improve on abstract unification","author":"A. King","year":"1995","unstructured":"A. King and M. Longley. Abstract matching can improve on abstract unification. Technical Report 4-95*, Computing Laboratory, Univ. of Kent, Canterbury, 1995."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"V. Lagoon and P.J. Stuckey. Precise Pair-Sharing Analysis of Logic Programs. In Proc. of PPDP, 99\u2013108, 2002.","DOI":"10.1145\/571157.571168"},{"key":"6_CR18","volume-title":"Static Analysis for Independent And-parallelism in Logic Programs","author":"A. Langen","year":"1990","unstructured":"A. Langen. Static Analysis for Independent And-parallelism in Logic Programs. PhD thesis, University of Southern California, Los Angeles, California, 1990."},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/177492.177650","volume":"16","author":"K. Marriott","year":"1994","unstructured":"K. Marriott, H. S\u00f8ndergaard, and N. D. Jones. Denotational abstract interpretation of logic programs. ACM TOPLAS, 16(3):607\u2013648, 1994.","journal-title":"ACM TOPLAS"},{"issue":"2&3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"K. Muthukumar and M. V. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. JLP, 13(2&3):315\u2013347, 1992.","journal-title":"JLP"},{"key":"6_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-16442-1_25","volume-title":"Proc. ESOP 86","author":"H. S\u00f8ndergaard","year":"1986","unstructured":"H. S\u00f8ndergaard. An application of abstract interpretation of logic programs: Occur check reduction. In Proc. ESOP 86, vol. 213 of LNCS, pp. 327\u2013338, 1986."},{"key":"6_CR22","volume-title":"Correctness, Precision and Efficiency in the Sharing Analysis of Real Logic Languages","author":"E. Zaffanella","year":"2001","unstructured":"E. Zaffanella. Correctness, Precision and Efficiency in the Sharing Analysis of Real Logic Languages. PhD thesis, School of Computing, University of Leeds, Leeds, U.K., 2001. Available at http:\/\/www.cs.unipr.it\/~zaffanella\/ ."}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45013-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:22:10Z","timestamp":1556666530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45013-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404385","9783540450139"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45013-0_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}