{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:00Z","timestamp":1725663660196},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":[[1991]]},"DOI":"10.1007\/3-540-54430-5_92","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:48:20Z","timestamp":1330210100000},"page":"235-249","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Process algebra with guards"],"prefix":"10.1007","author":[{"given":"Jan Friso","family":"Groote","sequence":"first","affiliation":[]},{"given":"Alban","family":"Ponse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(84)90067-7","volume":"30","author":"D. Austry","year":"1984","unstructured":"D. Austry and G. Boudol. Alg\u00e8bre de processus et synchronisations. Theoretical Computer Science, 30(1):91\u2013131, 1984.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"18_CR2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"K.R. Apt","year":"1981","unstructured":"K.R. Apt. Ten years of Hoare's logic, a survey, part I. ACM Transactions on Programming Languages and Systems, 3(4):431\u2013483, 1981.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra and J.W. Klop. The algebra of recursively defined processes and the algebra of regular processes. In J. Paredaens, editor, Proceedings 11\n th\n \nICALP, Antwerp, volume 172 of Lecture Notes in Computer Science, pages 82\u201395. Springer-Verlag, 1984.","DOI":"10.1007\/3-540-13345-3_7"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"18_CR5","volume-title":"A Discipline of Programming","author":"E.W. Dijkstra","year":"1976","unstructured":"E.W. Dijkstra. A Discipline of Programming. Prentice-Hall International, Englewood Cliffs, 1976."},{"key":"18_CR6","volume-title":"Process algebra with guards. Report CS-R9069","author":"J.F. Groote","year":"1990","unstructured":"J.F. Groote and A. Ponse. Process algebra with guards. Report CS-R9069, CWI, Amsterdam, 1990."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10), October 1969.","DOI":"10.1145\/363235.363259"},{"key":"18_CR8","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"E.G. Manes and M.A. Arbib. Algebraic Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4962-7"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, pages 319\u2013340, 1976.","DOI":"10.1007\/BF00268134"},{"key":"18_CR12","unstructured":"G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"18_CR13","unstructured":"A. Ponse. Process expressions and Hoare's logic. Technical Report CS-R8905, CWI, Amsterdam, March 1989. To appear in Information and Computation."},{"issue":"3","key":"18_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.2307\/2271618","volume":"29","author":"F.M. Sioson","year":"1964","unstructured":"F.M. Sioson. Equational bases of Boolean algebras. Journal of Symbolic Logic, 29(3):115\u2013124, September 1964.","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_92","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:54:45Z","timestamp":1578527685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_92"}},"subtitle":["Combining hoare logic with process algebra"],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}