{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:31Z","timestamp":1759638331832},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000297"},{"type":"electronic","value":"9783540361039"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-36103-0_5","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T23:15:07Z","timestamp":1179270907000},"page":"24-37","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Unifying Theories of Parallel Programming"],"prefix":"10.1007","author":[{"given":"Jim","family":"Woodcock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arthur","family":"Hughes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"R-J. R. Back and R. Kurki-Suonio. Decentralization of process nets with centralized control. In Proc 2nd Annual Symposium on Principles of Distributed Computing, Montreal, 1983.","DOI":"10.1145\/800221.806716"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"R. J. R. Back and J. Wright. Refinement Calculus: A Systematic Introduction. Graduate Texts in Computer Science. Springer-Verlag, 1998.","DOI":"10.1007\/978-1-4612-1674-2_1"},{"key":"5_CR3","unstructured":"Willem-Paul de Roever, Frank S. de Boer, Ulrich Hannemann, Jozef Hooman, Yassine Lakhnech, Mannes Poel, and Job Zwiers. Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Number 54 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2001."},{"key":"5_CR4","unstructured":"E. W. Dijkstra. A Discipline of Programming. Prentice-Hall International, 1976."},{"key":"5_CR5","unstructured":"C. A. R. Hoare and He Jifeng. Unifying Theories of Programming. Series in Computer Science. Prentice Hall, 1998."},{"issue":"10","key":"5_CR6","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576\u2013583, October 1969.","journal-title":"Communications of the ACM"},{"key":"5_CR7","unstructured":"C. B. Jones. Development methods for computer programs including a notion of interference. PhD thesis, University of Oxford, 1981."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Leslie Lamport and Fred B. Schneider. The \u2018Hoare Logic\u2019 of CSP, and All That. ACM Transactions on Programming Languages and Systems, 6(2):281\u2013296, April 1984.","DOI":"10.1145\/2993.357247"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF00289062","volume":"14","author":"L. Lamport","year":"1980","unstructured":"Leslie Lamport. The \u2018Hoare Logic\u2019 of Concurrent Programs. Acta Informatica, 14:21\u201337, 1980.","journal-title":"Acta Informatica"},{"key":"5_CR10","unstructured":"C. C. Morgan. Programming from Specifications. Prentice-Hall, 1990."},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0167-6423(87)90011-6","volume":"9","author":"J. M. Morris","year":"1987","unstructured":"J. M. Morris. A Theoretical Basis for Stepwise Refinement and the Programming Calculus. Science of Computer Programming, 9(3):287\u2013306, 1987.","journal-title":"Science of Computer Programming"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Susan Owicki and David Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6:319\u2013340, 1976.","journal-title":"Acta Informatica"},{"key":"5_CR13","volume-title":"Technical report","author":"J. Woodcock","year":"2002","unstructured":"Jim Woodcock and Arthur Hughes. Validation of Lamport\u2019s Concurrent Hoare Logic. Technical report, Computing Laboratory, University of Kent, Canterbury, UK, 2002."}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36103-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:17:27Z","timestamp":1558257447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36103-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000297","9783540361039"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36103-0_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"10 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}