Abstract. This paper discusses refinement of programs that may raise and catch exceptions. We show that exceptions are expressed by a class of predicate trans-formers built on Arieli and Avron’s four-valued logic and develop a refinement framework for the four-valued predicate transformers. The resulting framework enjoys several refinement laws that are useful for stepwise refinement of programs involving exception handling and partial predicates. We demonstrate some typi-cal usages of the refinement laws in the proposed framework by a few examples of program transformation.
The exception monad, while an adequate mechanism for providing the denotational semantics of excepti...
In this paper, we facilitate the reasoning about impure programming languages, by annotating terms w...
The thesis deals with correctness of a compiler of a simple language featuring exceptions. We presen...
In this paper we discuss the refinement of exceptions. We extend the Guarded Command Language normal...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
Formal specification techniques allow expressing idealized specifications, which abstract from restr...
Reasoning about programs that use effects can be much harder than reasoning about their pure counter...
Formal specification techniques allow expressing idealized specifications, which abstract from re-st...
[[abstract]]This paper presents a disciplined exception mechanism based on continuations. Continuati...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
In this Version 2, minor improvements are made to Version 1.An algebraic method is used to study the...
A refinement is a predicate on the elements of a type that describes their execution behavior. Much ...
We formally prove the stackability and linearity of exception handlers of ML-style semantics using a...
Language designers and implementors have avoided specifying and preserving the meaning of programs t...
The invariant based programming is a technique of constructing correct programs by first identifying...
The exception monad, while an adequate mechanism for providing the denotational semantics of excepti...
In this paper, we facilitate the reasoning about impure programming languages, by annotating terms w...
The thesis deals with correctness of a compiler of a simple language featuring exceptions. We presen...
In this paper we discuss the refinement of exceptions. We extend the Guarded Command Language normal...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
Formal specification techniques allow expressing idealized specifications, which abstract from restr...
Reasoning about programs that use effects can be much harder than reasoning about their pure counter...
Formal specification techniques allow expressing idealized specifications, which abstract from re-st...
[[abstract]]This paper presents a disciplined exception mechanism based on continuations. Continuati...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
In this Version 2, minor improvements are made to Version 1.An algebraic method is used to study the...
A refinement is a predicate on the elements of a type that describes their execution behavior. Much ...
We formally prove the stackability and linearity of exception handlers of ML-style semantics using a...
Language designers and implementors have avoided specifying and preserving the meaning of programs t...
The invariant based programming is a technique of constructing correct programs by first identifying...
The exception monad, while an adequate mechanism for providing the denotational semantics of excepti...
In this paper, we facilitate the reasoning about impure programming languages, by annotating terms w...
The thesis deals with correctness of a compiler of a simple language featuring exceptions. We presen...