{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:39Z","timestamp":1772164059509,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[[2013,6,16]]},"DOI":"10.1145\/2491956.2462169","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T12:03:50Z","timestamp":1370952230000},"page":"231-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Natural proofs for structure, data, and separation"],"prefix":"10.1145","author":[{"given":"Xiaokang","family":"Qiu","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Pranav","family":"Garg","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Andrei","family":"\u015etef\u0103nescu","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Parthasarathy","family":"Madhusudan","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_2_1_1","series-title":"LNCS","first-page":"91","volume-title":"VMCAI'07","author":"Balaban I.","year":"2007","unstructured":"I. Balaban , A. Pnueli , and L. D. Zuck . Shape analysis of single-parent heaps . In VMCAI'07 , volume 4349 of LNCS , pages 91 -- 105 . Springer , 2007 . I. Balaban, A. Pnueli, and L. D. Zuck. Shape analysis of single-parent heaps. In VMCAI'07, volume 4349 of LNCS, pages 91--105. Springer, 2007."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30538-5_9"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_5"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_6"},{"key":"e_1_3_2_2_6_1","series-title":"LNCS","first-page":"178","volume-title":"CAV'07","author":"Berdine J.","year":"2007","unstructured":"J. Berdine , C. Calcagno , B. Cook , D. Distefano , P. W. O'Hearn , T. Wies , and H. Yang . Shape analysis for composite data structures . In CAV'07 , volume 4590 of LNCS , pages 178 -- 192 . Springer , 2007 . J. Berdine, C. Calcagno, B. Cook, D. Distefano, P. W. O'Hearn, T. Wies, and H. Yang. Shape analysis for composite data structures. In CAV'07, volume 4590 of LNCS, pages 178--192. Springer, 2007."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_13"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.09.057"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04081-8_13"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993566"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71070-7_4"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_28"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328469"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2010.07.004"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993526"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_2"},{"key":"e_1_3_2_2_17_1","series-title":"LNCS","first-page":"337","volume-title":"TACAS'08","author":"de Moura L. M.","year":"2008","unstructured":"L. M. de Moura and N. Bj\u00f8rner . Z3: An efficient SMT solver . In TACAS'08 , volume 4963 of LNCS , pages 337 -- 340 . Springer , 2008 . L. M. de Moura and N. Bj\u00f8rner. Z3: An efficient SMT solver. In TACAS'08, volume 4963 of LNCS, pages 337--340. Springer, 2008."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_19"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2005.1"},{"key":"e_1_3_2_2_20_1","series-title":"LNCS","first-page":"41","volume-title":"NFM'11","author":"Jacobs B.","year":"2011","unstructured":"B. Jacobs , J. Smans , P. Philippaerts , F. Vogels , W. Penninckx , and F. Piessens . Verifast: A powerful, sound, predictable, fast verifier for C and Java . In NFM'11 , volume 6617 of LNCS , pages 41 -- 55 . Springer , 2011 . B. Jacobs, J. Smans, P. Philippaerts, F. Vogels, W. Penninckx, and F. Piessens. Verifast: A powerful, sound, predictable, fast verifier for C and Java. In NFM'11, volume 6617 of LNCS, pages 41--55. Springer, 2011."},{"key":"e_1_3_2_2_21_1","volume-title":"Department of Computer Science","author":"Klarlund N.","year":"2001","unstructured":"N. Klarlund and A. M\u00f8ller . MONA. BRICS , Department of Computer Science , Aarhus University , January 2001 . Available from http:\/\/www.brics.dk\/mona\/. N. Klarlund and A. M\u00f8ller. MONA. BRICS, Department of Computer Science, Aarhus University, January 2001. Available from http:\/\/www.brics.dk\/mona\/."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328461"},{"key":"e_1_3_2_2_23_1","series-title":"LNCS","first-page":"348","volume-title":"LPAR-16","author":"Leino K. R. M.","year":"2010","unstructured":"K. R. M. Leino . Dafny : An automatic program verifier for functional correctness . In LPAR-16 , volume 6355 of LNCS , pages 348 -- 370 . Springer , 2010 . K. R. M. Leino. Dafny: An automatic program verifier for functional correctness. In LPAR-16, volume 6355 of LNCS, pages 348--370. Springer, 2010."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_17"},{"key":"e_1_3_2_2_25_1","series-title":"LNCS","first-page":"43","volume-title":"SAS'11","author":"Madhusudan P.","year":"2011","unstructured":"P. Madhusudan and X. Qiu . Efficient decision procedures for heaps using STRAND . In SAS'11 , volume 6887 of LNCS , pages 43 -- 59 . Springer , 2011 . P. Madhusudan and X. Qiu. Efficient decision procedures for heaps using STRAND. In SAS'11, volume 6887 of LNCS, pages 43--59. Springer, 2011."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926455"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103673"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_41"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2451116.2451148"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/567067.567073"},{"key":"e_1_3_2_2_31_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL - A Proof Assistant for Higher-Order Logic","author":"Nipkow T.","year":"2002","unstructured":"T. Nipkow , L. C. Paulson , and M. Wenzel . Isabelle\/HOL - A Proof Assistant for Higher-Order Logic , volume 2283 of Lecture Notes in Computer Science . Springer , 2002 . T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle\/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science. Springer, 2002."},{"key":"e_1_3_2_2_32_1","series-title":"LNCS","first-page":"1","volume-title":"CSL'01","author":"O'Hearn P. W.","year":"2001","unstructured":"P. W. O'Hearn , J. C. Reynolds , and H. Yang . Local reasoning about programs that alter data structures . In CSL'01 , volume 2142 of LNCS , pages 1 -- 19 . Springer , 2001 . P. W. O'Hearn, J. C. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In CSL'01, volume 2142 of LNCS, pages 1--19. Springer, 2001."},{"key":"e_1_3_2_2_33_1","series-title":"LNCS","first-page":"106","volume-title":"VMCAI'07","author":"Rakamari\u0107 Z.","year":"2007","unstructured":"Z. Rakamari\u0107 , J. D. Bingham , and A. J. Hu . An inference-rule-based decision procedure for verification of heap-manipulating programs with mutable data and cyclic data structures . In VMCAI'07 , volume 4349 of LNCS , pages 106 -- 121 . Springer , 2007 . Z. Rakamari\u0107, J. D. Bingham, and A. J. Hu. An inference-rule-based decision procedure for verification of heap-manipulating programs with mutable data and cyclic data structures. In VMCAI'07, volume 4349 of LNCS, pages 106--121. Springer, 2007."},{"key":"e_1_3_2_2_34_1","series-title":"LNCS","first-page":"237","volume-title":"ATVA'07","author":"Rakamari\u0107 Z.","year":"2007","unstructured":"Z. Rakamari\u0107 , R. Bruttomesso , A. J. Hu , and A. Cimatti . Verifying heap-manipulating programs in an SMT framework . In ATVA'07 , volume 4762 of LNCS , pages 237 -- 252 . Springer , 2007 . Z. Rakamari\u0107, R. Bruttomesso, A. J. Hu, and A. Cimatti. Verifying heap-manipulating programs in an SMT framework. In ATVA'07, volume 4762 of LNCS, pages 237--252. Springer, 2007."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2006.7"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_2_37_1","series-title":"LNCS","first-page":"142","volume-title":"AMAST'10","author":"Rosu G.","year":"2010","unstructured":"G. Rosu , C. Ellison , and W. Schulte . Matching logic: An alternative to Hoare\/Floyd logic . In AMAST'10 , volume 6486 of LNCS , pages 142 -- 162 . Springer , 2010 . G. Rosu, C. Ellison, and W. Schulte. Matching logic: An alternative to Hoare\/Floyd logic. In AMAST'10, volume 6486 of LNCS, pages 142--162. Springer, 2010."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160910.2160911"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706325"},{"key":"e_1_3_2_2_40_1","series-title":"LNCS","first-page":"298","volume-title":"SAS'11","author":"Suter P.","year":"2011","unstructured":"P. Suter , A. S. K\u00f6ksal , and V. Kuncak . Satisfiability modulo recursive programs . In SAS'11 , volume 6887 of LNCS , pages 298 -- 315 . Springer , 2011 . P. Suter, A. S. K\u00f6ksal, and V. Kuncak. Satisfiability modulo recursive programs. In SAS'11, volume 6887 of LNCS, pages 298--315. Springer, 2011."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_36"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806610"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375624"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542514"}],"event":{"name":"PLDI '13: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Seattle Washington USA","acronym":"PLDI '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491956.2462169","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2491956.2462169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:41Z","timestamp":1750217321000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491956.2462169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":44,"alternative-id":["10.1145\/2491956.2462169","10.1145\/2491956"],"URL":"https:\/\/doi.org\/10.1145\/2491956.2462169","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2499370.2462169","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}