Formal Program Development with Approximations

Boiten, Eerke Albert and Derrick, John (2005) Formal Program Development with Approximations. In: ZB 2005, 13-15 April 2005, Guildford. (doi: (Full text available)

Download (272kB) Preview
Official URL


We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by resource bounds. Idealistic specifications are identified with the limits of sequences of more ''realistic'' specifications, and such sequences can then be refined in their entirety. Compromises amount to focusing the attention on a particular element of the sequence instead of the sequence as a whole. This method addresses the problem that initial formal specifications can be abstract or complete but rarely both. Various potential application areas are sketched, some illustrated with examples. Key research issues are found in identifying metric spaces and properties that make them usable for refinement using approximations.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: refinement, approximations, metric spaces
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: E.A. Boiten
Date Deposited: 24 Nov 2008 18:03 UTC
Last Modified: 05 Dec 2015 23:26 UTC
Resource URI: (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:
  • Depositors only (login required):


Downloads per month over past year