{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:24:28Z","timestamp":1726406668971},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54430-5_110","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:49:07Z","timestamp":1330210147000},"page":"510-525","source":"Crossref","is-referenced-by-count":31,"title":["A method for the development of totally correct shared-state parallel programs"],"prefix":"10.1007","author":[{"given":"Ketil","family":"St\u00f8len","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"36_CR1","unstructured":"P. Aczel. On an inference rule for parallel composition. Unpublished Paper, February 1983."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"K. R. Apt, F. S. de Boer, and E. R. Olderog. Proving termination of parallel programs. In W. H. J. Feijen, A. J. M. van Gasteren, D. Gries, and J. Misra, editors, Beauty Is Our Business, A Birthday Salute to Edsger W. Dijkstra. Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4612-4476-9_1"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper, and A. Pnueli. Now you may compose temporal logic specifications. In Proc. Sixteenth ACM Symposium on Theory of Computing, pages 51\u201363, 1984.","DOI":"10.1145\/800057.808665"},{"key":"36_CR4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00289074","volume":"9","author":"N. Francez","year":"1978","unstructured":"N. Francez and A. Pnueli. A proof method for cyclic programs. Acta Informatica, 9:133\u2013157, 1978.","journal-title":"Acta Informatica"},{"key":"36_CR5","unstructured":"C. B. Jones. Development Methods for Computer Programs Including a Notion of Interference. PhD thesis, Oxford University, 1981."},{"key":"36_CR6","unstructured":"C. B. Jones. Specification and design of (parallel) programs. In Mason R.E.A., editor, Proc. Information Processing 83, pages 321\u2013331, 1983."},{"key":"36_CR7","unstructured":"C. B. Jones. Systematic Software Development Using VDM, Second Edition. Prentice-Hall International, 1990."},{"key":"36_CR8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6:319\u2013340, 1976.","journal-title":"Acta Informatica"},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(84)90122-1","volume":"31","author":"N. Soundararajan","year":"1984","unstructured":"N. Soundararajan. A proof technique for parallel programs. Theoretical Computer Science, 31:13\u201329, 1984.","journal-title":"Theoretical Computer Science"},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(88)90033-3","volume":"58","author":"C. Stirling","year":"1988","unstructured":"C. Stirling. A generalization of Owicki-Gries's Hoare logic for a concurrent while language. Theoretical Computer Science, 58:347\u2013359, 1988.","journal-title":"Theoretical Computer Science"},{"key":"36_CR11","unstructured":"K. St\u00f8len. Development of Parallel Programs on Shared Data-Structures. PhD thesis, University of Manchester, 1990."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"K. St\u00f8len. Proving total correctness with respect to fair (shared-state) parallel languages. In preparation, 1991.","DOI":"10.1007\/978-1-4471-3550-0_17"},{"key":"36_CR13","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/3-540-50214-9_27","volume":"328","author":"J. C. P. Woodcock","year":"1988","unstructured":"J. C. P. Woodcock and B. Dickinson. Using VDM with rely and guarantee-conditions. Experiences from a real project. In: R. Bloomfield, L. Marshall, and R. Jones, editors, Proc. 2nd VDM-Europe Symposium, Lecture Notes in Computer Science 328, pages 434\u2013458, 1988.","journal-title":"Lecture Notes in Computer Science"},{"key":"36_CR14","unstructured":"Q. Xu and J. He. A theory of state-based parallel programming by refinement:part 1. In J. Morris, editor, Proc. 4th BCS-FACS Refinement Workshop, 1991."}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_110.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:20Z","timestamp":1605646460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_110","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}