{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:00:19Z","timestamp":1743051619453,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540115762"},{"type":"electronic","value":"9783540393085"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/bfb0012774","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T08:00:52Z","timestamp":1132732852000},"page":"252-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A sound and complete HOARE axiomatization of the ADA-rendezvous"],"prefix":"10.1007","author":[{"given":"Rob","family":"Gerth","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,22]]},"reference":[{"key":"23_CR1","unstructured":"Apt, K.: Formal Justification of a Proof System for Communicating Sequential Processes. to appear"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3\u20134","author":"K. Apt","year":"1981","unstructured":"Apt, K.: Ten Years of Hoare's Logic: A Survey \u2014 Part 1. TOPLAS 3\u20134 p.431\u2013484, 1981.","journal-title":"TOPLAS"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2\u20133","author":"K. Apt","year":"1980","unstructured":"Apt, K., N. Francez, W.P. de Roever: A Proof System for Communicating Sequential Processes. TOPLAS 2\u20133 p.359\u2013385, 1980.","journal-title":"TOPLAS"},{"key":"23_CR4","unstructured":"The Programming Language ADA. Reference manual. LNCS 106, Springer Verlag, New York, 1981."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Barringer, H., I.Mearns: Axioms and Proof Rules for ADA Tasks. Technical report, Dept. of Computer Science, University of Manchester, 1981.","DOI":"10.1049\/ip-e.1982.0010"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Francez, N., E.M.Clarke, C.Nikolaou: Extended Naming Conventions for Communicating Processes and their Proof Rules. Proc. 9th Symp. on POPL, 1982.","DOI":"10.1145\/582153.582158"},{"key":"23_CR7","unstructured":"Gerth, R.: A Proof System for a Subset of the Concurrency Section of ADA. Technical report RUU-CS-81-17, Dept. of Computer Science, University of Utrecht, 1981."},{"key":"23_CR8","first-page":"132","volume-title":"Lecture Notes in Computer Science","author":"Rob Gerth","year":"1982","unstructured":"Gerth, R., W.P. de Roever, M. Roncken: Procedures and Concurrency: A Study in Proof. Proc. Vth International Symposium on Programming, Turijn, 1982."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Gerth, R.: A Sound and Complete Hoare Axiomatization of the ADA Rendezvous. Technical report, Dept. of Computer Science, University of Utrecht, 1982.","DOI":"10.1007\/BFb0012774"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1145\/357114.357119","volume":"2\u20134","author":"D. Gries","year":"1980","unstructured":"Gries, D., G.Levin: Assignment and Procedure Call Proof Rules. TOPLAS 2\u20134 p.564\u2013580, 1980.","journal-title":"TOPLAS"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Owicki, S., D.Gries: An Axiomatic Proof Technique for Parallel Programs 1. Acta Inf. 6 p.319\u2013340, 1976.","journal-title":"Acta Inf."},{"key":"23_CR12","volume-title":"Technical report","author":"A. Pnueli","year":"1982","unstructured":"Pnueli, A., W.P. de Roever: Fairness in the programming language ADA. Technical report, Dept. of Computer Science, Weizmann Instute, Israel, 1982."},{"key":"23_CR13","first-page":"88","volume-title":"GI \u2014 11. Jahrestagung","author":"M. Roncken","year":"1981","unstructured":"Roncken, M., R.Gerth, W.P. de Roever: A Proof System for Brinch Hansen's Distributed Processes. Proc. GI81 M\u00fcnchen, 1981."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:23:31Z","timestamp":1578525811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012774"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540115762","9783540393085"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0012774","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1982]]},"assertion":[{"value":"22 October 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}