{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T22:39:18Z","timestamp":1778884758841,"version":"3.51.4"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-23-1-0544"],"award-info":[{"award-number":["FA9550-23-1-0544"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"name":"European Union - NextGenerationEU","award":["PE00000014"],"award-info":[{"award-number":["PE00000014"]}]},{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["ANR-23-PEIA-0006"],"award-info":[{"award-number":["ANR-23-PEIA-0006"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2026,1,8]]},"abstract":"<jats:p>\n                    In numerical analysis, error propagation refers to how small inaccuracies in input data or intermediate computations accumulate and affect the final result, typically governed by the stability and sensitivity of the algorithm with respect to some perturbations. The definition of a similar concept in approximated program analysis is still a challenge. In abstract interpretation, inaccuracy arises from the abstraction itself, and the propagation of this error is dictated by the abstract interpreter. In most cases, such imprecision is inevitable. In this paper we introduce a logic for deriving (upper) bounds on the inaccuracy of an abstract interpretation. We are able to derive a function that bounds the imprecision of the result of an abstract interpreter from the imprecision of its input data. When this holds we have what we call partial local completeness of the abstract interpreter, a weaker form of completeness known in the literature. To this end, we introduce the notion of a\n                    <jats:italic toggle=\"yes\">generator<\/jats:italic>\n                    for a property represented in the abstract domain. Generators allow us to restrict the search space when verifying whether the bounding function holds for a given program and input. We then introduce a program logic, called\n                    <jats:italic toggle=\"yes\">Error Propagation Logic<\/jats:italic>\n                    (\n                    <jats:italic toggle=\"yes\">EPL<\/jats:italic>\n                    ), for propagating the error bounds produced by an abstract interpretation. This logic is a combination of correctness and incorrectness logics and a logic for\n                    <jats:italic toggle=\"yes\">program<\/jats:italic>\n                    \u03c9\n                    <jats:italic toggle=\"yes\">-continuity<\/jats:italic>\n                    that is also introduced in this paper.\n                  <\/jats:p>","DOI":"10.1145\/3776707","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:59:43Z","timestamp":1767898783000},"page":"1876-1904","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Logic for the Imprecision of Abstract Interpretations"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1099-3494","authenticated-orcid":false,"given":"Marco","family":"Campion","sequence":"first","affiliation":[{"name":"Inria - ENS - Universit\u00e9 PSL, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2761-4347","authenticated-orcid":false,"given":"Mila","family":"Dalla Preda","sequence":"additional","affiliation":[{"name":"University of Verona, Verona, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9582-3960","authenticated-orcid":false,"given":"Roberto","family":"Giacobazzi","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8127-9642","authenticated-orcid":false,"given":"Caterina","family":"Urban","sequence":"additional","affiliation":[{"name":"Inria - ENS- Universit\u00e9 PSL, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021","author":"Bruni Roberto","year":"2021","unstructured":"Roberto Bruni, Roberto Giacobazzi, Roberta Gori, and Francesco Ranzato. 2021. A Logic for Locally Complete Abstract Interpretations. In 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021. IEEE, 1\u201313. https:\/\/doi.org\/10.1109\/LICS52264.2021.9470608 10.1109\/LICS52264.2021.9470608"},{"key":"e_1_2_1_2_1","volume-title":"43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation","author":"Bruni Roberto","year":"2022","unstructured":"Roberto Bruni, Roberto Giacobazzi, Roberta Gori, and Francesco Ranzato. 2022. Abstract interpretation repair. In PLDI \u201922: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13 - 17, 2022, Ranjit Jhala and Isil Dillig (Eds.). ACM, 426\u2013441. https:\/\/doi.org\/10.1145\/3519939.3523453 10.1145\/3519939.3523453"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3582267"},{"key":"e_1_2_1_4_1","volume-title":"Proc. ACM Program. Lang., 8, POPL","author":"Campion Marco","year":"2024","unstructured":"Marco Campion, Mila Dalla Preda, Roberto Giacobazzi, and Caterina Urban. 2024. Monotonicity and the Precision of Program Analysis. Proc. ACM Program. Lang., 8, POPL (2024), 1629\u20131662. https:\/\/doi.org\/10.1145\/3632897 10.1145\/3632897"},{"key":"e_1_2_1_5_1","volume-title":"SAS 2025, Singapore, October 13-14, 2025, Proceedings, Hakjoo Oh and Yulei Sui (Eds.) (Lecture Notes in Computer Science","volume":"277","author":"Campion Marco","year":"2025","unstructured":"Marco Campion, Isabella Mastroeni, and Caterina Urban. 2025. Relating Distances and Abstractions: An Abstract Interpretation Perspective. In Static Analysis - 32th International Symposium, SAS 2025, Singapore, October 13-14, 2025, Proceedings, Hakjoo Oh and Yulei Sui (Eds.) (Lecture Notes in Computer Science, Vol. 16100). Springer, 249\u2013277. isbn:978-3-032-07106-4 https:\/\/doi.org\/10.1007\/978-3-032-07106-4_11 10.1007\/978-3-032-07106-4_11"},{"key":"e_1_2_1_6_1","volume-title":"Proc. ACM Program. Lang., 6, POPL","author":"Campion Marco","year":"2022","unstructured":"Marco Campion, Mila Dalla Preda, and Roberto Giacobazzi. 2022. Partial (In)Completeness in abstract interpretation: limiting the imprecision in program analysis. Proc. ACM Program. Lang., 6, POPL (2022), 1\u201331. https:\/\/doi.org\/10.1145\/3498721 10.1145\/3498721"},{"key":"e_1_2_1_7_1","volume-title":"SAS 2023, Cascais, Portugal, October 22-24, 2023, Proceedings, Manuel V. Hermenegildo and Jos\u00e9 F. Morales (Eds.) (Lecture Notes in Computer Science","volume":"138","author":"Campion Marco","year":"2023","unstructured":"Marco Campion, Caterina Urban, Mila Dalla Preda, and Roberto Giacobazzi. 2023. A Formal Framework to Measure the Incompleteness of Abstract Interpretations. In Static Analysis - 30th International Symposium, SAS 2023, Cascais, Portugal, October 22-24, 2023, Proceedings, Manuel V. Hermenegildo and Jos\u00e9 F. Morales (Eds.) (Lecture Notes in Computer Science, Vol. 14284). Springer, 114\u2013138. https:\/\/doi.org\/10.1007\/978-3-031-44245-2_7 10.1007\/978-3-031-44245-2_7"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45260-5_4"},{"key":"e_1_2_1_9_1","volume-title":"SIGSOFT\/FSE\u201911 19th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-19) and ESEC\u201911: 13th European Software Engineering Conference (ESEC-13)","author":"Chaudhuri Swarat","year":"2011","unstructured":"Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerman, and Sara NavidPour. 2011. Proving programs robust. In SIGSOFT\/FSE\u201911 19th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-19) and ESEC\u201911: 13th European Software Engineering Conference (ESEC-13), Szeged, Hungary, September 5-9, 2011, Tibor Gyim\u00f3thy and Andreas Zeller (Eds.). ACM, 102\u2013112. https:\/\/doi.org\/10.1145\/2025113.2025131 10.1145\/2025113.2025131"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00313-3"},{"key":"e_1_2_1_11_1","volume-title":"Principles of Abstract Interpretation","author":"Cousot Patrick","year":"2044","unstructured":"Patrick Cousot. 2021. Principles of Abstract Interpretation. The MIT Press, Cambridge, Mass.. isbn:9780262044905"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 2nd 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 2nd International Symposium on Programming. Dunod, Paris, 106\u2013130. https:\/\/doi.org\/10.1145\/390019.808314 10.1145\/390019.808314"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 4th ACM Symposium on Principles of Programming Languages","author":"Cousot Patrick","year":"1977","unstructured":"Patrick Cousot and Radhia Cousot. 1977. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, Robert M. Graham, Michael A. Harrison, and Ravi Sethi (Eds.). ACM, 238\u2013252. https:\/\/doi.org\/10.1145\/512950.512973 10.1145\/512950.512973"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 6th ACM Symposium on Principles of Programming Languages","author":"Cousot Patrick","year":"1979","unstructured":"Patrick Cousot and Radhia Cousot. 1979. Systematic Design of Program Analysis Frameworks. In Proceedings of the 6th ACM Symposium on Principles of Programming Languages, San Antonio, Texas, USA, January 1979, Alfred V. Aho, Stephen N. Zilles, and Barry K. Rosen (Eds.). ACM Press, 269\u2013282. https:\/\/doi.org\/10.1145\/567752.567778 10.1145\/567752.567778"},{"key":"e_1_2_1_15_1","volume-title":"Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press","author":"Cousot Patrick","year":"1978","unstructured":"Patrick Cousot and Nicolas Halbwachs. 1978. Automatic discovery of linear restraints among variables of a program. In Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, Tucson, Arizona. 84\u201397. https:\/\/doi.org\/10.1145\/512760.512770 10.1145\/512760.512770"},{"key":"e_1_2_1_16_1","volume-title":"Proc. ACM Program. Lang., 6, POPL","author":"Lago Ugo Dal","year":"2022","unstructured":"Ugo Dal Lago and Francesco Gavazzo. 2022. Effectful program distancing. Proc. ACM Program. Lang., 6, POPL (2022), 1\u201330. https:\/\/doi.org\/10.1145\/3498680 10.1145\/3498680"},{"key":"e_1_2_1_17_1","volume-title":"Proc. ACM Program. Lang., 6, POPL","author":"Lago Ugo Dal","year":"2022","unstructured":"Ugo Dal Lago and Francesco Gavazzo. 2022. A relational theory of effects and coeffects. Proc. ACM Program. Lang., 6, POPL (2022), 1\u201328. https:\/\/doi.org\/10.1145\/3498692 10.1145\/3498692"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017","author":"de Amorim Arthur Azevedo","year":"2017","unstructured":"Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata, and Ikram Cherigui. 2017. A semantic account of metric preservation. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, Giuseppe Castagna and Andrew D. Gordon (Eds.). ACM, 545\u2013556. https:\/\/doi.org\/10.1145\/3009837.3009890 10.1145\/3009837.3009890"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04295-9"},{"key":"e_1_2_1_20_1","volume-title":"10th International Workshop, LOPSTR 2000 London, UK","volume":"164","author":"Pierro Alessandra Di","year":"2000","unstructured":"Alessandra Di Pierro and Herbert Wiklicky. 2000. Measuring the Precision of Abstract Interpretations. In Logic Based Program Synthesis and Transformation, 10th International Workshop, LOPSTR 2000 London, UK, July 24-28, 2000, Selected Papers, Kung-Kiu Lau (Ed.) (Lecture Notes in Computer Science, Vol. 2042). Springer, 147\u2013164. https:\/\/doi.org\/10.1007\/3-540-45142-0_9 10.1007\/3-540-45142-0_9"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/234528.234742"},{"key":"e_1_2_1_22_1","volume-title":"2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings","author":"Gehr Timon","year":"2018","unstructured":"Timon Gehr, Matthew Mirman, Dana Drachsler-Cohen, Petar Tsankov, Swarat Chaudhuri, and Martin T. Vechev. 2018. AI2: Safety and Robustness Certification of Neural Networks with Abstract Interpretation. In 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, 21-23 May 2018, San Francisco, California, USA. IEEE Computer Society, 3\u201318. https:\/\/doi.org\/10.1109\/SP.2018.00058 10.1109\/SP.2018.00058"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015","author":"Giacobazzi Roberto","year":"2015","unstructured":"Roberto Giacobazzi, Francesco Logozzo, and Francesco Ranzato. 2015. Analyzing Program Analyses. In Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, January 15-17, 2015, Sriram K. Rajamani and David Walker (Eds.). ACM, 261\u2013273. https:\/\/doi.org\/10.1145\/2676726.2676987 10.1145\/2676726.2676987"},{"key":"e_1_2_1_24_1","volume-title":"8th International Symposium, SAS 2001, Paris, France, July 16-18, 2001, Proceedings, Patrick Cousot (Ed.) (Lecture Notes in Computer Science","volume":"373","author":"Giacobazzi Roberto","year":"2001","unstructured":"Roberto Giacobazzi and Elisa Quintarelli. 2001. Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking. In Static Analysis, 8th International Symposium, SAS 2001, Paris, France, July 16-18, 2001, Proceedings, Patrick Cousot (Ed.) (Lecture Notes in Computer Science, Vol. 2126). Springer, 356\u2013373. https:\/\/doi.org\/10.1007\/3-540-47764-0_20 10.1007\/3-540-47764-0_20"},{"key":"e_1_2_1_25_1","volume-title":"5th International Conference, ALP\u201996","volume":"253","author":"Giacobazzi Roberto","year":"1996","unstructured":"Roberto Giacobazzi and Francesco Ranzato. 1996. Complementing Logic Program Semantics. In Algebraic and Logic Programming, 5th International Conference, ALP\u201996, Aachen, Germany, September 25-27, 1996, Proceedings, Michael Hanus and Mario Rodr\u00edguez-Artalejo (Eds.) (Lecture Notes in Computer Science, Vol. 1139). Springer, 238\u2013253. https:\/\/doi.org\/10.1007\/3-540-61735-3_16 10.1007\/3-540-61735-3_16"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/INCO.1998.2724"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/333979.333989"},{"key":"e_1_2_1_28_1","volume-title":"8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings, Manfred Morari and Lothar Thiele (Eds.) (Lecture Notes in Computer Science","volume":"305","author":"Girard Antoine","year":"2005","unstructured":"Antoine Girard. 2005. Reachability of Uncertain Linear Systems Using Zonotopes. In Hybrid Systems: Computation and Control, 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings, Manfred Morari and Lothar Thiele (Eds.) (Lecture Notes in Computer Science, Vol. 3414). Springer, 291\u2013305. https:\/\/doi.org\/10.1007\/978-3-540-31954-2_19 10.1007\/978-3-540-31954-2_19"},{"key":"e_1_2_1_29_1","volume-title":"Convex polytopes. 16","author":"Gr\u00fcnbaum Branko","unstructured":"Branko Gr\u00fcnbaum, Victor Klee, Micha A Perles, and Geoffrey Colin Shephard. 1967. Convex polytopes. 16, Springer."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_2_1_31_1","volume-title":"TAP 2023, Leicester, UK, July 18-19, 2023, Proceedings, Virgile Prevosto and Cristina Seceleanu (Eds.) (Lecture Notes in Computer Science","volume":"67","author":"Hurault Aur\u00e9lie","year":"2023","unstructured":"Aur\u00e9lie Hurault and Jo\u00e3o Marques-Silva. 2023. Certified Logic-Based Explainable AI - The Case of Monotonic Classifiers. In Tests and Proofs - 17th International Conference, TAP 2023, Leicester, UK, July 18-19, 2023, Proceedings, Virgile Prevosto and Cristina Seceleanu (Eds.) (Lecture Notes in Computer Science, Vol. 14066). Springer, 51\u201367. https:\/\/doi.org\/10.1007\/978-3-031-38828-6_4 10.1007\/978-3-031-38828-6_4"},{"key":"e_1_2_1_32_1","volume-title":"Proc. ACM Program. Lang., 8, OOPSLA2","author":"Johnson Keith J. C.","year":"2024","unstructured":"Keith J. C. Johnson, Rahul Krishnan, Thomas W. Reps, and Loris D\u2019Antoni. 2024. Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics. Proc. ACM Program. Lang., 8, OOPSLA2 (2024), 935\u2013961. https:\/\/doi.org\/10.1145\/3689744 10.1145\/3689744"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/256167.256195"},{"key":"e_1_2_1_34_1","volume-title":"Proc. ACM Program. Lang., 8, OOPSLA2","author":"Liew Dennis","year":"2024","unstructured":"Dennis Liew, Tiago Cogumbreiro, and Julien Lange. 2024. Sound and Partially-Complete Static Analysis of Data-Races in GPU Programs. Proc. ACM Program. Lang., 8, OOPSLA2 (2024), 2434\u20132461. https:\/\/doi.org\/10.1145\/3689797 10.1145\/3689797"},{"key":"e_1_2_1_35_1","unstructured":"Francesco Logozzo. 2009. Towards a Quantitative Estimation of Abstract Interpretations. In Workshop on Quantitative Analysis of Software (workshop on quantitative analysis of software ed.). Microsoft. https:\/\/www.microsoft.com\/en-us\/research\/publication\/towards-a-quantitative-estimation-of-abstract-interpretations\/"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning, ICML 2021","volume":"7479","author":"Marques-Silva Jo\u00e3o","year":"2021","unstructured":"Jo\u00e3o Marques-Silva, Thomas Gerspacher, Martin C. Cooper, Alexey Ignatiev, and Nina Narodytska. 2021. Explanations for Monotonic Classifiers. In Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, Marina Meila and Tong Zhang (Eds.) (Proceedings of Machine Learning Research, Vol. 139). PMLR, 7469\u20137479. http:\/\/proceedings.mlr.press\/v139\/marques-silva21a.html"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1561\/2500000034"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 27th International Conference on Machine Learning (ICML-10)","author":"Nair Vinod","year":"2010","unstructured":"Vinod Nair and Geoffrey E. Hinton. 2010. Rectified Linear Units Improve Restricted Boltzmann Machines. In Proceedings of the 27th International Conference on Machine Learning (ICML-10), June 21-24, 2010, Haifa, Israel, Johannes F\u00fcrnkranz and Thorsten Joachims (Eds.). Omnipress, 807\u2013814. https:\/\/icml.cc\/Conferences\/2010\/papers\/432.pdf"},{"key":"e_1_2_1_40_1","volume-title":"Proc. ACM Program. Lang., 4, POPL","author":"O\u2019Hearn Peter W.","year":"2020","unstructured":"Peter W. O\u2019Hearn. 2020. Incorrectness logic. Proc. ACM Program. Lang., 4, POPL (2020), 10:1\u201310:32. https:\/\/doi.org\/10.1145\/3371078 10.1145\/3371078"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010","author":"Reed Jason","year":"2010","unstructured":"Jason Reed and Benjamin C. Pierce. 2010. Distance makes the types grow stronger: a calculus for differential privacy. In Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010, Baltimore, Maryland, USA, September 27-29, 2010, Paul Hudak and Stephanie Weirich (Eds.). ACM, 157\u2013168. https:\/\/doi.org\/10.1145\/1863543.1863568 10.1145\/1863543.1863568"},{"key":"e_1_2_1_42_1","volume-title":"Introduction to static analysis: an abstract interpretation perspective","author":"Rival Xavier","unstructured":"Xavier Rival and Kwangkeun Yi. 2020. Introduction to static analysis: an abstract interpretation perspective. Mit Press."},{"key":"e_1_2_1_43_1","volume-title":"Principles of Mathematical Analysis","author":"Rudin Walter","unstructured":"Walter Rudin. 1976. Principles of Mathematical Analysis (3rd ed.). McGraw-Hill.","edition":"3"},{"key":"e_1_2_1_44_1","unstructured":"Pascal Sotin. 2010. Quantifying the precision of numerical abstract domains. INRIA. https:\/\/hal.inria.fr\/inria-00457324"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371174"},{"key":"e_1_2_1_46_1","volume-title":"Lectures on polytopes. 152","author":"Ziegler G\u00fcnter M","unstructured":"G\u00fcnter M Ziegler. 2012. Lectures on polytopes. 152, Springer Science & Business Media."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3776707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:05:12Z","timestamp":1767899112000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3776707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":46,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2026,1,8]]}},"alternative-id":["10.1145\/3776707"],"URL":"https:\/\/doi.org\/10.1145\/3776707","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"2025-07-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}