Towards the synthesis of asynchronous concurrent programs
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.
Unable to display preview. Download preview PDF.
- 1.R J R Back, “A Method for Refining Atomicity in Parallel Algorithms”, in E Odijk, M Rem and J C Syre (eds), PARLE'89 — Volume 2: Parallel Languages, Lecture Notes in Computer Science 366, Springer-Verlag, Berlin, (1989).Google Scholar
- 2.M D Cripps, J Darlington, A J Field, P G Harrison and M J Reeve, “The Design and Implementation of ALICE: A Parallel Graph Reduction Machine”, in Proceedings of the Workshop on Graph Reduction, Springer Verlag, Berlin, (1987).Google Scholar
- 3.G Gentzen, “Investigations into Logcial Deduction”, in M E Szabo (ed.), The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam, (1969).Google Scholar
- 4.J Goguen, S Leinwand, J Meseguer and T Winkler, “The Rewrite Rule Machine, 1988”, Technical Monograph PRG-76, Oxford University Computing Laborotory, Programming Research Group, (1989).Google Scholar
- 5.C Lengauer, “Loop Parallelization in the Polytope Model”, in Eike Best (ed.), CONCUR '93, LNCS 715, Springer-Verlag, (1993).Google Scholar
- 6.A J R G Milner, Communication and Concurrency, Prentice Hall International, (1989).Google Scholar
- 7.B C Thompson and J V Tucker, “Equational Specification of Synchronous Concurrent Algorithms and Architectures”, H Scwhichtenberg (ed.), Proof and Computation, Springer-Verlag, Berlin, (1993).Google Scholar
- 8.J V Tucker and J I Zucker, “Provable Computable Selection Functions on Abstract Structures”, in P Aczell, H Simmons and S S Wainer (eds) Proof Theory, Cambridge University Press, (1993).Google Scholar