Browse by author
Lookup NU author(s): Emeritus Professor Tom Anderson
Full text is not currently available for this publication.
Two approaches are considered for simplifying the proof of a program, namely incorporating redundancy to assist in the proof, and employing a weaker specification than that originally intended. The proof should then ensure the adequacy (rather than the full correctness) of the program. Safeness, a special case of adequacy, is described and exemplified. Consideration is given to extending the concept of a safe program module to enable the inclusion of code for error recovery purposes.
Author(s): Anderson T
Publication type: Report
Publication status: Published
Series Title: Computing Laboratory Technical Report Series
Print publication date: 01/02/1975
Source Publication Date: February 1975
Report Number: 70
Institution: Computing Laboratory, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne