{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:38:39Z","timestamp":1778297919398,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540572640","type":"print"},{"value":"9783540480273","type":"electronic"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57264-3_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:33:36Z","timestamp":1330259616000},"page":"153-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Freeness, sharing, linearity and correctness \u2014 All at once"],"prefix":"10.1007","author":[{"given":"M.","family":"Bruynooghe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Codish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"13_CR1","unstructured":"M. Codish, D. Dams, G. File, M. Bruynooghe. Freeness Analysis for Logic Programs \u2014 And Correctness? Proc. of Tenth Int. Conf. on Logic Programming, Budapest, 1993."},{"key":"13_CR2","unstructured":"M. Codish, D. Dams, and E. Yardeni. Derivation and safety of an abstract algorithm for groundness and aliasing analysis. In K. Furukawa, editor, Proc. Eighth Int. Conf. on Logic Programming, pages 79\u201393. MIT Press, 1991."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"M. Codish, A. Mulkers, M. Bruynooghe, M. Garc\u00eda de la Banda and M. Hermenegildo. Improving abstract interpretations by combining domains. In Proc. ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation. 1993.","DOI":"10.1145\/154630.154650"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"A. Cortesi and G. Fil\u00e9. Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis. In P. Hudak and N. Jones, editors, Proc. ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation. SIGPLAN NOTICES vol. 26, n.11, 1991.","DOI":"10.1145\/115866.115872"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. Fourth ACM symp. on Principles of Programming Languages, pages 238\u2013252, Los Angeles, California, 1977.","DOI":"10.1145\/512950.512973"},{"issue":"2","key":"13_CR6","doi-asserted-by":"crossref","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 and 3):291\u2013314, July 1992.","journal-title":"Journal of Logic Programming"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"J.-L. Lassez, M.J. Maher, and K. Marriott. Unification revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. Morgan Kauffmann, 1987.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"issue":"2","key":"13_CR8","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258\u2013282, April 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR9","unstructured":"K. Muthukumar and M. Hermenegildo. Combined determination of sharing and freeness of program variables through abstract interpretation. In K. Furukawa, editor, Proc. Eighth International Conference on Logic Programming, pages 49\u201363. MIT Press, 1991."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"H. S\u00d8ndergaard. An application of abstract interpretation of logic programs: occur check reduction. In B. Robinet and R. Wilhelm, editors, ESOP'86 Proc. European Symposium on Programming, LNCS 213, pages 327\u2013338. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16442-1_25"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"R. Sundararajan and J. Conery. An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs. Proc. Twelfth FST & TCS Conf., New Delhi, Dec. 1992.","DOI":"10.1007\/3-540-56287-7_106"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57264-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:10:02Z","timestamp":1558267802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57264-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572640","9783540480273"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57264-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}