Published October 6, 1993
| Submitted
Technical Report
Open
Semantics of Exceptions
Chicago
An error occurred while generating the citation.
Abstract
We describe a trace semantics of exceptions and then derive a weakest precondition semantics. A program that contains exceptions terminates in one of two possible ways (if it terminates at all): either it terminates exceptionally or it terminates normally. We will therefore consider weakest preconditions that are functions of two postconditions. As a preparation we study aribitrary functions of two arguments, and their compositions.
Additional Information
© 1993 California Institute of Technology. We gratefully acknowledge the contributions made by Robert Harley and Peter Hofstee during various discussions. Also the feedback from Greg Nelson and from other members of IFIP WG 2.3 is greatly appreciated. Although we had not actually seen the paper we were well aware of the semantics for exceptions given in [5], which is identical to the axiomatic semantics given in the present paper. Our trace semantics serves as a foundation thereof. Another early reference to semantics of exception handling is. This reference provides a good discussion of how exception handling can simplify the structure of certain programs. It describes the semantics of exceptions by giving a predicate transformer for normal termination and a separate predicate transformer for exceptional termination. We use one function that maps a pair into a single predicate.Attached Files
Submitted - 93-34.pdf
Files
93-34.pdf
Files
(480.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:3464065b74703d7f2e7a0e242bcb624c
|
480.2 kB | Preview Download |
Additional details
- Eprint ID
- 26774
- Resolver ID
- CaltechCSTR:1993.cs-tr-93-34
- Created
-
2001-04-25Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Reports
- Series Volume or Issue Number
- 1993.34