{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T05:40:44Z","timestamp":1772084444978,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540528265","type":"print"},{"value":"9783540471592","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/bfb0032059","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"572-585","source":"Crossref","is-referenced-by-count":7,"title":["A proof system for the parallel object-oriented language POOL"],"prefix":"10.1007","author":[{"given":"F. S.","family":"de Boer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,27]]},"reference":[{"key":"43_CR1","unstructured":"P. America, F.S. de Boer: A proof theory for a sequential version of POOL, C.W.I. Report, to appear."},{"key":"43_CR2","series-title":"ESPRIT project","volume-title":"Definition of the programming language POOL-T","author":"P. America","year":"1985","unstructured":"P. America: Definition of the programming language POOL-T. ESPRIT project 415A, Doc. No. 0091, Philips Research Laboratories, Eindhoven, the Netherlands, September 1985."},{"issue":"1","key":"43_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/322358.322372","volume":"30","author":"K.R. Apt","year":"1983","unstructured":"K.R. Apt: Formal justification of a proof system for CSP. Journal ACM, Vol. 30, No. 1, 1983, pp. 197\u2013216.","journal-title":"Journal ACM"},{"issue":"3","key":"43_CR4","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, W.P. de Roever: A proof system for communicating processes, ACM Transactions on Programming Languages and Systems, Vol. 2, No. 3, 1980, pp. 359\u2013385.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"R. Gerth, W.P. de Roever: A proof system for concurrent Ada programs. Science of Computer Programming 4, pp. 159\u2013204.","DOI":"10.1016\/0167-6423(84)90018-2"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"J. Zwiers, W.P. de Roever, P. van Emde Boas: Compositionality and concurrent networks: soundness and completeness of a proof system. In: Proceedings of the 12th International Colloquium on Automata, Languages and Programming (ICALP), Nafplion, Greece, July 15\u201319, 1985, Springer Lecture Notes in Computer Science 194, pp. 509\u2013519.","DOI":"10.1007\/BFb0015776"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:45:03Z","timestamp":1586612703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528265","9783540471592"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0032059","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}