An exception compilation scheme that dynamically creates and removes exception handler entries on the stack. A formalization of an article of the same name by Hutton and Wright [1]. 1 Compiling exception handling theory Exceptions imports Main begin 1.1 The source language datatype expr = Val int | Add expr expr | Throw | Catch expr expr consts eval :: "expr ⇒ int option" primrec "eval (Val i) ...

Using a language without exception handling is like driving a car with no brakes and no seatbelt | things work ne until something goes wrong. You also learn to drive rather carefully. This paper describes an exception handling extension to the Haskell lazy functional language. The implementation turned out to be very easy but we had problems nding a viable semantics for our system. The resultin...

Counterexample-guided abstraction refinement (CEGAR) was successfully applied to verify sequential programs. We give a CEGAR scheme for verifying concurrent programs with threads.

As the Director of a Child Advocacy Center that evaluated over 1500 children in 2002 for allegations of child abuse or neglect, I have seen many cases enter the Child Protection system. Of these, only a small percentage was ever accepted for criminal prosecution. Those deemed acceptable differ in two major respects from the vast majority of other cases in which allegations of abuse or neglect a...

Abstract. The exceptions form a computational effect, in the sense that there is an apparent mismatch between the syntax of exceptions and their intended semantics. We solve this apparent contradiction by defining a logic for exceptions with a proof system which is close to their syntax and where their intended semantics can be seen as a model. This requires a robust framework for logics and th...