ACM Home Page
Please provide us with feedback. Feedback
Unrestricted procedure calls in Hoare's logic
Full text PdfPdf (977 KB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages table of contents
Tucson, Arizona
Pages: 131 - 140  
Year of Publication: 1978
Authors
Robert Cartwright  Cornell University, Ithaca, N.Y.
Derek Oppen  Stanford University, Stanford, Ca.
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 28,   Citation Count: 11
Additional Information:

abstract   references   cited by   collaborative colleagues  

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

ABSTRACT

This paper presents a new version of Hoare's logic including generalized procedure call and assignment rules which correctly handle aliased variables. Formal justifications are given for the new rules.


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
{Apt and DeBakker 77} Apt, K. R. and J. W. DeBakker. Semantics and Proof Theory of PASCAL Procedures, Tech. Rpt., Stichting Mathematisch Centrum, Amsterdam, }977.
 
2
{Cook 75} Cook, S. Axiomatic and Interpretive Semantics for an Algol Fragment, Tech. Rpt. 79, Dept. of Comp. Sci., Univ. of Toronto, Feb., 1975.
 
3
 
4
{Enderton 72} Enderton, H. A Mathematical Introduction to Logic, Academic Press, New York, 1972.
 
5
{Gorelick 75} Gorelick, G. A. A Complete Axiomatic System for Proving Assertions about Recursive and Non-recursive Programs, Tech. Rpt. 75, Dept. of Comp. Sci., Univ. of Toronto, Jan., 1975.
 
6
{Guttag 77} Guttag, J. V., J. J. Horning, and R. L. London. A Proof Rule for EUCLID Procedures, Tech. Rpt., Xerox PARC, Palo Alto, Ca., 1977.
 
7
{Igarashi, London, and Luckham 75} Automatic Program Verification I: A Logical Basis and Its Implementation, Acta Informatica 4 (1975), pp. 145-182.
8
 
9
{Hoare 71} Hoare, C. A. R. Procedures and Parameters: An Axiomatic Approach, Symp. on Semantics of Algorithmic Languages, E. Engler (ed.), Springer-Verlag, Berlin, 1971, pp. 102-116.
 
10
{Hoare and Wirth 73} Hoare, C. A. R. and N. Wirth. An Axiomatic Definition of the Programming Language PASCAL, Acta Informatica 1 (1971).
 
11
{London 77} London, R. L., et al. Proof Rules for the Programming Language EUCLID, Tech. Rpt., Xerox PARC, Palo Alto, Ca., 1977.
 
12
{Oppen 75} Oppen, D. C. On Logic and Program Verification, Tech. Rpt. 82, Dept. of Comp. Sci., Univ. of Toronto, 1975.

CITED BY  11
Collaborative Colleagues:
Robert Cartwright: colleagues
Derek Oppen: colleagues