{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:54Z","timestamp":1772164014647,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T00:00:00Z","timestamp":1327449600000},"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":[[2012,1,25]]},"DOI":"10.1145\/2103656.2103673","type":"proceedings-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T11:47:19Z","timestamp":1327405639000},"page":"123-136","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Recursive proofs for inductive tree data-structures"],"prefix":"10.1145","author":[{"given":"Parthasarathy","family":"Madhusudan","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaokang","family":"Qiu","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Stefanescu","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_12"},{"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\/978-3-642-02658-4_13"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04081-8_13"},{"key":"e_1_3_2_2_7_1","volume-title":"The Calculus of Computation","author":"Bradley A. R.","year":"2007","unstructured":"A. R. Bradley and Z. Manna . The Calculus of Computation . Springer , 2007 . A. R. Bradley and Z. Manna. The Calculus of Computation. Springer, 2007."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2010.07.004"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993526"},{"key":"e_1_3_2_2_10_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press , third edition, 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, third edition, 2009."},{"key":"e_1_3_2_2_11_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_12_1","unstructured":"INRIA. The coq proof assistant. URL http:\/\/coq.inria.fr\/.  INRIA. The coq proof assistant. URL http:\/\/coq.inria.fr\/."},{"key":"e_1_3_2_2_13_1","series-title":"LNCS","first-page":"34","volume-title":"CSL'10","author":"Kuncak V.","year":"2010","unstructured":"V. Kuncak , R. Piskac , and P. Suter . Ordered sets in the calculus of data structures . In CSL'10 , volume 6247 of LNCS , pages 34 -- 48 . Springer , 2010 . V. Kuncak, R. Piskac, and P. Suter. Ordered sets in the calculus of data structures. In CSL'10, volume 6247 of LNCS, pages 34--48. Springer, 2010."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328461"},{"key":"e_1_3_2_2_15_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_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926455"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_41"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/567067.567073"},{"key":"e_1_3_2_2_19_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_20_1","series-title":"LNCS","first-page":"106","volume-title":"VMCAI'07","author":"Rakamaric Z.","year":"2007","unstructured":"Z. Rakamaric , 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. Rakamaric, 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_21_1","series-title":"LNCS","first-page":"237","volume-title":"ATVA'07","author":"Rakamaric Z.","year":"2007","unstructured":"Z. Rakamaric , 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. Rakamaric, 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_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2006.7"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_2_24_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_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706325"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375624"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542514"}],"event":{"name":"POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Philadelphia PA USA","acronym":"POPL '12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103656.2103673","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103656.2103673","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:06:21Z","timestamp":1750226781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103656.2103673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,25]]},"references-count":27,"alternative-id":["10.1145\/2103656.2103673","10.1145\/2103656"],"URL":"https:\/\/doi.org\/10.1145\/2103656.2103673","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2103621.2103673","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,1,25]]},"assertion":[{"value":"2012-01-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}