Fixpoint Approach to the Theory of Computation

Abstract

Following the fixpoint theory of Scott, the authors 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1972
Accession Number
AD0742748

Entities

People

  • Jean Vuillemin
  • Zohar Manna

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Artificial Intelligence
  • Computational Science
  • Computations
  • Computer Languages
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Information Processing
  • Language
  • Mathematics
  • Programming Languages
  • Semantics
  • Theory Of Computation
  • Universities

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.