{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:03Z","timestamp":1772164023437,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T00:00:00Z","timestamp":1296000000000},"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,1,26]]},"DOI":"10.1145\/1926385.1926407","type":"proceedings-article","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T09:58:22Z","timestamp":1295863102000},"page":"187-200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["Precise reasoning for programs using containers"],"prefix":"10.1145","author":[{"given":"Isil","family":"Dillig","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Thomas","family":"Dillig","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Alex","family":"Aiken","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,1,26]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_14"},{"key":"e_1_3_2_2_2_1","unstructured":"Gulwani S. Musuvathi M.: Cover Algorithms. In: ESOP. (2008) 193--207   Gulwani S. Musuvathi M.: Cover Algorithms. In: ESOP. (2008) 193--207"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Karr M.: Affine relationships among variables of a program. A.I. (1976) 133--151  Karr M.: Affine relationships among variables of a program. A.I. (1976) 133--151","DOI":"10.1007\/BF00268497"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00593-0_33"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_20"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Dillig I. Dillig T. Aiken A.: Small Formulas for Large Programs: On-line Constraint Simplification in Scalable Static Analysis. In: SAS. (2010)   Dillig I. Dillig T. Aiken A.: Small Formulas for Large Programs: On-line Constraint Simplification in Scalable Static Analysis. In: SAS. (2010)","DOI":"10.1007\/978-3-642-15769-1_15"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375615"},{"key":"e_1_3_2_2_10_1","unstructured":"http:\/\/www.sgi.com\/tech\/stl\/: C++ standard template library  http:\/\/www.sgi.com\/tech\/stl\/: C++ standard template library"},{"key":"e_1_3_2_2_11_1","unstructured":"http:\/\/sourceforge.net\/apps\/trac\/litesql\/: LiteSQL  http:\/\/sourceforge.net\/apps\/trac\/litesql\/: LiteSQL"},{"key":"e_1_3_2_2_12_1","unstructured":"http:\/\/www.inkscape.org\/: Inkscape  http:\/\/www.inkscape.org\/: Inkscape"},{"key":"e_1_3_2_2_13_1","unstructured":"http:\/\/www.digikam.org\/: Digikam  http:\/\/www.digikam.org\/: Digikam"},{"key":"e_1_3_2_2_14_1","unstructured":"http:\/\/qt.nokia.com\/products\/: QT Framework  http:\/\/qt.nokia.com\/products\/: QT Framework"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31985-6_16"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_28"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.125"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512540"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321724"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1122568.1122569"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178263"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190265"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348250.1348255"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Reps T.W. Sagiv S. Wilhelm R.: Static Program Analysis via 3-Valued Logic. In: CAV. (2004) 15--30  Reps T.W. Sagiv S. Wilhelm R.: Static Program Analysis via 3-Valued Logic. In: CAV. (2004) 15--30","DOI":"10.1007\/978-3-540-27813-9_2"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542522"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480898"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328468"}],"event":{"name":"POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Austin Texas USA","acronym":"POPL '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1926385.1926407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:59:51Z","timestamp":1750229991000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,26]]},"references-count":26,"alternative-id":["10.1145\/1926385.1926407","10.1145\/1926385"],"URL":"https:\/\/doi.org\/10.1145\/1926385.1926407","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1925844.1926407","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,1,26]]},"assertion":[{"value":"2011-01-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}