论文信息 - A Compositional Semantics of Combining Forms for Gramma Programs

A Compositional Semantics of Combining Forms for Gramma Programs

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.

David Sands

[1] Daniel Le Métayer,et al. Programming by multiset transformation , 1993, CACM.

[2] Matthew Hennessy,et al. Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[3] Karl R. Abrahamson. Modal Logic of Concurrent Nondeterministic Programs , 1979, Semantics of Concurrent Computation.

[4] Daniel Le Métayer,et al. The GAMMA Model and Its Discipline of Programming , 1990, Sci. Comput. Program..

[5] Mark Ryan,et al. Proceedings of the First Imperial College Department of Computing Workshop on Theory and formal methods 1993 , 1993, FME 1993.

[6] Leslie Lamport,et al. The temporal logic of actions , 1994, TOPL.

[7] Chris Hankin,et al. A Calculus of Gamma Programs , 1992, LCPC.

[8] Stephen D. Brookes,et al. Full abstraction for a shared variable parallel language , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[9] David Sands. Laws of Parallel Synchronised Termination , 1993, Theory and Formal Methods.