Mathematical Theory of Partial Correctness,

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)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1971
Accession Number
AD0717601

Entities

People

  • Zohar Manna

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Calculus
  • Mathematics

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.