|
ABSTRACT
This paper presents a simple programming logic LES, which is particularly well suited for reasoning about so-called expression languages, i.e. languages that incorporate imperative features into expressions rather than distinguishing between expressions and statements. An axiomatization of a simple programming language is presented using this formalism. It is shown that this axiomatization is relatively complete, roughly in the sense of [Coo 76].
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
|
|
 |
2
|
|
| |
3
|
{Coo 76} Cook, Stephen A., "Soundness and Completeness of an Axiom System for Program Verification", Department of Computer Science, University of Toronto, Technical Report No. 95, June 1976.
|
| |
4
|
|
 |
5
|
|
| |
6
|
|
 |
7
|
|
| |
8
|
{Kow 77} Kowaltowski, Tomasz, "Axiomatic Approach to Side Effects and General Jumps", Acta Informatica 7, pp. 357--360, 1977.
|
| |
9
|
{Pri 77} Pritchard, Paul, "Program Proving --- Expression Languages", Information Processing 77, North Holland, 1977, pp. 727--731.
|
| |
10
|
{Schw 78} Schwartz, Richard L., "An Axiomatic Treatment of Asynchromous Processes in ALGOL 68", preliminary draft. More detail can be found in: Schwartz, Richard L. "An Axiomatic Semantic Definition of ALGOL 68", Computer Science Department, UCLA --- 34P214-75, University of California, Los Angeles, July 1978.
|
|