### Table 12. Hoare Logic

2001

"... In PAGE 16: ... The partial correctness assertion P{s}R requires that if P holds and the sub- sequent execution of the statement s terminates, then R holds. A general rule, applicable to all statements, is included in Table12 to allow strengthening of pre-conditions and weakening of post-conditions. Table 12.... ..."

Cited by 1

### Table 2: Quantified Hoare Logic: Syntax.

1995

Cited by 4

### Table 4. A deductive system for Hoare logic

### Table 5. A deductive system for Hoare logic with partial functions

"... In PAGE 28: ...emma 5.14. For all S1; S2 2 L( ) 1 wlp(xi := t; ?) = [[t#]] ! wtp(xi := t; ?); 2 wlp(S1; S2; ?) = wlp(S1; wlp(S2; ?)); 3 wlp(if b then S1 else S2 ; ?) = [[b = t]] ! wlp(S1; ?) ^ [[b = f]] ! wlp(S2; ?) We now can give a deductive system for the Hoare logic with partial terms. It is listed in Table5 (c.... In PAGE 28: ...15. The deductive system in Table5 is sound. 6.... ..."

### Table 5. Floyd/Hoare Partial Correctness Formulae Semantics

1994

Cited by 23

### Table 5. Floyd/Hoare Partial Correctness Formulae Semantics

1994

Cited by 23

### Table 5: Floyd/Hoare Partial Correctness Semantics

2003

Cited by 2