Back to search

University of Southampton

Program refinement using a Universal Law : Language specification and prototype tool

Abstract

dc:description.abstract

<p>The refinement calculus introduced by Back [Bac78], Morgan [Mor88a], Morris [Mor87] and others, combines specifications and programs into a single language and allows the development of a program from its specification to proceed in a number of small steps. The subject of this thesis is the definition of a specification and programming language based on the refinement calculus. A prototype tool has been developed from a formal language definition and simple examples are used to evaluate the language and tool.</p><p>One difference from existing refinement systems is the use of a universal refinement law and a simple compiler-style tool, rather than many laws and interactive tools. Most of the benefits of the refinement calculus are maintained while the change of programming method is smaller than that required to use an interactive refinement system. The size of refinement steps can be varied and complex derivations of obvious developments avoided. Context is propagated automatically, allowing Back's generalisation of the familiar assignment statement to be used for specification.</p><p>The use of subtypes and dependent types is another feature distinguishing this work. Subtypes and dependent types are integrated smoothly into the programming language and are shown to provide an accurate model of the runtime constraints of a programming language.</p><p>Some have argued that formal methods are necessary to achieve safe programmable systems, but to date this has not been borne out by experience. However, achieving dependable software is expensive, suggesting that the use of formal methods should be directed towards reducing costs. This vision can be realised only by exploiting theories such as the refinement calculus pragmatically, aiming to enhance existing practices, with flexibility in matters such as the degree of rigour and the order of development steps. The work described in this thesis is intended to be a step in this direction.</p>

Degree

thesis:*
Name dc:type.qualificationname
Ph.D.
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
University of Southampton
Year dc:date.issued
2000

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Marsh, David William Roff

Rights

Language dc:language
English, eng

Chain of custody

source
Harvested from
University of Southampton
Base URL
eprints.soton.ac.uk/cgi/oai2
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Marsh, David William Roff. Program refinement using a Universal Law : Language specification and prototype tool. doctoral thesis, University of Southampton, 2000.