{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:13:34Z","timestamp":1725459214218},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057316X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039699","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T14:17:03Z","timestamp":1138198623000},"page":"43-56","source":"Crossref","is-referenced-by-count":8,"title":["A compositional semantics of combining forms for gamma programs"],"prefix":"10.1007","author":[{"given":"David","family":"Sands","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson. Modal logic of concurrent nondeterministic programs. In Proceedings of the International Symposium on Semantics of Concurrent Computation, volume 70, pages 21\u201333. Springer-Verlag, 1979.","DOI":"10.1007\/BFb0022461"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0167-6423(90)90044-E","volume":"15","author":"J.-P. Ban\u00e2tre","year":"1990","unstructured":"J.-P. Ban\u00e2tre and D. Le M\u00e9tayer. The Gamma model and its discipline of programming. Science of Computer Programming, 15:55\u201377, 1990.","journal-title":"Science of Computer Programming"},{"key":"4_CR3","unstructured":"J.-P. Ban\u00e2tre and D. Le M\u00e9tayer. Programming by multiset transformation. CACM, January 1993. (INRIA research report 1205, April 1990)."},{"key":"4_CR4","unstructured":"S. Brookes. Full abstraction for a shared variable parallel language. In Logic In Computer Science, 1993. (to appear)."},{"key":"4_CR5","unstructured":"C. Hankin, D. Le M\u00e9tayer, 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)."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013120. Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09526-8_8"},{"key":"4_CR7","volume-title":"Technical Report 79","author":"L. Lamport","year":"1991","unstructured":"L. Lamport. The Temporal Logic of Actions. Technical Report 79, DEC Systems Research Center, Palo Alto, CA, 1991."},{"key":"4_CR8","volume-title":"Theory and Formal Methods 1993: Proceedings of the First Imperial College, Department of Computing, Workshop on Theory and Formal Methods","author":"D. Sands","year":"1993","unstructured":"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."}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Programming and Their Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039699.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:26:08Z","timestamp":1607552768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057316X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0039699","relation":{},"subject":[]}}