Abstract:
For reasoning about total correctness of while-programs, the rules proposed by Hoare [10] have stood the test of time. But for procedure calls, a number of dierent rules have appeared (e.g, [11,9,2,1,5,12]). There appears to be no consensus on the \right " rule, and some proposals even turn out to be
Citations
|
952
|
An Axiomatic Basis for Computer Programming
– Hoare
- 1969
|
|
54
|
Procedures and Parameters: an axiomatic approach
– Hoare
- 1971
|
|
52
|
Ten years of Hoare's logic, a survey, part I
– Apt
- 1981
|
|
35
|
Assignment and procedure call proof rules
– Gales, Levin
- 1980
|
|
23
|
Refinement Calculus: A Systematic Introduction. Graduate Texts in Computer Science
– Back, Wright
- 1998
|
|
17
|
Hoare logic and auxiliary variables
– Kleymann
- 1998
|
|
16
|
An algebraic construction of predicate transformers. Science of Computer Programming
– Gardiner, Martin, et al.
- 1994
|
|
13
|
A sharp proof rule for procedures in wp semantics
– Bijlsma, Matthews, et al.
- 1989
|
|
12
|
Proving total correctness of recursive procedures. Information and Computation
– America, Boer
- 1990
|
|
10
|
The cuppest capjunctive capping, and Galois
– Morgan
- 1994
|
|
10
|
A categorical model for higher order imperative programming
– Naumann
- 1998
|
|
9
|
Programming from Speci second edition
– Morgan
- 1994
|
|
6
|
Algebraic proofs of consistency and completeness
– Gardiner
- 1995
|
|
4
|
Calculating with procedure calls
– Bijlsma
- 1998
|
|
1
|
Triggered by Wim Feijen's treatment of \98 ! 89". Manuscript EWD1201
– Dijkstra
- 1995
|
|
1
|
Positively capjunctive cappings, and Galois. Typescript KRML 87, Compaq Systems Research Center, available upon request from the author
– Leino
- 1998
|
