{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:33Z","timestamp":1725663573565},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572640"},{"type":"electronic","value":"9783540480273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57264-3_45","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:34:35Z","timestamp":1330259675000},"page":"242-253","source":"Crossref","is-referenced-by-count":2,"title":["A congruence for gamma programs"],"prefix":"10.1007","author":[{"given":"Lindsay","family":"Errington","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Hankin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0167-6423(90)90044-E","volume":"15","author":"J. Ban\u00e2tre","year":"1990","unstructured":"Jean-Pierre Ban\u00e2tre and Daniel 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":"21_CR2","doi-asserted-by":"crossref","unstructured":"Jean-Pierre Ban\u00e2tre and Daniel Le M\u00e9tayer. Programming by multiset transformation. Communications of the ACM, 36(1), January 1993.","DOI":"10.1145\/151233.151242"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"S.D. Brookes. A fully abstract semantics and proof system for an ALGOL-like language with sharing. In A. Melton, editor, Prooceedings of the First International Conference on Mathematical Foundations of Programming Semantics. Springer-Verlag, LNCS 239, 1985.","DOI":"10.1007\/3-540-16816-8_26"},{"key":"21_CR4","unstructured":"S.D. Brookes. A semantically based proof system for partial correctness and deadlock in CSP. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 58\u201365. IEEE Computer Society Press, 1986."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"S.D. Brookes. An axiomatic treatment of partial correctness and deadlock in a shared variable parallel language. Technical Report CMU-CS-92-154, School of Computer Science, Carnegie Mellon University, June 1992.","DOI":"10.21236\/ADA256234"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"S.D. Brookes. Full abstraction for a shared variable parallel language. In Proceedings of the IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, July 1993.","DOI":"10.1109\/LICS.1993.287596"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Patrick Cousot. Methods and Logics for Proving Programs. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50020-2"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Lindsay Errington, Chris Hankin, and Thomas P. Jensen. Reasoning about Gamma programs. In Proc. of the First Imperial College Department of Computing Workshop on Theory and Formal Methods. To appear in the Springer-Verlag series \u201cWorkshops in Computer Science\u201d, 1993.","DOI":"10.1007\/978-1-4471-3503-6_9"},{"key":"21_CR9","unstructured":"Chris Hankin, Daniel Le M\u00e9tayer, and David Sands. A calculus of Gamma programs. Technical Report 1758, INRIA, October 1992."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"David Sands. A compositional semantics of combining forms for Gamma programs. In International Conference on Formal Methods in Programming and Their Applications. Springer-Verlag, 1993.","DOI":"10.1007\/BFb0039699"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"David Sands. Laws of parallel synchronised termination. In Proc. of the First Imperial College Department of Computing Workshop on Theory and Formal Methods. To appear in the Springer-Verlag series \u201cWorkshops in Computer Science\u201d, 1993.","DOI":"10.1007\/978-1-4471-3503-6_22"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57264-3_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:29Z","timestamp":1605647429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57264-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572640","9783540480273"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57264-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}