{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:49:57Z","timestamp":1772729397679,"version":"3.50.1"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T00:00:00Z","timestamp":1635638400000},"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":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2021,12,31]]},"abstract":"<jats:p>We provide a sound and relatively complete Hoare logic for reasoning about partial correctness of recursive procedures in presence of local variables and the call-by-value parameter mechanism and in which the correctness proofs support contracts and are linear in the length of the program. We argue that in spite of the fact that Hoare logics for recursive procedures were intensively studied, no such logic has been proposed in the literature.<\/jats:p>","DOI":"10.1145\/3477143","type":"journal-article","created":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:41:27Z","timestamp":1635727287000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic"],"prefix":"10.1145","volume":"43","author":[{"given":"Frank S.","family":"de Boer","sequence":"first","affiliation":[{"name":"University of Leiden, Amsterdam, The Netherlands and CWI, Leiden, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9677-6644","authenticated-orcid":false,"given":"Hans-Dieter A.","family":"Hiep","sequence":"additional","affiliation":[{"name":"University of Leiden, Amsterdam, The Netherlands and CWI, Leiden, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,10,31]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49812-6"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90037-I"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/357146.357150"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/1642724"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.08.002"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-019-00501-3"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/2932433.2932497"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264535"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/2584504"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/322108.322121"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/0207005"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/0210045"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264295"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09526-8_1"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.5555\/539769"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-017-9426-4"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.04.004"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/14.4.391"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90040-0"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25979-4_15"},{"key":"e_1_3_2_23_2","volume-title":"Completeness and Complexity of Reasoning about Call-by-value in Hoare Logic (Proof Files)","author":"Hiep Hans-Dieter A.","year":"2020","unstructured":"Hans-Dieter A. Hiep. 2020. Completeness and Complexity of Reasoning about Call-by-value in Hoare Logic (Proof Files). Zenodo. DOI:https:\/\/doi.org\/10.5281\/zenodo.4005508"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0059696"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/2.161279"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63046-5_24"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.5555\/647852.737558"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3211968"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90066-5"},{"key":"e_1_3_2_32_2","volume-title":"Programming Language Foundations","author":"Pierce Benjamin C.","year":"2020","unstructured":"Benjamin C. Pierce, Arthur Azevedo de Amorim, Chris Casinghino, Marco Gaboardi, Michael Greenberg, C\u01cet\u01celin Hri\u0163cu, Vilhelm Sj\u00f6berg, Andrew Tolmach, and Brent Yorgey. 2020. Programming Language Foundations. Electronic textbook. Version 5.8. Available at https:\/\/softwarefoundations.cis.upenn.edu."},{"key":"e_1_3_2_33_2","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"Terese, Marc Bezem, Jan Willem Klop, Roel de Vrijer, et al. 2003. Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, Vol. 55. Cambridge University Press."},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu145"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.5555\/646837.708364"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45614-7_6"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477143","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:49:03Z","timestamp":1750193343000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,31]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12,31]]}},"alternative-id":["10.1145\/3477143"],"URL":"https:\/\/doi.org\/10.1145\/3477143","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,31]]},"assertion":[{"value":"2019-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}