Abstract
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs built from basic reactions and two composition operators, and applied it to the study of relationships between parallel and sequential program composition, and related program transformations. The main shortcoming of the “calculus of Gamma programs” is that the refinement and equivalence laws described are not compositional, so that a refinement of a sub-program does not necessarily imply a refinement of the program.
In this paper we address this problem by defining a compositional (denotational) semantics for Gamma, based on the transition trace method of Brookes, and by showing how this can be used to verify substitutive refinement laws, potentially widening the applicability and scalability of program transformations previously described.
The compositional semantics is also useful in the study of relationships between alternative combining forms at a deeper semantic level. We consider the semantics and properties of a number of new combining forms for the Gamma model.
Research supported by the Danish Research Council, DART Project (5.21.08.03)
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson. Modal logic of concurrent nondeterministic programs. In Proceedings of the International Symposium on Semantics of Concurrent Computation, volume 70, pages 21–33. Springer-Verlag, 1979.
J.-P. Banâtre and D. Le Métayer. The Gamma model and its discipline of programming. Science of Computer Programming, 15:55–77, 1990.
J.-P. Banâtre and D. Le Métayer. Programming by multiset transformation. CACM, January 1993. (INRIA research report 1205, April 1990).
S. Brookes. Full abstraction for a shared variable parallel language. In Logic In Computer Science, 1993. (to appear).
C. Hankin, D. Le Métayer, and D. Sands. A calculus of Gamma programs. Research Report DOC 92/22 (28 pages), Department of Computing, Imperial College, 1992. (short version to appear in the Proceedings of the Fifth Annual Workshop on Languages and Compilers for Parallelism, Aug 1992, Springer-Verlag).
M. Hennessy and G. D. Plotkin. Full abstraction for a simple parallel programming lanuage. In Mathematical Foundations of Computer Science, volume 74 of LNCS, pages 108–120. Springer-Verlag, 1979.
L. Lamport. The Temporal Logic of Actions. Technical Report 79, DEC Systems Research Center, Palo Alto, CA, 1991.
D. Sands. Laws of parallel synchronised termination. In Theory and Formal Methods 1993: Proceedings of the First Imperial College, Department of Computing, Workshop on Theory and Formal Methods, Isle of Thorns, UK, 1993. Springer-Verlag Workshops in Computer Science.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sands, D. (1993). A compositional semantics of combining forms for gamma programs. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science, vol 735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039699
Download citation
DOI: https://doi.org/10.1007/BFb0039699
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57316-6
Online ISBN: 978-3-540-48056-3
eBook Packages: Springer Book Archive