This note presents a calculational method for dealing with pointers in weakest\ud precondition semantics. It aims at facilitating the verification of program fragments that\ud use pointers, without recourse to operational reasoning.\ud It is true that the unrestricted use of pointers may be considered somewhat oldfashioned.\ud There is a growing consensus (to which the present author subscribes) that the\ud derivation of correct programs is much to be preferred over any a posteriori verification.\ud Types such as lists and trees have mathematical properties that are simpler than those of\ud pointers, hence are more useful in program derivation. Recent publications concerning\ud pointers typically propose schemes for their abolition [6, 7]. Nevertheless the study of\ud pointers retains some importance, because the more abstract types are usually implemented by\ud means of pointers and one wishes to prove the correctness of such an implementation.\ud Moreover, there exist algorithms that exploit the aliasing effect provided by pointers for\ud efficiency reasons 
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.