ACM Home Page
Please provide us with feedback. Feedback
The Geneva convention on the treatment of object aliasing
Full text PdfPdf (502 KB)
Source ACM SIGPLAN OOPS Messenger archive
Volume 3 ,  Issue 2  (April 1992) table of contents
Pages: 11 - 16  
Year of Publication: 1992
ISSN:1055-6400
Authors
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 30,   Citation Count: 29
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/130943.130947
What is a DOI?

ABSTRACT

Aliasing has been a problem in both formal verification and practical programming for a number of years. To the formalist, it can be annoyingly difficult to prove the simple Hoare formula {x = true} y := false {x = true}. If x and y refer to the same boolean variable, i.e., x and y are aliased, then the formula will not be valid, and proving that aliasing cannot occur is not always straightforward. To the practicing programmer, aliases can result in mysterious bugs as variables change their values seemingly on their own. A classic example is the matrix multiply routine mult(left, right, result) which puts the product of its first two parameters into the third. This works perfectly well until the day some unsuspecting programmer writes the very reasonable statement mult(a, b, a). If the implementor of the routine did not consider the possibility that an argument may be aliased with the result, disaster is inevitable.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[AdB90] Pierre America and Frank de Boer. A sound and complete proof system for SPOOL. Technical Report 505, Philips Research Laboratories, May 1990.
2
 
3
[Coo78] Stephen A. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal of Computing, 7(1):70-90, February 1978.
 
4
[HMRC88] Richard C. Holt, Philip A. Matthews, J. Alan Rosselet, and James R. Cordy. The Turing Language: Design and Definition. Prentice-Hall, 1988.
5
 
6
7
8
 
9
 
10
11
 
12

CITED BY  29

Collaborative Colleagues:
John Hogg: colleagues
Doug Lea: colleagues
Alan Wills: colleagues
Dennis deChampeaux: colleagues
Richard Holt: colleagues