University of Cambridge > > Logic and Semantics Seminar (Computer Laboratory) > A language extension for provably safe exception handling

A language extension for provably safe exception handling

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Parkinson.

Most modern programming languages include an exception throwing construct for safely and easily dealing with unlikely conditions. However, they typically also include constructs for catching exceptions. This creates a safety risk. Furthermore, in a multithreaded program, even in the absence of catch constructs, an exception typically terminates the thread but not the entire program. As a result, writing provably safe programs is difficult. We propose a new language construct, called subsystems, to facilitate writing provably safe programs, and proof rules for this construct that enable proving safety properties in the presence of synchronous and asynchronous exceptions.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity