Completeness and complexity of reasoning about call-by-value in Hoare logic
FS de Boer, HDA Hiep - ACM Transactions on Programming Languages …, 2021 - dl.acm.org
ACM Transactions on Programming Languages and Systems (TOPLAS), 2021•dl.acm.org
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.
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.
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.
ACM Digital LibraryShowing the best result for this search. See all results