Much current research in computer science is concerned with two questions: is a program
correct? And how can we improve a correct program preserving correctness? This latter …

The original LCF system was a proof-checking program developed at Stanford University by
Robin Milner in 1972. Descendents of LCF now form a thriving paradigm in computer …

The fact that Z is a specification language only, with no associated program development
method, is a widely recognised problem. As an answer to that, we present ZRC, a refinement …

We explore the features of a user interface where formal proofs can be built through gestural
actions. In particular, we show how proof construction steps can be associated to drag-and …

Morgan's refinement calculus is a successful technique for developing software in a precise
and consistent way. This technique, however, can be hard to use, as developments may be …

We describe a prototype tool for developing programs by stepwise refinement in a weakest
precondition framework, based on the HOL theorem proving system. Our work is based on a …

Circus specifications combine both data and behavioral aspects of concurrent systems using
a combination of CSP, Z, and Dijkstrapsilas command language. Its associated refinement …

The HOL system is a fully-expansive theorem prover: Proofs generated in the system are
composed of applications of the primitive inference rules of the underlying logic. This has …

The refinement calculus for the development of programs from specifications is well suited to
mechanised support. We review the requirements for tool support of refinement as gleaned …

Computer supported development of proofs requires user interaction even for theorems that
are simple by human standards. In this thesis we define a communication infrastructure as a …