The University of Southampton
University of Southampton Institutional Repository

Logic, dependencies and specification engineering

Logic, dependencies and specification engineering
Logic, dependencies and specification engineering

In chapter one we begin with a historical summary of the iterative programming paradigm. This leads on to a discussion of the properties of notations; we evaluate predicate calculus for each given property. Four classifications of program synthesis techniques are briefly discussed. The closing sections describe three classifications of current specification languages. Chapter two describes a new perspective on what it is to prove theorems. For propositional calculus we describe an encoding for a particular form of resolution proof space that can be used to determine the existence or not of a proof in that space. In chapter three we present a specification notation and synthesis algorithm for a rudimentary equational theory of four computable functions over one dimensional vectors. The specifications are expressed in the form of preconditions and postconditions, and the synthesis algorithm attempts to formulate an algorithm for them that both utilises parallelism and satisfies total correctness. In chapter four we present a transformational synthesis algorithm for a class of specifications expressed in first-order logic for specification of functions where the output is defined only in terms of the inputs. We also present a specification refinement methodology that can be used to refine a specification into a form suitable for synthesis. An inherent weakness of the standard verification techniques is discussed in the context of verifying programs that are classified as `safety-critical'.

University of Southampton
Farrow, Paul Frederick
Farrow, Paul Frederick

Farrow, Paul Frederick (1988) Logic, dependencies and specification engineering. University of Southampton, Doctoral Thesis.

Record type: Thesis (Doctoral)

Abstract

In chapter one we begin with a historical summary of the iterative programming paradigm. This leads on to a discussion of the properties of notations; we evaluate predicate calculus for each given property. Four classifications of program synthesis techniques are briefly discussed. The closing sections describe three classifications of current specification languages. Chapter two describes a new perspective on what it is to prove theorems. For propositional calculus we describe an encoding for a particular form of resolution proof space that can be used to determine the existence or not of a proof in that space. In chapter three we present a specification notation and synthesis algorithm for a rudimentary equational theory of four computable functions over one dimensional vectors. The specifications are expressed in the form of preconditions and postconditions, and the synthesis algorithm attempts to formulate an algorithm for them that both utilises parallelism and satisfies total correctness. In chapter four we present a transformational synthesis algorithm for a class of specifications expressed in first-order logic for specification of functions where the output is defined only in terms of the inputs. We also present a specification refinement methodology that can be used to refine a specification into a form suitable for synthesis. An inherent weakness of the standard verification techniques is discussed in the context of verifying programs that are classified as `safety-critical'.

This record has no associated files available for download.

More information

Published date: 1988

Identifiers

Local EPrints ID: 461198
URI: http://eprints.soton.ac.uk/id/eprint/461198
PURE UUID: 00b60184-432d-4832-a498-a6cc91d4f159

Catalogue record

Date deposited: 04 Jul 2022 18:38
Last modified: 04 Jul 2022 18:38

Export record

Contributors

Author: Paul Frederick Farrow

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×