BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-72-272
       ENTRY:: October 16, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Fixpoint approach to the theory of computation.
        TYPE:: Technical Report
      AUTHOR:: Manna, Zohar
      AUTHOR:: Vuillemin, Jean
        DATE:: March 1972
       PAGES:: 31
    ABSTRACT:: Following the fixpoint theory of Scott, we propose to define
               the semantics of computer programs in terms of the least
               fixpoints of recursive programs. This allows one not only to
               justify all existing verification techniques, but also to
               extend them to handle various properties of computer
               programs, including correctness, termination and equivalence,
               in a uniform manner.
       NOTES:: [Adminitrivia V1/Prg/19951016]
         END:: STAN//CS-TR-72-272