{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:44:52Z","timestamp":1761324292607,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T00:00:00Z","timestamp":1592179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["Consolidator Grant Agreement 681393 --- MOPSA"],"award-info":[{"award-number":["Consolidator Grant Agreement 681393 --- MOPSA"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,15]]},"DOI":"10.1145\/3394451.3397205","type":"proceedings-article","created":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T22:07:03Z","timestamp":1591049223000},"page":"8-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Value and allocation sensitivity in static Python analyses"],"prefix":"10.1145","author":[{"given":"Rapha\u00ebl","family":"Monat","sequence":"first","affiliation":[{"name":"Sorbonne University, France \/ CNRS, France \/ LIP6, France"}]},{"given":"Abdelraouf","family":"Ouadjaout","sequence":"additional","affiliation":[{"name":"Sorbonne University, France \/ CNRS, France \/ LIP6, France"}]},{"given":"Antoine","family":"Min\u00e9","sequence":"additional","affiliation":[{"name":"Sorbonne University, France \/ CNRS, France \/ LIP6, France"}]}],"member":"320","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Recency-Abstraction for Heap-Allocated Storage. In SAS (LNCS)","volume":"4134","author":"Balakrishnan G.","unstructured":"G. Balakrishnan and T. W. Reps . 2006 . Recency-Abstraction for Heap-Allocated Storage. In SAS (LNCS) , Vol. 4134 . Springer, 221\u2013239. G. Balakrishnan and T. W. Reps. 2006. Recency-Abstraction for Heap-Allocated Storage. In SAS (LNCS), Vol. 4134. Springer, 221\u2013239."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"J. Bertrane P. Cousot R. Cousot J. Feret L. Mauborgne A. Min\u00e9 and X. Rival. 2010. Static analysis and verification of aerospace software by abstract interpretation. In AIAA Infotech@Aerospace (I@A 2010).  J. Bertrane P. Cousot R. Cousot J. Feret L. Mauborgne A. Min\u00e9 and X. Rival. 2010. Static analysis and verification of aerospace software by abstract interpretation. In AIAA Infotech@Aerospace (I@A 2010).","DOI":"10.2514\/6.2010-3385"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_2_4_1","volume-title":"Automatic Analysis of Open Objects in Dynamic Language Programs. In SAS (LNCS)","volume":"8723","author":"Cox A.","unstructured":"A. Cox , B.-Y. Evan Chang , and X. Rival . 2014 . Automatic Analysis of Open Objects in Dynamic Language Programs. In SAS (LNCS) , Vol. 8723 . Springer, 134\u2013150. A. Cox, B.-Y. Evan Chang, and X. Rival. 2014. Automatic Analysis of Open Objects in Dynamic Language Programs. In SAS (LNCS), Vol. 8723. Springer, 134\u2013150."},{"key":"e_1_3_2_2_5_1","first-page":"1","article-title":"Garbage-Free Abstract Interpretation Through Abstract Reference Counting","volume":"134","author":"Van Es N.","year":"2019","unstructured":"N. Van Es , Q. Sti\u00e9venart , and C. De Roover . 2019 . Garbage-Free Abstract Interpretation Through Abstract Reference Counting . In ECOOP (LIPIcs) , Vol. 134. 10: 1 \u2013 10 :33. N. Van Es, Q. Sti\u00e9venart, and C. De Roover. 2019. Garbage-Free Abstract Interpretation Through Abstract Reference Counting. In ECOOP (LIPIcs), Vol. 134. 10:1\u201310:33.","journal-title":"ECOOP (LIPIcs)"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"L. Fritz and J. Hage. 2017. Cost versus precision for approximate typing for Python. In PEPM. ACM 89\u201398.  L. Fritz and J. Hage. 2017. Cost versus precision for approximate typing for Python. In PEPM. ACM 89\u201398.","DOI":"10.1145\/3018882.3018888"},{"key":"e_1_3_2_2_7_1","volume-title":"NFM (LNCS)","volume":"10811","author":"Fromherz A.","unstructured":"A. Fromherz , A. Ouadjaout , and A. Min\u00e9 . 2018. Static Value Analysis of Python Programs by Abstract Interpretation . In NFM (LNCS) , Vol. 10811 . Springer, 185\u2013202. A. Fromherz, A. Ouadjaout, and A. Min\u00e9. 2018. Static Value Analysis of Python Programs by Abstract Interpretation. In NFM (LNCS), Vol. 10811. Springer, 185\u2013202."},{"key":"e_1_3_2_2_8_1","volume-title":"Numeric Domains with Summarized Dimensions. In TACAS (LNCS)","volume":"2988","author":"Gopan D.","unstructured":"D. Gopan , F. DiMaio , N. Dor , T. W. Reps , and S. Sagiv . 2004 . Numeric Domains with Summarized Dimensions. In TACAS (LNCS) , Vol. 2988 . D. Gopan, F. DiMaio, N. Dor, T. W. Reps, and S. Sagiv. 2004. Numeric Domains with Summarized Dimensions. In TACAS (LNCS), Vol. 2988."},{"key":"e_1_3_2_2_9_1","unstructured":"Springer 512\u2013529.  Springer 512\u2013529."},{"key":"e_1_3_2_2_10_1","volume-title":"CAV (LNCS)","volume":"10982","author":"Hassan M.","unstructured":"M. Hassan , C. Urban , M. Eilers , and P. M\u00fcller . 2018. MaxSMT-Based Type Inference for Python 3 . In CAV (LNCS) , Vol. 10982 . Springer, 12\u201319. M. Hassan, C. Urban, M. Eilers, and P. M\u00fcller. 2018. MaxSMT-Based Type Inference for Python 3. In CAV (LNCS), Vol. 10982. Springer, 12\u201319."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"S. Jagannathan P. Thiemann S. Weeks and A. K. Wright. 1998. Single and Loving It: Must-Alias Analysis for Higher-Order Languages. In POPL. ACM 329\u2013341.  S. Jagannathan P. Thiemann S. Weeks and A. K. Wright. 1998. Single and Loving It: Must-Alias Analysis for Higher-Order Languages. In POPL. ACM 329\u2013341.","DOI":"10.1145\/268946.268973"},{"key":"e_1_3_2_2_12_1","volume-title":"Type Analysis for JavaScript. In SAS (LNCS)","volume":"5673","author":"Jensen S. H.","unstructured":"S. H. Jensen , A. M\u00f8ller , and P. Thiemann . 2009 . Type Analysis for JavaScript. In SAS (LNCS) , Vol. 5673 . Springer, 238\u2013255. S. H. Jensen, A. M\u00f8ller, and P. Thiemann. 2009. Type Analysis for JavaScript. In SAS (LNCS), Vol. 5673. Springer, 238\u2013255."},{"volume-title":"Proc. of VSTTE19","author":"Journault M.","key":"e_1_3_2_2_13_1","unstructured":"M. Journault , A. Min\u00e9 , R. Monat , and A. Ouadjaout . 2019. Combinations of reusable abstract domains for a multilingual static analyzer . In Proc. of VSTTE19 . 1\u201317. M. Journault, A. Min\u00e9, R. Monat, and A. Ouadjaout. 2019. Combinations of reusable abstract domains for a multilingual static analyzer. In Proc. of VSTTE19. 1\u201317."},{"key":"e_1_3_2_2_14_1","unstructured":"M. Kramm R. Chen T. Sudol M. Demello A. Caceres D. Baum A. Peters P. Ludemann P. Swartz N. Batchelder A. Kaptur and L. Lindzey. 2019. Pytype. https:\/\/github.com\/google\/pytype.  M. Kramm R. Chen T. Sudol M. Demello A. Caceres D. Baum A. Peters P. Ludemann P. Swartz N. Batchelder A. Kaptur and L. Lindzey. 2019. Pytype. https:\/\/github.com\/google\/pytype."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"P. Liang O. Tripp M. Naik and M. Sagiv. 2010. A dynamic evaluation of the precision of static heap abstractions. In OOPSLA. ACM 411\u2013427.  P. Liang O. Tripp M. Naik and M. Sagiv. 2010. A dynamic evaluation of the precision of static heap abstractions. In OOPSLA. ACM 411\u2013427.","DOI":"10.1145\/1932682.1869494"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"M. Might and O. Shivers. 2006. Improving flow analyses via \u0393CFA: abstract garbage collection and counting. In ICFP. ACM 13\u201325.  M. Might and O. Shivers. 2006. Improving flow analyses via \u0393CFA: abstract garbage collection and counting. In ICFP. ACM 13\u201325.","DOI":"10.1145\/1160074.1159807"},{"key":"e_1_3_2_2_17_1","unstructured":"R. Monat A. Ouadjaout and A. Min\u00e9. 2020. Static Type Analysis by Abstract Interpretation of Python Programs. In ECOOP (LIPIcs). To appear. Abstract 1 Introduction 2 Type and Value Analyses of Python 3 Variable-Policy Recency Abstraction 4 Abstract Garbage Collection 5 Experimental Results 6 Related Work 7 Conclusion References  R. Monat A. Ouadjaout and A. Min\u00e9. 2020. Static Type Analysis by Abstract Interpretation of Python Programs. In ECOOP (LIPIcs). To appear. Abstract 1 Introduction 2 Type and Value Analyses of Python 3 Variable-Policy Recency Abstraction 4 Abstract Garbage Collection 5 Experimental Results 6 Related Work 7 Conclusion References"}],"event":{"name":"PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"London UK","acronym":"PLDI '20"},"container-title":["Proceedings of the 9th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394451.3397205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394451.3397205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:37Z","timestamp":1750200097000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394451.3397205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,15]]},"references-count":17,"alternative-id":["10.1145\/3394451.3397205","10.1145\/3394451"],"URL":"https:\/\/doi.org\/10.1145\/3394451.3397205","relation":{},"subject":[],"published":{"date-parts":[[2020,6,15]]},"assertion":[{"value":"2020-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}