{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:23:20Z","timestamp":1779074600216,"version":"3.51.4"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T00:00:00Z","timestamp":1546387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Fundacion IMDEA Software","award":["Talento Grant 2016-T3\/TIC-1995"],"award-info":[{"award-number":["Talento Grant 2016-T3\/TIC-1995"]}]},{"DOI":"10.13039\/501100003759","name":"Universidad Polit\u00e9cnica de Madrid","doi-asserted-by":"publisher","award":["Talento Grant 2016-T3\/TIC-1995"],"award-info":[{"award-number":["Talento Grant 2016-T3\/TIC-1995"]}],"id":[{"id":"10.13039\/501100003759","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010789","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["Talento Grant 2016-T3\/TIC-1995"],"award-info":[{"award-number":["Talento Grant 2016-T3\/TIC-1995"]}],"id":[{"id":"10.13039\/501100010789","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1446511"],"award-info":[{"award-number":["CNS-1446511"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006747","name":"Fondazione Cassa di Risparmio di Verona Vicenza Belluno e Ancona","doi-asserted-by":"publisher","award":["ATEN Project"],"award-info":[{"award-number":["ATEN Project"]}],"id":[{"id":"10.13039\/501100006747","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2019,1,2]]},"abstract":"<jats:p>\n            The fundamental idea of Abstract\n            <jats:sup>2<\/jats:sup>\n            Interpretation (A\n            <jats:sup>2<\/jats:sup>\n            I), also called meta-abstract interpretation, is to apply abstract interpretation to abstract interpretation-based static program analyses. A\n            <jats:sup>2<\/jats:sup>\n            I is generally meant to use abstract interpretation to analyse properties of program analysers. A\n            <jats:sup>2<\/jats:sup>\n            I can be either offline or online. Offline A\n            <jats:sup>2<\/jats:sup>\n            I is performed either before the program analysis, such as variable packing used by the Astr\u00e9e program analyser, or after the program analysis, such as in alarm diagnosis. Online A\n            <jats:sup>2<\/jats:sup>\n            I is performed during the program analysis, such as Venet\u2019s cofibred domains or Halbwachs et al.\u2019s and Singh et al.\u2019s variable partitioning techniques for fast polyhedra\/numerical abstract domains. We formalize offline and online meta-abstract interpretation and illustrate this notion with the design of widenings and the decomposition of relational abstract domains to speed-up program analyses. This shows how novel static analyses can be extracted as meta-abstract interpretations to design efficient and precise program analysis algorithms.\n          <\/jats:p>","DOI":"10.1145\/3290355","type":"journal-article","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T13:33:51Z","timestamp":1546608831000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["A\u00b2I: abstract\u00b2 interpretation"],"prefix":"10.1145","volume":"3","author":[{"given":"Patrick","family":"Cousot","sequence":"first","affiliation":[{"name":"New York University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Giacobazzi","sequence":"additional","affiliation":[{"name":"University of Verona, Italy \/ IMDEA Software Institute, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Ranzato","sequence":"additional","affiliation":[{"name":"University of Padua, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,2]]},"reference":[{"key":"e_1_2_2_1_1","series-title":"Handbook of Logic in Computer Science, Samson Abramsky, Dov M","volume-title":"Semantic Structures","author":"Abramsky Samson","unstructured":"Samson Abramsky and Achim Jung . 1994. Domain Theory . In Handbook of Logic in Computer Science, Samson Abramsky, Dov M . Gabbay, and Thomas Stephen Edward Maibaum Maibaum (Eds.). Vol. 3 : Semantic Structures . Clarendon Press , Oxford, Chapter 1, 1\u2013168. Samson Abramsky and Achim Jung. 1994. Domain Theory. In Handbook of Logic in Computer Science, Samson Abramsky, Dov M. Gabbay, and Thomas Stephen Edward Maibaum Maibaum (Eds.). Vol. 3: Semantic Structures. Clarendon Press, Oxford, Chapter 1, 1\u2013168."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01782772"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.003"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1561\/2500000002"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/647168.718133"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781153"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000496"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2889160.2889206"},{"key":"e_1_2_2_9_1","volume-title":"Universit\u00e9 scientifique et m\u00e9dicale de Grenoble","author":"Cousot Patrick","unstructured":"Patrick Cousot . 1977. Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice. Res. rep. R.R. 88. Laboratoire IMAG , Universit\u00e9 scientifique et m\u00e9dicale de Grenoble , Grenoble, France . 15 p. Patrick Cousot. 1977. Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice. Res. rep. R.R. 88. Laboratoire IMAG, Universit\u00e9 scientifique et m\u00e9dicale de Grenoble, Grenoble, France. 15 p."},{"key":"e_1_2_2_10_1","volume-title":"The Calculational Design of a Generic Abstract Interpreter","author":"Cousot Patrick","unstructured":"Patrick Cousot . 1999. The Calculational Design of a Generic Abstract Interpreter . In Calculational System Design, Manfred Broy and Ralf Steinbr\u00fcggen (Eds.). NATO ASI Series F. IOS Press , Amsterdam . Patrick Cousot. 1999. The Calculational Design of a Generic Abstract Interpreter. In Calculational System Design, Manfred Broy and Ralf Steinbr\u00fcggen (Eds.). NATO ASI Series F. IOS Press, Amsterdam."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46081-8_2"},{"key":"e_1_2_2_12_1","volume-title":"Proceedings of the Second International Symposium on Programming. Dunod","author":"Cousot Patrick","year":"1976","unstructured":"Patrick Cousot and Radhia Cousot . 1976 . Static determination of dynamic properties of programs . In Proceedings of the Second International Symposium on Programming. Dunod , Paris, France, 106\u2013130. Patrick Cousot and Radhia Cousot. 1976. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programming. Dunod, Paris, France, 106\u2013130."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_2_2_14_1","volume-title":"IFIP Conf. on Formal Description of Programming Concepts, St-Andrews, N.B., CA, E.J. Neuhold (Ed.). North-Holland Pub. Co., 237\u2013277","author":"Cousot Patrick","year":"1977","unstructured":"Patrick Cousot and Radhia Cousot . 1977 b. Static determination of dynamic properties of recursive procedures . In IFIP Conf. on Formal Description of Programming Concepts, St-Andrews, N.B., CA, E.J. Neuhold (Ed.). North-Holland Pub. Co., 237\u2013277 . Patrick Cousot and Radhia Cousot. 1977b. Static determination of dynamic properties of recursive procedures. In IFIP Conf. on Formal Description of Programming Concepts, St-Andrews, N.B., CA, E.J. Neuhold (Ed.). North-Holland Pub. Co., 237\u2013277."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646448.692441"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646799.705322"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2651360"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676987"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0018-1"},{"key":"e_1_2_2_22_1","volume-title":"D\u00e9termination automatique de relations lin\u00e9aires v\u00e9rifi\u00e9es par les variables d\u2019un programme (in French). Th\u00e8se de 3 \u00e8me cycle informatique. Universit\u00e9 de Grenoble Alpes","author":"Halbwachs Nicolas","unstructured":"Nicolas Halbwachs . 1979. D\u00e9termination automatique de relations lin\u00e9aires v\u00e9rifi\u00e9es par les variables d\u2019un programme (in French). Th\u00e8se de 3 \u00e8me cycle informatique. Universit\u00e9 de Grenoble Alpes , Grenoble, France . Nicolas Halbwachs. 1979. D\u00e9termination automatique de relations lin\u00e9aires v\u00e9rifi\u00e9es par les variables d\u2019un programme (in French). Th\u00e8se de 3 \u00e8me cycle informatique. Universit\u00e9 de Grenoble Alpes, Grenoble, France."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-006-0013-2"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760267.1760295"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008678014487"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(94)00007-7"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53413-7_12"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2493"},{"key":"e_1_2_2_29_1","volume-title":"Jones and Flemming Nielson","author":"Neil","year":"1995","unstructured":"Neil D. Jones and Flemming Nielson . 1995 . Abstract Interpretation : A Semantics-based Tool for Program Analysis. In Handbook of Logic in Computer Science (Vol. 4), S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum (Eds.). Oxford University Press , Inc., 527\u2013636. http:\/\/dl.acm.org\/citation.cfm?id=218623.218637 Neil D. Jones and Flemming Nielson. 1995. Abstract Interpretation: A Semantics-based Tool for Program Analysis. In Handbook of Logic in Computer Science (Vol. 4), S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum (Eds.). Oxford University Press, Inc., 527\u2013636. http:\/\/dl.acm.org\/citation.cfm?id=218623.218637"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512945"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3095021"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009881"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2821504"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1478873.1478903"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738000"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009885"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158143"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/647165.717832"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3290355","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3290355","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3290355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:58:04Z","timestamp":1750208284000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3290355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,2]]},"references-count":39,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2019,1,2]]}},"alternative-id":["10.1145\/3290355"],"URL":"https:\/\/doi.org\/10.1145\/3290355","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,2]]},"assertion":[{"value":"2019-01-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}