Constraints: A Uniform Approach to Aliasing and Typing (1984)
Cached
Download Links
- [www.research.digital.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, ACM SIGACT-SIGPLAN |
| Citations: | 14 - 6 self |
BibTeX
@INPROCEEDINGS{Lamport84constraints:a,
author = {Leslie Lamport and Fred B. Schneider},
title = {Constraints: A Uniform Approach to Aliasing and Typing},
booktitle = {In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, ACM SIGACT-SIGPLAN},
year = {1984},
pages = {205--216},
publisher = {ACM}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A constraint is a relation among program variables that is maintained throughout execution. Type declarations and a very general form of aliasing can be expressed as constraints. A proof system based upon the interpretation of Hoare triples as temporal logic formulas is given for reasoning about programs with constraints. The proof system is shown to be sound and relatively complete, and example program proofs are given. 1 Introduction Type declarations and aliasing relations have traditionally been thought of as unrelated concepts. However, both can be viewed as specifying properties that do not change during program execution. This view leads to a uniform method for reasoning about types and aliasing in which the usual Hoare logic triples are regarded as temporal logic formulas. Aliasing two variables x and y means they always have the same value. This is usually implemented by allocating the same memory location to x # Work supported in part by the National Science Foundation unde...
