| Axiomatic definitions of programming languages, II |
| Full text |
Pdf
(654 KB)
|
| Source
|
Annual Symposium on Principles of Programming Languages
archive
Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
table of contents
Williamsburg, Virginia
Pages: 139 - 148
Year of Publication: 1981
ISBN:0-89791-029-X
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 1
|
|
|
ABSTRACT
Sufficient conditions are given for partial correctness assertions to determine the input-output semantics of quite general classes of programming languages. This determination cannot be unique unless states which are indistinguishable by predicates in the assertions are identified. Even when indistinguishable states are identified, partial correctness assertions may not suffice to determine program semantics.
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
|
{A} Apt, K. R. Ten Years of Hoare's Logic, A survey, Part I, 5thScandinavian Logic Symposium, Jan. 1979, Aalborg, Denmark; revised manuscript September, 1979, 49pp.
|
| |
2
|
{BTT} Bergstra, J. A., J. Tiuryn, and J. V. Tucker. Correctness Theories and Program Equivalence, Preprint, Stichting Mathematisch Centrum, Amsterdam, 1979.
|
| |
3
|
{C} Cook, S. A. Soundness and Completeness of an axiom system for program verification, SIAM J. Computing, 7,1(1978), 70-90.
|
 |
4
|
|
 |
5
|
D. Harel , A. R. Meyer , V. R. Pratt, Computability and completeness in logics of programs (Preliminary Report), Proceedings of the ninth annual ACM symposium on Theory of computing, p.261-268, May 04-04, 1977, Boulder, Colorado, United States
[doi> 10.1145/800105.803416]
|
 |
6
|
|
 |
7
|
|
|