THE UNDECIDABILITY OF THE EQUIVALENCE PROBLEM FOR PROGRAM SCHEMATA.

Abstract

This paper was concerned with the equivalence problem for program schemata, i.e., for programs written in a certain formal language. This language is designed to express certain general aspects of computer programs; in particular the dependence between computational blocks, branching, and storage allocation. It was shown that the equivalence problem for program schemata is undecidable. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 15, 1964
Accession Number
AD0607726

Entities

People

  • David Luckham
  • David Park

Organizations

  • BBN Technologies

Tags

DTIC Thesaurus Topics

  • Computer Programs
  • Formal Languages
  • Language

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Parallel and Distributed Computing.