Accession Number : AD0717601

Title :   Mathematical Theory of Partial Correctness,

Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s) : Manna,Zohar

Report Date : JAN 1971

Pagination or Media Count : 25

Abstract : The work shows that it is possible to express most properties regularly observed in algorithms in terms of 'partial correctness' (i.e., the property that the final results of the algorithm, if any, satisfy some given input-output relation). This result is of special interest as 'partial correctness' has already been formulated in predicate calculus and in partial function logic for many classes of algorithms. (Author)

Descriptors :   (*MATHEMATICAL LOGIC, COMPUTER PROGRAMMING), FLOW CHARTING, ARTIFICIAL INTELLIGENCE, ALGORITHMS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE