Automatic program verification I: A logical basis and its implementation

Proceedings of the IDA Workshop on Formal Specification and Verification of Ada (Trade Name) (1st) Held in Alexandria, Virginia on 18-20 March 1985.

“…The inductive assertion technique, which has been used successfully as a basis for verifying programs written in Pascal and some of its derivatives [9,10,15,17,20, in directly applicable to a large part of Ada. However, Ads also includes a number of eonstructs whose verification is not as well understood as the verification cf constructs found in Pascal.…”

Automatic construction of verification condition generators from hoare logics

“…The only attempt at validating the view of a VCG as a proof constructor for an associated axiom system ks the work of Igarashi, London, and Luekham [6]. In their paper, they give an axiomatic definition of a small language and a n associated VCG.…”

Semantics and proof theory of pascal procedures

“…In the papers by COOK [4] and GORELICK [6], global variables are treated incorrectly (see a discussion of these issues in [5], p.41 and 139). HOARE [8], COOK [4], DONAHUE [5], and IGARASHI et al [10] impose restrictions on the actual parameters in procedure calls-in particular, their syntax does not allow Jensen's device. In DONAHUE [5] and IGARASHI et al [10], subscripted variables cannot be passed as actuals called-by-variable.…”

“…HOARE [8], COOK [4], DONAHUE [5], and IGARASHI et al [10] impose restrictions on the actual parameters in procedure calls-in particular, their syntax does not allow Jensen's device. In DONAHUE [5] and IGARASHI et al [10], subscripted variables cannot be passed as actuals called-by-variable. In HOARE [8], COOK [4] and GORELICK [6], only call-by-name is allowed.…”

“…al. [10], GORELICK [6] and DONAHUE [5]. As we understand it, they use Scott's rule only for actual parameters (which happen to be) identical to the corresponding formals and then apply some substitution process to deal with other actuals.…”