{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:40Z","timestamp":1725664300897},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601173"},{"type":"electronic","value":"9783540494454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60117-1_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:43:50Z","timestamp":1330260230000},"page":"197-213","source":"Crossref","is-referenced-by-count":0,"title":["A compositional proof system for asynchronously communicating processes"],"prefix":"10.1007","author":[{"given":"F. S.","family":"Boer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Hulst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01215408","volume":"6","author":"P.H.M. America","year":"1994","unstructured":"P.H.M. America and F.S. de Boer. Reasoning about dynamically evolving process structures. Formal Aspects of Computing, 6:269\u2013316, 1994.","journal-title":"Formal Aspects of Computing"},{"issue":"3","key":"11_CR2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2","author":"K.R. Apt","year":"1980","unstructured":"K.R. Apt, N. Francez, and W.-P. de Roever. A proof system for communicating sequential processes. ACM-TOPLAS, 2(3):359\u2013385, 1980.","journal-title":"ACM-TOPLAS"},{"key":"11_CR3","unstructured":"Gregory R. Andrews. Concurrent Programming, Principles and Practice. The Benjamin\/Cummings Publishing Company, Inc., 1991."},{"key":"11_CR4","volume-title":"Number 131 in Mathematical Centre Tracts","author":"R.J.R. Back","year":"1980","unstructured":"R.J.R. Back. Correctness Preserving Program Refinements: Proof Theory and Applications. Number 131 in Mathematical Centre Tracts. Mathematical Centre, Amsterdam, 1980."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"F.S. de Boer and M. van Hulst. A proof system for asynchronously communicating deterministic processes. In B. Rovan I. Pr\u00edvara and P. Ru\u017ei\u010dka, editors, Proc. MFCS '94, volume 841 of Lecture Notes in Computer Science, pages 256\u2013265. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58338-6_72"},{"key":"11_CR6","unstructured":"N. Francez. Program Verification. Addison Wesley, 1992."},{"key":"11_CR7","unstructured":"David Gries. The Science of Programming. Texts and Monographs in Computer Science. Springer, 4th print edition, 1987."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"J. Hooman and W.-P. de Roever. The quest goes on: a survey of proof systems for partial correctness of CSP. In Current trends in concurrency, volume 24 of Lecture Notes in Computer Science, pages 343\u2013395. Springer-Verlag, 1986.","DOI":"10.1007\/BFb0027044"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"B. Jonsson. A fully abstract trace model for dataflow networks. In Proc. POPL '89, 1989.","DOI":"10.1145\/75277.75291"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"M.B. Josephs. Receptive process theory. Acta Informatica, 29, 1992.","DOI":"10.1007\/BF01178564"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6:319\u2013340, 1976.","journal-title":"Acta Informatica"},{"key":"11_CR12","volume-title":"PhD thesis","author":"P.K. Pandya","year":"1988","unstructured":"P.K. Pandya. Compositional Verification of Distributed Programs. PhD thesis, Tata Institute of Fundamental Research, Homi Bhabha Road, Bombay 400 005, INDIA, 1988."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"J. Rushby S. Owre and N. Shankar. PVS: A prototype verification system. In 11th Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 748\u2013752. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55602-8_217"},{"key":"11_CR14","unstructured":"J. Zwiers. Compositionality, Concurrency and Partial Correctness. PhD thesis, Technical University Eindhoven, 1988."}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60117-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:55:05Z","timestamp":1605628505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601173","9783540494454"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}