The Derivation of Compositional Programs

Chandy, K. Mani and Kesselman, Carl (1992) The Derivation of Compositional Programs. Technical Report. California Institute of Technology. [CaltechCSTR:1992.cs-tr-92-18]

Full text available as:

	Postscript - Requires a viewer, such as GhostView
	Other (Adobe PDF (1.1MB))

Abstract

This paper proposes a parallel programming notation and a method of reasoning about programs with the following characteristics: (1) Parallel Composition The notation provides different forms of interfaces between processes; the more restrictive the interface, the simpler the proofs of process composition. A flexible interface is that of cooperating processes with a shared address space; proofs of programs that use this interface are based on non-interference [OG76] and temporal logic [Pnu81,CM88, Lam9l]. We also propose more restrictive interfaces and specifications that allow us to use the following specificattion rule: the strongest specification of a parallel composition of processes is the conjunction of the strongest specifications of its components. This rule is helpful in deriving parallel programs. (2) Determinism A process that does not use certain primitives of the notation is guaranteed to be deterministic. Programmers who wish to prove that their programs are deterministic are relieved of this proof obligation if they restrict their programs to a certain subset of the primitives.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	109
Deposited By:	Caltech Library System
Deposited On:	25 April 2001
Record Number:	CaltechCSTR:1992.cs-tr-92-18
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1992.cs-tr-92-18
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record