BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-71-189
       ENTRY:: November 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Mathematical theory of partial correctness
        TYPE:: Technical Report
      AUTHOR:: Manna, Zohar
        DATE:: January 1971
       PAGES:: 30
    ABSTRACT:: In this work we show 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 since 'partial
               correctness' has already been formulated in predicate
               calculus and in partial function logic for many classes of
               algorithms.
       NOTES:: [Adminitrivia V1/Prg/19951101]
         END:: STAN//CS-TR-71-189