Refining multiset transformers

Theoretical Computer Science

Volumn 192, Issue 2, 1998, Pages 233-258

  Hankin, Chris ^a   Le Métayer, Daniel ^b   Sands, David ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b CAMPUS DE BEAULIEU   (France)

^c CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Gamma; Multiset rewriting; Program transformation

Indexed keywords

EID: 0004362856     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00151-5     Document Type: Article

References (23)

1. K. Abrahamson, Modal logic of concurrent nondeterministic programs, in: Proc. Internat. Symp. on Semantics of Concurrent Computation, vol. 70, SV, 1979, pp. 21-33.
2. R. Allen, D. Garlan, Formalising architectural connection, in: Proc. IEEE 16th Internat. Conf. on Software Engineering, 1994, pp. 71-80.
3. J.-M. Andreoli, R. Pareschi, Linear objects: logical processes with built-in inheritence, New Generation Comput. 9 (1991) 445-473.
4. R. Back, Refinement calculus, Part 2: parallel and reactive programs, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg (Eds.), Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, Lecture Notes in Computer Science, vol. 430, Springer, Berlin, 1990.
5. J.-P. Banâtre, D. Le Métayer, The Gamma model and its discipline of programming, Sci. Comput. Programming 15 (1990) 55-77.
6. J.-P. Banâtre, D. Le Métayer, Programming by multiset transformation, Comm. ACM 36(1) (1993) 98-111.
7. J.-P. Banâtre, D. Le Métayer, Gamma and the chemical reaction model, in: J.-M. Andreoli, C. Hankin, D. Le Métayer (Eds.), Coordination Programming: Mechanisms, Models and Semantics, IC Press, London, 1996.
8. S. Brookes, Full abstraction for a shared variable parallel language, in: Logic in Computer Science, IEEE Press, New York, 1993.
9. N. Carriero, D. Gelernter, Linda in context, Comm. ACM 32(4) (1989) 444-458.
10. N. Carriero, D. Gelernter, How to Write Parallel Programs, MIT Press, Cambridge, MA, 1990.
11. K.M. Chandy, J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, Reading, MA, 1988.
12. M. Chaudron, E. de Jong, Towards a compositional method for coordinating Gamma programs, in: P. Ciancarini, C. Hankin (Eds.), Coordination'96 Conf., Lecture Notes in Computer Science, vol. 1061, Springer, Berlin, 1996, pp. 107-123.
13. P. Ciancarini, R. Gorrieri, G. Zavattaro, An alternative semantics for the calculus of gamma programs, in: J.-M. Andreoli, C. Hankin, D. Le Métayer (Eds.), Coordination Programming: Mechanisms, Models and Semantics. IC Press, London, 1996.
14. D. Cohen, J. Muylaert-Filho, Introducing a calculus for higher-order multiset programming, in: P. Ciancarini, C. Hankin (Eds.), Coordination'96 Conf., Lecture Notes in Computer Science, vol. 1061, Springer, Berlin, pp. 124-141.
15. F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten, The failure of failures in a paradigm for asynchronous communication, in: J.C.M. Baeten, J.F. Groote (Eds.), Concur'91, Lecture Notes in Computer Science, vol. 527, Springer, Berlin, 1991, pp. 111-126.
16. P. Fradet, D. Le Métayer, Structured gamma, Tech. Report 989, IRISA, 1996.
17. D. Gelernter, Generative communication in Linda, ACM Trans. Programming Languages Systems, 7(1) (1985) 80-112.
18. C. Hankin, D. Le Métayer, D. Sands, A calculus of gamma programs, in: U. Banerjee, D. Gelernter, A. Nicolau, D. Padua (Eds.), Proc. 5th Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, vol. 757, Springer, Berlin, 1992.
19. D. Le Métayer, Higher-order multiset programming, in: Proc. DIMACS Workshop on Specifications of Parallel Algorithms, American Mathematical Society, Providence, RI, 1994.
20. D. Le Métayer, Software architecture styles as graph grammars, in: Proc. ACM SIGSOFT'96 4th Symp. on the Foundations of Software Engineering, ACM Press, New York, 1996.
21. D. Park, On the semantics of fair parallelism, in: Abstract Software Specifications (1979 Copenhagen Winter School Proc.), Lecture Notes in Computer Science, vol. 86, Springer, Berlin, 1979, pp. 504-526.
22. D. Sands, A compositional semantics of combining forms for Gamma programs, in: D. Bjoerner, M. Broy, I. Pottosin (Eds.), Formal Methods in Programming and Their Applications, Internat. Conf. Academgorodok, Novosibirsk, Russia, June/July 1993., Lecture Notes in Computer Science, vol. 735, Springer, Berlin, 1993, pp. 43-56.
23. D. Sands, Laws of parallel synchronised termination, in: G.L. Burn, S.J. Gay, M.D. Ryan (Eds.), Theory and Formal Methods 1993: Proc. 1st Imperial College, Department of Computing, Workshop on Theory and Formal Methods, Isle of Thorns, UK, 1993; Springer, Workshops in Computer Science.