A Caltech Library Service

Semantics of Exceptions

Leino, K. Rustan M. and Van de Snepscheut, Jan L. A. (1993) Semantics of Exceptions. California Institute of Technology . (Unpublished)

Postscript - Accepted Version
See Usage Policy.

PDF - Accepted Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Report or Paper (Technical Report)
Group:Computer Science Technical Reports
Other Numbering System:
Other Numbering System NameOther Numbering System ID
Computer Science Technical Reports93-34
Record Number:CaltechCSTR:1993.cs-tr-93-34
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26774
Deposited By: Imported from CaltechCSTR
Deposited On:25 Apr 2001
Last Modified:18 Feb 2015 19:24

Repository Staff Only: item control page