{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:52Z","timestamp":1772163952877,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,4]]},"DOI":"10.1145\/1993498.1993566","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T07:53:52Z","timestamp":1307346832000},"page":"578-589","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["On inter-procedural analysis of programs with lists and data"],"prefix":"10.1145","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[{"name":"LIAFA, University Paris Diderot and CNRS, Paris, France"}]},{"given":"Cezara","family":"Dr\u0103goi","sequence":"additional","affiliation":[{"name":"LIAFA, University Paris Diderot and CNRS, Paris, France"}]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[{"name":"LIAFA, University Paris Diderot and CNRS, Paris, France"}]},{"given":"Mihaela","family":"Sighireanu","sequence":"additional","affiliation":[{"name":"LIAFA, University Paris Diderot and CNRS, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"378","volume-title":"VMCAI","author":"Beyer D.","year":"2007","unstructured":"D. Beyer , T.A. Henzinger , R. Majumdar , and A. Rybalchenko . Invariant synthesis for combined theories . In VMCAI , volume 4349 of LNCS , pages 378 -- 394 . Springer , 2007 . D. Beyer, T.A. Henzinger, R. Majumdar, and A. Rybalchenko. Invariant synthesis for combined theories. In VMCAI, volume 4349 of LNCS, pages 378--394. Springer, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480917"},{"key":"e_1_3_2_1_4_1","unstructured":"CEA. Frama-C Platform. htp:\/\/frama-c.com.  CEA. Frama-C Platform. htp:\/\/frama-c.com."},{"key":"e_1_3_2_1_5_1","unstructured":"Celia plugin. http:\/\/www.liafa.jussieu.fr\/celia.  Celia plugin. http:\/\/www.liafa.jussieu.fr\/celia."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328469"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_8_1","first-page":"237","volume-title":"IFIP Conf. on Formal Description of Programming Concepts","author":"Cousot P.","year":"1977","unstructured":"P. Cousot and R. Cousot . Static determination of dynamic properties of recursive procedures . In IFIP Conf. on Formal Description of Programming Concepts , pages 237 -- 277 . North-Holland Publishing Company , 1977 . P. Cousot and R. Cousot. Static determination of dynamic properties of recursive procedures. In IFIP Conf. on Formal Description of Programming Concepts, pages 237--277. North-Holland Publishing Company, 1977."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.4.511"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96725"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480912"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328468"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_24"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375623"},{"key":"e_1_3_2_1_16_1","unstructured":"B. Jeannet. Fixpoint. http:\/\/gforge.inria.fr\/.  B. Jeannet. Fixpoint. http:\/\/gforge.inria.fr\/."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"193","volume-title":"CAV","author":"Jhala R.","year":"2007","unstructured":"R. Jhala and K.L. McMillan . Array abstractions from proofs . In CAV , volume 4590 of LNCS , pages 193 -- 206 . Springer , 2007 . R. Jhala and K.L. McMillan. Array abstractions from proofs. In CAV, volume 4590 of LNCS, pages 193--206. Springer, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_13"},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","first-page":"71","volume-title":"SAS","author":"McCloskey B.","year":"2010","unstructured":"B. McCloskey , T.W. Reps , and S. Sagiv . Statically inferring complex heap, array, and numeric invariants . In SAS , volume 6337 of LNCS , pages 71 -- 99 . Springer , 2010 . B. McCloskey, T.W. Reps, and S. Sagiv. Statically inferring complex heap, array, and numeric invariants. In SAS, volume 6337 of LNCS, pages 71--99. Springer, 2010."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11319-2_21"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040330"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11547662_20"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926406"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275497.1275501"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/514188.514190"},{"key":"e_1_3_2_1_28_1","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications","author":"Sharir M.","year":"1981","unstructured":"M. Sharir and A. Pnueli . Two approaches to interprocedural data flow analysis . In Program Flow Analysis: Theory and Applications , pages 189 -- 234 . New York University , 1981 . M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, pages 189--234. New York University, 1981."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_27"}],"event":{"name":"PLDI '11: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"San Jose California USA","acronym":"PLDI '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993566","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993498.1993566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:04Z","timestamp":1750230004000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":29,"alternative-id":["10.1145\/1993498.1993566","10.1145\/1993498"],"URL":"https:\/\/doi.org\/10.1145\/1993498.1993566","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1993316.1993566","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}