Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions

Ten Years of Hoare's Logic: A Survey—Part I

“…The problem of finding a natural Hoare's proof system for this class of programs is offered in [36] as a challenge to researchers in this area. It should be noted that the characterization theorem does not apply here, since not all programs in this class are ~so-bounded.…”

“…It should be noted that the characterization theorem does not apply here, since not all programs in this class are ~so-bounded. An example of such a program that is not ~so-bounded is given in [36,45]. There is as yet no proof system available in which the partial correctness of this program can be studied.…”

“…The discussion of sharing in Section 7.7 is due to a private communication from Langmaack and Olderog. In (36] they give an overview of the results discussed in this section. …”

Verification of object-oriented programs: A transformational approach

“…Ever since its introduction in [14] the assertional method has been one of the main approaches to program verification. Initially proposed for the modest class of while programs, it has been extended to several more realistic classes of programs, including recursive programs (starting with [15]), programs with nested procedure declarations (see [19]), parallel programs (starting with [23] and [24]), and distributed programs based on synchronous communication (see [4]). At the same time research on the theoretical underpinnings of the proposed proof systems resulted in the introduction in [10] of the notion of relative completeness and in the identification of the inherent incompleteness for a comprehensive ALGOL-like programming language (see [9]).…”

Turing und die Verifikation

“…Die Grenzen dieser Methode wurden erstmalig von Clarke anhand einer Programmiersprache mit einem reichhaltigen, ALGOL-artigen Prozedurkonzept aufgezeigt [16]. Weitere Untersuchungen dazu finden sich in [23,48,63,64].…”