{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:18Z","timestamp":1725664518445},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_85","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:03:54Z","timestamp":1330293834000},"page":"703-718","source":"Crossref","is-referenced-by-count":3,"title":["Modular verification for shared-variable concurrent programs"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Dingel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"M. Abadi","year":"1993","unstructured":"M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15:73\u2013132, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"42_CR2","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/BF00291051","volume":"25","author":"R.J.R. Back","year":"1988","unstructured":"R.J.R. Back. A calculus of refinements for program derivations. Acta Informatica, 25:593\u2013624, 1988.","journal-title":"Acta Informatica"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper, and A. Pnueli. Now you may compose temporal logic specifications. In Sixteenth Annual ACM Symposium on Theory of Computing, pages 51\u201363. ACM, April 1984.","DOI":"10.1145\/800057.808665"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"S. D. Brookes. Full abstraction for a shared-variable parallel language. In Proceedings 8th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, June 1993.","DOI":"10.1109\/LICS.1993.287596"},{"key":"42_CR5","unstructured":"E. W. Dijkstra. A discipline of programming. Prentice Hall, 1976."},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"J. Dingel. Towards a theory for shared-variable concurrent programming. Thesis proposal, Carnegie Mellon University, 1996.","DOI":"10.1007\/3-540-61604-7_85"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"O. Grumberg and D. Long. Model checking and modular verification. In CONCUR '91, LNCS 527. Springer Verlag, 1991.","DOI":"10.1007\/3-540-54430-5_93"},{"key":"42_CR8","unstructured":"C. B. Jones. Specification and design of (parallel) programs. In IFIF '83, 1983."},{"issue":"2","key":"42_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0304-3975(87)90007-7","volume":"49","author":"K. G. Larsen","year":"1987","unstructured":"K. G. Larsen. A context dependent equivalence between processes. Theoretical Computer Science, 49(2):185\u2013216, 1987.","journal-title":"Theoretical Computer Science"},{"key":"42_CR10","unstructured":"Robin Milner. Communication and Concurrency. Prentise Hall International, 1989."},{"issue":"3","key":"42_CR11","doi-asserted-by":"crossref","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, December 1987.","journal-title":"Science of Computer Programming"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3), January 1989.","DOI":"10.1145\/44501.44503"},{"key":"42_CR13","unstructured":"C. Morgan. Programming from specifications. Prentice Hall, 1994."},{"key":"42_CR14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S.S. Owicki","year":"1976","unstructured":"S.S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6:319\u2013340, 1976.","journal-title":"Acta Informatica"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"A. Pnueli. In transition from global to modular temporal reasoning about programs. In K.R. Apt, editor, Logics and Models of Concurrent Systems, NATO ASI F13, pages 123\u2013144. Springer Verlag, 1985.","DOI":"10.1007\/978-3-642-82453-1_5"},{"key":"42_CR16","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(88)90033-3","volume":"89","author":"C. Stirling","year":"1988","unstructured":"C. Stirling. A generalization of Owicki-Gries' Hoare logic for a concurrent while language. Theoretical Computer Science, 89:347\u2013359, 1988.","journal-title":"Theoretical Computer Science"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"K. St\u00d8len. A method for the development of totally correct shared-state parallel programs. In CONCUR '91. Springer Verlag, 1991.","DOI":"10.1007\/3-540-54430-5_110"}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:37Z","timestamp":1605647317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}