{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:19:09Z","timestamp":1725455949256},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540541314"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019365","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:26:33Z","timestamp":1132637193000},"page":"478-503","source":"Crossref","is-referenced-by-count":0,"title":["A compositional proof system for distributed programs"],"prefix":"10.1007","author":[{"given":"Kastytis","family":"Ge\u010das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/322358.322372","volume":"30","author":"K.R. Apt","year":"1983","unstructured":"Apt K.R. (1983). Formal justification of a proof system for communicating sequential processes Journal of the ACM\n30, No. 1, pp. 197\u2013216.","journal-title":"Journal of the ACM"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1137\/0207005","volume":"7","author":"S.A. Cook","year":"1978","unstructured":"Cook S.A. (1978). Soundness and completeness of an axiom system for program verification SIAM J. Comput.\n7, No. 1, pp.70\u201390","journal-title":"SIAM J. Comput."},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(79)90006-0","volume":"19","author":"N. Francez","year":"1979","unstructured":"Francez N., Hoare C.A.R., Lehmann D.J.,de Roever W.P. (1979). Semantics of nondeterminism, concurrency, and communication Journal of Computer and System Sciences\n19, No. 3, pp.290\u2013308.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR4","unstructured":"Ge\u010das K. (1988). An axiom system for proving properties of simple multimodular programs Kibernetika (Kiev) No. 2 pp. 33\u201338. (in Russian)"},{"key":"13_CR5","unstructured":"Gorochovskij S.S.,Kapitonova J.V.,Letichevskij A.A.,Molchanov I.N., Pogrebinskij S.B. (1984). Algorithmic language MAJAK Kibernetika, No. 3, pp.54\u201374. (in Russian)"},{"issue":"10","key":"13_CR6","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare C.A.R. (1969). Axiomatic basis for computer programming Comm. of ACM\n12, No. 10, pp. 576\u2013580","journal-title":"Comm. of ACM"},{"issue":"8","key":"13_CR7","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare C.A.R. (1978). Communicating sequential processes Comm. of the ACM\n21, No. 8, pp.666\u2013677.","journal-title":"Comm. of the ACM"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BFb0027044","volume":"224","author":"J. Hooman","year":"1986","unstructured":"Hooman J., de Roever W.P. (1986). The quest goes on: a survey of proofsystems for partial correctness of CSP Lect. Notes Comp. Sci.\n224, pp. 343\u2013395","journal-title":"Lect. Notes Comp. Sci."},{"key":"13_CR9","unstructured":"Letichevskij A.A., Godlevskij A.B., Doroshenko A.E., Krivoj S.L. (1983). A semantics of data communication in simple multimodular programs Programmirovanie, No. 5, pp. 3\u201311. (in Russian)"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF00289266","volume":"15","author":"G.M. Levin","year":"1981","unstructured":"Levin G.M., Gries D. (1981). A proof technique for communicating sequential processes Acta Informatica\n15, No. 2, pp. 281\u2013302.","journal-title":"Acta Informatica"},{"key":"13_CR11","unstructured":"Nepomnyashchij V.A. (1986). On problem-oriented program verification Programmirovanie No. 1, pp. 3\u201313. (in Russian)"},{"key":"13_CR12","first-page":"199","volume-title":"Formal Descriptions of Programming Consepts","author":"G.D. Plotkin","year":"1983","unstructured":"Plotkin G.D. (1983). An operational semantics for CSP In: Formal Descriptions of Programming Consepts, North-Holl., Amsterdam pp. 199\u2013223"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/1780.1805","volume":"6","author":"N. Soundararajan","year":"1984","unstructured":"Soundararajan N. (1984). Axiomatic semantics of communicating sequential processes ACM Trans. Progr. Lang. Sys.\n6, No. 4, pp.647\u2013662.","journal-title":"ACM Trans. Progr. Lang. Sys."},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/BFb0015776","volume":"194","author":"J. Zwiers","year":"1985","unstructured":"Zwiers J.,de Roever W.P.,van Emde Boas P. (1985). Compositionality and concurrent networks: soundness and completeness of a proofsystem Lect. Notes in Comp. Sci.\n194, pp.509\u2013519.","journal-title":"Lect. Notes in Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Baltic Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019365.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:42:18Z","timestamp":1607550138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540541314"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0019365","relation":{},"subject":[]}}