Work

Semantics of Exceptions

Year: 1993

Type: article

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.

Source: CaltechAUTHORS (California Institute of Technology)

DOI: 10.7907/z9kk98tt

Authors: Leino, K. Rustan M., Van de Snepscheut, Jan L. A.

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1783835563

FWCI: 1.505

Cites:

Cited by: 17

Related to: 10