Accession Number:

AD0785164

Title:

The Validity Problem of the 91-Function,

Descriptive Note:

Corporate Author:

STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1968-08-19

Pagination or Media Count:

22.0

Abstract:

Several methods for proving the weak and strong validity of algorithms are presented. For proving the weak validity i.e., correctness the authors use satisfiability methods, while for proving the strong validity i.e., termination and correctness the authors use unsatisfiability methods. Two types of algorithms are discussed recursively defined functions and programs. Among the methods included are known methods due to Floyd, Manna, and McCarthy. All the methods are introduced quite informally by means of an example the 91-function. Modified author abstract

Subject Categories:

  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE