Auxiliary variables are essential for specifying programs in Hoare Logic. They are required
to relate the value of variables in different states. However, the axioms and rules of Hoare …

We present a (the first?) sou nd and relatively complete Hoare logic for a simple imperative
programming language including mutually recursive procedures with call-by-value …

The use of verifiers for proving the correctness of concrete programs is well known and has
been amply described in the literature. Here we focus on further, perhaps more general …

Although most typically used in other contexts, program transformations can simplify
program verification by transforming a program containing complex language features into a …

Post systems are important in the study of programming languages. They are used in
axiomatic and natural semantics to formalize the meaning of programming languages. They …

Investigating soundness and completeness of verification calculi for imperative
programming languages is a challenging task. Incorrect results have been published in the …