Showing papers by "D. K. Arvind published in 1994"
06 Sep 1994
TL;DR: This work investigates a “proofs-to-programs” approach, where specifications which are written in a particular specification language L S (Σ) are shown to be consistent by using a logical calculus associated with the language.
Abstract: The emergence of massively parallel computers poses new challenges for programming them. The purpose of this work is to explore and develop methods for formally infusing concurrency and communication into programs. We investigate a “proofs-to-programs” approach, where specifications which are written in a particular specification language L S (Σ) are shown to be consistent by using a logical calculus associated with the language. An examination of the structure of the resulting proof tree yields a program in an implementation language L I (Σ). Various parallel implementations of the programs are studied by examining their dependence graph, and an asynchronous operational semantics is presented.