FORMALIZATION OF PROPERTIES OF PARALLEL PROGRAMS,

Abstract

The paper describes a class of parallel programs and gives a formalization of certain properties of such programs in predicate calculus. Although the programs are syntactically simple, they do exhibit interaction between asynchronous parallel processes, which is the essential feature to be considered. The formalization can easily be extended to more complicated programs. Also presented is a method of simplifying parallel programs, i.e., constructing simpler equivalent programs, based on the 'independence' of statements in them. With these simplifications the formalization gives a practical method for proving properties of such programs. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1970
Accession Number
AD0708740

Entities

People

  • Edward Ashcroft
  • Zohar Manna

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Applied Computer Science
  • Artificial Intelligence
  • Calculus

Fields of Study

  • Computer science
  • Physics

Readers

  • Computer Science.
  • Mathematical Modeling and Probability Theory.