{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:42Z","timestamp":1772163942749,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,17]],"date-time":"2010-10-17T00:00:00Z","timestamp":1287273600000},"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":[[2010,10,17]]},"DOI":"10.1145\/1869459.1869493","type":"proceedings-article","created":{"date-parts":[[2010,10,19]],"date-time":"2010-10-19T08:41:35Z","timestamp":1287477695000},"page":"397-410","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Symbolic heap abstraction with demand-driven axiomatization of memory invariants"],"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":[[2010,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040333"},{"key":"e_1_3_2_1_2_1","volume-title":"Mcmillan","author":"Jhala R.","year":"2007","unstructured":"}} Jhala , R. , Mcmillan , K.L. : Array abstractions from proofs. In : CAV. ( 2007 ) }}Jhala, R., Mcmillan, K.L.: Array abstractions from proofs. In: CAV. (2007)"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375623"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_14"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03237-0_3"},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Comp","volume-title":"Wilhelm","author":"Reps T.W.","year":"2004","unstructured":"}} Reps , T.W. , Sagiv , S. , Wilhelm , R. : Static program analysis via 3-valued logic. In : CAV. Volume 3114 of Lecture Notes in Comp . Sc., Springer ( 2004 ) 15--30 }}Reps, T.W., Sagiv, S., Wilhelm, R.: Static program analysis via 3-valued logic. In: CAV. Volume 3114 of Lecture Notes in Comp. Sc., Springer (2004) 15--30"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_19"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_36"},{"key":"e_1_3_2_1_9_1","volume-title":"Sagiv","author":"Bogudlov I.","year":"2007","unstructured":"}} Bogudlov , I. , Lev-Ami , T. , Reps , T. , Sagiv , M. : Revamping TVLA: Making parametric shape analysis competitive. Lecture Notes in Computer Science 4590 ( 2007 ) 221 }}Bogudlov, I., Lev-Ami, T., Reps, T., Sagiv, M.: Revamping TVLA: Making parametric shape analysis competitive. Lecture Notes in Computer Science 4590 (2007) 221"},{"key":"e_1_3_2_1_10_1","volume-title":"Towards a mathematical science of computation","author":"Mccarthy J.","year":"1962","unstructured":"}} Mccarthy , J. : Towards a mathematical science of computation . In : IFIP. ( 1962 ) }}Mccarthy, J.: Towards a mathematical science of computation. In: IFIP. (1962)"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375615"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/143103.143137"},{"key":"e_1_3_2_1_13_1","volume-title":"Musuvathi","author":"Gulwani S.","year":"2008","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_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_25"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/381788.316183"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_20"},{"key":"e_1_3_2_1_17_1","volume-title":"Aiken","author":"Dillig I.","year":"2010","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)"},{"key":"e_1_3_2_1_18_1","unstructured":"}}http:\/\/www.openssh.com\/: Openssh 5.3p1  }}http:\/\/www.openssh.com\/: Openssh 5.3p1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111048"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_28"},{"key":"e_1_3_2_1_22_1","volume-title":"IEEE Symposium on Logic in Computer Science. (2001)","author":"Stump A.","unstructured":"}} Stump , A. , Barrett , C. , Dill , D. , Levitt , J. : A decision procedure for an extensional theory of arrays . In: IEEE Symposium on Logic in Computer Science. (2001) 29--37 }}Stump, A., Barrett, C., Dill, D., Levitt, J.: A decision procedure for an extensional theory of arrays. In: IEEE Symposium on Logic in Computer Science. (2001) 29--37"},{"key":"e_1_3_2_1_23_1","volume-title":"Vojnar","author":"Habermehl P.","year":"2008","unstructured":"}} Habermehl , P. , Iosif , R. , Vojnar , T. : What else is decidable about integer arrays? Lecture Notes in Computer Science 4962 ( 2008 ) 474 }}Habermehl, P., Iosif, R., Vojnar, T.: What else is decidable about integer arrays? Lecture Notes in Computer Science 4962 (2008) 474"},{"key":"e_1_3_2_1_24_1","volume-title":"Strichman","author":"Kroening D.","year":"2008","unstructured":"}} Kroening , D. , Strichman , O. : Decision procedures: an algorithmic point of view. Springer-Verlag New York Inc ( 2008 ) }}Kroening, D., Strichman, O.: Decision procedures: an algorithmic point of view. Springer-Verlag New York Inc (2008)"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125848"},{"key":"e_1_3_2_1_26_1","volume-title":"17th Annual IEEE Symposium on Logic in Computer Science. (2002)","author":"Reynolds J.","unstructured":"}} Reynolds , J. : Separation logic: A logic for shared mutable data structures . In: 17th Annual IEEE Symposium on Logic in Computer Science. (2002) 55--74 }}Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: 17th Annual IEEE Symposium on Logic in Computer Science. (2002) 55--74"}],"event":{"name":"SPLASH '10: Systems Programming Languages and Applications: Software for Humanity","location":"Reno\/Tahoe Nevada USA","acronym":"SPLASH '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the ACM international conference on Object oriented programming systems languages and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1869459.1869493","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1869459.1869493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:08:14Z","timestamp":1750234094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1869459.1869493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,17]]},"references-count":25,"alternative-id":["10.1145\/1869459.1869493","10.1145\/1869459"],"URL":"https:\/\/doi.org\/10.1145\/1869459.1869493","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1932682.1869493","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,10,17]]},"assertion":[{"value":"2010-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}