Formal Program Development with Approximations

Boiten, E.A. and Derrick, J. (2005) Formal Program Development with Approximations. In: UNSPECIFIED. (Full text available)

PDF
Download (203kB)
[img]
Preview

Abstract

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 (UNSPECIFIED)
Uncontrolled keywords: refinement, approximations, metric spaces
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:03
Last Modified: 12 Jun 2012 13:01
Resource URI: http://kar.kent.ac.uk/id/eprint/14341 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year