Report Number: CS-TR-72-272
Institution: Stanford University, Department of Computer Science
Title: Fixpoint approach to the theory of computation.
Author: Manna, Z ohar
Author: Vuillemin, Jean
Date: March 1972
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.