{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:58:43Z","timestamp":1770281923168,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648277","type":"print"},{"value":"9783540685326","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055786","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"366-377","source":"Crossref","is-referenced-by-count":6,"title":["Complete abstract interpretations made constructive"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Giacobazzi","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Ranzato","sequence":"additional","affiliation":[]},{"given":"Francesca","family":"Scozzari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"33_CR1","first-page":"53","volume":"1302","author":"R. Bagnara","year":"1997","unstructured":"R. Bagnara, P.M. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. In Proc. 4th Int. Static Analysis Symp., LNCS 1302:53\u201367, 1997.","journal-title":"LNCS"},{"key":"33_CR2","unstructured":"G. Birkhoff. Lattice Theory. AMS Colloq. Publications vol. XXV, 3rd ed., 1967."},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G.L. Burn","year":"1986","unstructured":"G.L. Burn, C. Hankin, and S. Abramsky. Strictness analysis for higher-order functions. Sci. Comput. Program., 7:249\u2013278, 1986.","journal-title":"Sci. Comput. Program."},{"issue":"1\u20132","key":"33_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0304-3975(97)00137-0","volume":"202","author":"A. Cortesi","year":"1998","unstructured":"A. Cortesi, G. Fil\u00e9, and W. Winsborough. The quotient of an abstract interpretation. Theor. Comput. Sci., 202(1\u20132):163\u2013192, 1998.","journal-title":"Theor. Comput. Sci."},{"key":"33_CR5","unstructured":"P. Cousot. M\u00e9thodes it\u00e9ratives de construction et d'approximation de points fixes d'op\u00e9rateurs monotones sur un treillis, analyse s\u00e9mantique des programmes. PhD thesis, Universit\u00e9 Scientifique et M\u00e9dicale de Grenoble, 1978."},{"key":"33_CR6","unstructured":"P. Cousot. Completeness in abstract interpretation (Invited Lecture). In Proc. 1995 Joint Italian-Spanish Conference on Declarative Programming, pp. 37\u201338, 1995."},{"key":"33_CR7","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. 4th ACM POPL, pp. 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. 6th ACM POPL, pp. 269\u2013282, 1979.","DOI":"10.1145\/567752.567778"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Proc. 19th ACM POPL, pp. 83\u201394, 1992.","DOI":"10.1145\/143165.143184"},{"key":"33_CR10","first-page":"138","volume":"1349","author":"P. Cousot","year":"1997","unstructured":"P. Cousot and R. Cousot. Abstract interpretation of algebraic polynomial systems. In Proc. 6th AMAST Conf., LNCS 1349:138\u2013154, 1997.","journal-title":"LNCS"},{"key":"33_CR11","first-page":"771","volume":"1256","author":"R. Giacobazzi","year":"1997","unstructured":"R. Giacobazzi and F. Ranzato. Refining and compressing abstract domains. In Proc. 24th ICALP, LNCS 1256:771\u2013781, 1997.","journal-title":"LNCS"},{"key":"33_CR12","first-page":"231","volume":"1349","author":"R. Giacobazzi","year":"1997","unstructured":"R. Giacobazzi and F. Ranzato. Completeness in abstract interpretation: a domain perspective. In Proc. 6th AMAST Conf., LNCS 1349:231\u2013245, 1997.","journal-title":"LNCS"},{"issue":"2\u20133","key":"33_CR13","first-page":"154","volume":"13","author":"D. Jacobs","year":"1992","unstructured":"D. Jacobs and A. Langen. Static analysis of logic programs for independent AND-parallelism. J. Logic Program., 13(2\u20133):154\u2013165, 1992.","journal-title":"J. Logic Program."},{"issue":"1\u20134","key":"33_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/176454.176519","volume":"2","author":"K. Marriott","year":"1993","unstructured":"K. Marriott and H. S\u00d8ndergaard. Precise and efficient groundness analysis for logic programs. ACM Lett. Program. Lang. Syst., 2(1\u20134):181\u2013196, 1993.","journal-title":"ACM Lett. Program. Lang. Syst."},{"key":"33_CR15","unstructured":"A. Mycroft. Abstract interpretation and optimising transformations for applicative programs. PhD thesis, CST-15-81, Univ. of Edinburgh, 1981."},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"A. Mycroft. Completeness and predicate-based abstract interpretation. In Proc. ACM PEPM Conf., pp. 179\u2013185, 1993.","DOI":"10.1145\/154630.154648"},{"issue":"2","key":"33_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0096-0551(93)90003-J","volume":"19","author":"U.S. Reddy","year":"1993","unstructured":"U.S. Reddy and S.N. Kamin. On the power of abstract interpretation. Computer Languages, 19(2):79\u201389, 1993.","journal-title":"Computer Languages"},{"issue":"3","key":"33_CR18","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/258128.258212","volume":"44","author":"R.C. Sekar","year":"1997","unstructured":"R.C. Sekar, P. Mishra, and I.V. Ramakrishnan. On the power and limitation of strictness analysis. J. ACM, 44(3):505\u2013525, 1997.","journal-title":"J. ACM"},{"key":"33_CR19","first-page":"327","volume":"213","author":"H. S\u00d8ndergaard","year":"1986","unstructured":"H. S\u00d8ndergaard. An application of abstract interpretation of logic programs: occur check reduction. In Proc. ESOP '86, LNCS 213:327\u2013338, 1986.","journal-title":"LNCS"},{"key":"33_CR20","first-page":"492","volume":"379","author":"B. Steffen","year":"1989","unstructured":"B. Steffen. Optimal data flow analysis via observational equivalence. In Proc. 14th MFCS Symp., LNCS 379:492\u2013502, 1989.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T18:30:15Z","timestamp":1548095415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0055786","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}