Since they often embody compact but mathematically sophisticated algorithms, operations
for computing the common transcendental functions in floating point arithmetic seem good …

The verifying compiler (VC) project is a core component of the dependable systems
evolution grand challenge. The VC offers the promise of automatically proving that a …

A method of specifying the desired behaviour of a computer program, and of re ning such
speci cations into imperative programs is proposed. The re nement method has been …

The Verifying Compiler (VC) project is a core component of the Dependable Systems
Evolution Grand Challenge. The VC offers the promise of automatically proving that a …

The earlier errors are found, the less costly they are to fix. This also holds true of errors in
specifications. While research into Static Program Verification (SPV) in general, and …

We present a HOL formalization of the foundational parts of Dijkstra's classic monograph “A
Discipline of Programming≓. While embedding programming language semantics in …

We contrast using a notation extension with using a combination of notations. Specifically,
we compare the use of an extended dialect of Z [10] with a combination of Z and predicative …

Predicates are a popular tool for specification. Unfortunately, they are less well suited to
defining the semantics of programming languages. As as result, program refinement …

SINCE their first appearance in the 1970s, exception handling models in mainstream
programming languages, frameworks, and platforms have not changed much. Modern …

Formal specification is useful for designing provably correct models of distributed real-time
software systems. Such systems are difficult to design and verify for a variety of reasons …