Reasoning about call-by-value: a missing result in the history of Hoare's logic

09/13/2019
by   Krzysztof R. Apt, et al.
0

We provide a sound and relatively complete Hoare-like proof system 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 are linear in the length of the program. We argue that in spite of the fact that Hoare-like proof systems for recursive procedures were intensively studied, no such proof system has been proposed in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/16/2019

On correctness of an n queens program

Thom Frühwirth presented a short, elegant and efficient Prolog program f...
research
12/23/2019

Complexity of correctness for pomset logic proof nets

We show that it is coNP-complete to decide whether a given proof structu...
research
01/07/2020

Understanding the QuickXPlain Algorithm: Simple Explanation and Formal Proof

In his seminal paper of 2004, Ulrich Junker proposed the QuickXPlain alg...
research
04/28/2022

Generic Dijkstra: correctness and tractability

The recently-proposed generic Dijkstra algorithm finds shortest paths in...
research
09/13/2018

A Simple Functional Presentation and an Inductive Correctness Proof of the Horn Algorithm

We present a recursive formulation of the Horn algorithm for deciding th...
research
09/04/2019

(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic

Reachability Logic is a formalism that can be used, among others, for ex...
research
06/10/2021

Hybrid Systems Verification with Isabelle/HOL: Simpler Syntax, Better Models, Faster Proofs

We extend a semantic verification framework for hybrid systems with the ...

Please sign up or login with your details

Forgot password? Click here to reset