{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T21:01:14Z","timestamp":1750453274280},"reference-count":38,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0890-5401(02)00048-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:00:31Z","timestamp":1049504431000},"page":"14-52","source":"Crossref","is-referenced-by-count":4,"title":["Pair-independence and freeness analysis through linear refinement"],"prefix":"10.1016","volume":"182","author":[{"given":"Giorgio","family":"Levi","sequence":"first","affiliation":[]},{"given":"Fausto","family":"Spoto","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(02)00048-2_BIB1","series-title":"Proceedings of FLOPS 2001, Lecture Notes in Computer Science, Tokyo, Japan, March, vol. 2024","first-page":"311","article-title":"Abstract compilation for sharing analysis","author":"Amato","year":"2001"},{"issue":"1","key":"10.1016\/S0890-5401(02)00048-2_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-6423(96)00039-1","article-title":"Two classes of Boolean functions for dependency analysis","volume":"31","author":"Armstrong","year":"1998","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB3","unstructured":"R. Bagnara, Data-flow analysis for constraint logic-based languages, Ph.D. Thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1997"},{"issue":"1 and 2","key":"10.1016\/S0890-5401(02)00048-2_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00312-1","article-title":"Set-Sharing is reduntant for pair-sharing","volume":"277","author":"Bagnara","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","article-title":"The s-semantics approach: theory and applications","volume":"19\u201320","author":"Bossi","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB6","series-title":"Proceedings of the 3rd International Workshop on Static Analysis, Lectures Notes in Computer Science, vol. 724","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-57264-3_37","article-title":"Freeness, sharing, linearity and correctness\u2014all at once","author":"Bruynooghe","year":"1993"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB7","series-title":"Proceedings of the 3rd International Symposium on Static Analysis, Lecture Notes in Computer Science, Aachen, Germany, vol. 1145","first-page":"128","article-title":"A freeness and sharing analysis of logic programs based on a pre-interpretation","author":"Bruynooghe","year":"1996"},{"issue":"35","key":"10.1016\/S0890-5401(02)00048-2_BIB8","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for Boolean function manipulation","volume":"8","author":"Bryant","year":"1986","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"10.1016\/S0890-5401(02)00048-2_BIB9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0743-1066(96)00143-4","article-title":"Exploiting goal independence in the analysis of logic programs","volume":"32","author":"Codish","year":"1997","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB10","series-title":"Proceedings of the 10th International Conference on Logic Programming, Budapest, Hungary","first-page":"116","article-title":"Freeness analysis for logic programs\u2014and correctness?","author":"Codish","year":"1993"},{"issue":"3","key":"10.1016\/S0890-5401(02)00048-2_BIB11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0743-1066(95)00120-4","article-title":"On the design of a correct freeness analysis for logic programs","volume":"28","author":"Codish","year":"1996","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB12","series-title":"Proceedings of the 1st International Symposium on Static Analysis","first-page":"281","article-title":"Deriving polymorphic type dependencies for logic programs using multiple incarnations of prop","volume":"vol. 864","author":"Codish","year":"1994"},{"issue":"2","key":"10.1016\/S0890-5401(02)00048-2_BIB13","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/S0743-1066(99)00007-2","article-title":"An algebraic approach to sharing analysis of logic programs","volume":"42","author":"Codish","year":"2000","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB14","series-title":"Proceedings of the 6th IEEE Symposium on Logic in Computer Science","first-page":"322","article-title":"Prop revisited: propositional formulas as abstract domain for groundness analysis","author":"Cortesi","year":"1991"},{"issue":"2","key":"10.1016\/S0890-5401(02)00048-2_BIB15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0743-1066(95)00123-9","article-title":"Optimal groundness analysis using propositional logic","volume":"27","author":"Cortesi","year":"1996","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB16","doi-asserted-by":"crossref","unstructured":"P. Cousot, R. Cousot, Systematic design of program analysis frameworks, in: Proceedings of the 6th ACM Symposium on Principles of Programming Languages, 1979, pp. 269\u2013282","DOI":"10.1145\/567752.567778"},{"issue":"2 and 3","key":"10.1016\/S0890-5401(02)00048-2_BIB17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","article-title":"Abstract interpretation and applications to logic programs","volume":"13","author":"Cousot","year":"1992","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10.1016\/S0890-5401(02)00048-2_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(97)10002-4","article-title":"Differential methods in logic program analysis","volume":"35","author":"de la Banda","year":"1998","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"10.1016\/S0890-5401(02)00048-2_BIB19","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/234528.234742","article-title":"A unifying view on abstract domain design","volume":"28","author":"Fil\u00e9","year":"1996","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"10.1016\/S0890-5401(02)00048-2_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1995.1138","article-title":"Observable behaviors and equivalences of logic programs","volume":"122","author":"Gabbrielli","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB21","series-title":"Proceedings of the 3rd International Conference on Algebraic and Logic Programming, Lecture Notes in Computer Science, vol. 632","first-page":"84","article-title":"Fixpoint semantics for partial computed answer substitutions and call patterns","author":"Gabbrielli","year":"1992"},{"issue":"3","key":"10.1016\/S0890-5401(02)00048-2_BIB22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0743-1066(95)00038-0","article-title":"Generalized semantics and abstract interpretation for constraint logic programs","volume":"25","author":"Giacobazzi","year":"1995","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB23","series-title":"Proceedings of the ICALP\u201997 Conference","first-page":"771","article-title":"Refining and compressing abstract domains","volume":"vol. 1256","author":"Giacobazzi","year":"1997"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0304-3975(98)00194-7","article-title":"The reduced relative power operation on abstract domains","volume":"216","author":"Giacobazzi","year":"1999","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"10.1016\/S0890-5401(02)00048-2_BIB25","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1145\/293677.293680","article-title":"A logical model for relational abstract domains","volume":"20","author":"Giacobazzi","year":"1998","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2 and 3","key":"10.1016\/S0890-5401(02)00048-2_BIB26","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0743-1066(92)90053-6","article-title":"Global flow analysis as a practical compilation tool","volume":"13","author":"Hermenegildo","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB27","series-title":"Proceedings of the 6th International Symposium on Static Analysis, Venice, Italy","first-page":"85","article-title":"Freeness analysis through linear refinement","author":"Hill","year":"1999"},{"issue":"2 & 3","key":"10.1016\/S0890-5401(02)00048-2_BIB28","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","article-title":"Static analysis of logic programs for independent And-parallelism","volume":"13","author":"Jacobs","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB29","series-title":"Proceedings of the 5th European Symposium on Programming, Lecture Notes in Computer Science, Edinburgh, UK, vol. 788","first-page":"363","article-title":"A synergistic analysis for sharing and groundness which traces linearity","author":"King","year":"1994"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB30","series-title":"Proceedings of the 11th International Conference on Logic Programming","first-page":"553","article-title":"Depth-k sharing and freeness","author":"King","year":"1994"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB31","unstructured":"A. Langen, Advanced techniques for approximating variable aliasing in logic programs, Ph.D. Thesis, University of Southern California, 1991"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB32","series-title":"Principles of Declarative Programming, Lecture Notes in Computer Science, Pisa, Italy, September, vol. 1490","first-page":"152","article-title":"An experiment in domain refinement: type domains and type representations for logic programs","author":"Levi","year":"1998"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB33","doi-asserted-by":"crossref","unstructured":"G. Levi, F. Spoto, Non pair-sharing and freeness analysis through linear refinement, in: Proc. of the Partial Evaluation and Program Manipulation Workshop, Boston, MA, January 2000, ACM Press, pp. 52\u201361. Available from http:\/\/www.sci.univr.it\/~spoto\/papers.html","DOI":"10.1145\/328691.328699"},{"issue":"1\u20134","key":"10.1016\/S0890-5401(02)00048-2_BIB34","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/176454.176519","article-title":"Precise and efficient groundness analysis for logic programs","volume":"2","author":"Marriott","year":"1993","journal-title":"ACM letters on Programming Languages and Systems"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB35","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB36","series-title":"Proceedings of the 8th International Conference on Logic Programming, Paris","first-page":"49","article-title":"Combined determination of sharing and freeness of program variables through abstract interpretation","author":"Muthukumar","year":"1991"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB37","doi-asserted-by":"crossref","unstructured":"F. Scozzari, Logical optimality of groundness analysis, Theoretical Computer Science 277 (1 and 2)(2002) 149\u2013184","DOI":"10.1016\/S0304-3975(00)00316-9"},{"key":"10.1016\/S0890-5401(02)00048-2_BIB38","series-title":"Proceedings of the European Symposium on Programming, Lecture Notes in Computer Science, vol. 213","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-16442-1_25","article-title":"An application of abstract interpretation of logic programs: occur check reduction","author":"S\u00f8ndergaard","year":"1986"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000482?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000482?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T19:28:48Z","timestamp":1584473328000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540102000482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0890540102000482"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(02)00048-2","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}